Equal trace prefixes determine Newton coefficient prefixes
ProvedCouret.CayleyNewton.newton_coefficient_prefix_eqcouret-programmecouret-unification-20261108
Let and . For each , suppose and , and suppose throughout that range. Then
This transfers an initial segment of trace agreement to coefficient agreement.
Preamble
import Definitions.Def_Couret_CayleyTwoColourNewton_1eb4b626b6a5 import Mathlib import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d /-! COU-20 — rational Newton recurrence research bridge (18 October 2026). UNCOMPILED PROOF CANDIDATE. Deliberately isolated from certified modules. This is a substantive intermediate obligation: the all-powers trace consequence is derived from two explicit, identical Newton recurrences, NOT from an opaque hypothesis equating the traces. It still remains to prove that the trace sequence of EVERY rational square matrix satisfies this exact recurrence from its characteristic polynomial. Neither the existence of a proof in Mathlib at the pinned commit nor a Lean 4.29.1 compilation of this file is claimed here. -/ set_option autoImplicit false noncomputable section open Matrix open scoped BigOperators namespace Couret.CayleyNewton
Formal statement
theorem newton_coefficient_prefix_eq (c d u v : ℕ → ℚ) (ell : ℕ)
(hu : ∀ k : ℕ, 0 < k → k < ell → NewtonTraceEquation c u k)
(hv : ∀ k : ℕ, 0 < k → k < ell → NewtonTraceEquation d v k)
(htrace : ∀ k : ℕ, 0 < k → k < ell → u k = v k) :
∀ k : ℕ, 0 < k → k < ell → c k = d k := by sorry
end Couret.CayleyNewton
namespace Couret.CayleyDoublet
open Couret.CayleyNewton
variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]
end Couret.CayleyDoublet
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/65b828d9ffd016ce2a1b05403f303fa5f948c10f/research/correspondants_20261013/lean/CayleyTwoColourNewton.lean#L173-L210, lines 173–210; source file SHA-256 2a16c18cd916994db6f9967e25da73baa67cd8fa6f444067cba08d9bc99d049c; theorem Couret.CayleyNewton.newton_coefficient_prefix_eq