A nonzero complex similarity preserves the entire greedy predicate
ProvedDerivativeChainContinuation.affine_greedy_iffcontinuation-20261027derivative-chainsgreedynearest-parent
For a nonempty labelled tuple a=(a_0,…,a_n)∈ℂ^(n+1), put N=n+1 and p_a(X)=∏(j=0)^n(X-a_j). Its ordinary row of degree m is P_m=p_a differentiated N-m times, for 1≤m≤N. An actual greedy location history z=(z_0,…,z_n) satisfies P(i+1)(z_i)=0 and |z_(i+1)-z_i|≤|w-z_i| for every i<n and every complex root w of P_(i+2). Its length is L(z)=Σ_(i=0)^(n-1)|z_(i+1)-z_i|. Repeated root values and every local tie are allowed. For arbitrary a,z∈ℂ^N and o,c∈ℂ with c≠0, the transformed history (o+cz_i)_i is an actual greedy history for source (o+ca_j)_j if and only if z is an actual greedy history for a.
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_GreedyActual import Definitions.Def_DerivativeChainPrivate_foundations set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option maxHeartbeats 1600000 open Polynomial DerivativeChainPrivate namespace DerivativeChainContinuation end DerivativeChainContinuation open DerivativeChainContinuation open scoped BigOperators
Formal statement
theorem DerivativeChainContinuation.affine_greedy_iff {n : ℕ} (a z : Fin (n+1) → ℂ)
(o c : ℂ) (hc : c≠0) :
IsGreedyChain (fun i => o+c*a i) (fun i => o+c*z i) ↔ IsGreedyChain a z := by sorrySource
Private analytic checkpoint d69f598e254dee1915468fa93b3e33b8e1b5b7d6: research-results/unified-20261025/greedy/RAY_THEOREM.md, SHA-256 0d8a115e7059d0fae02ca0217cd20d64fc1baaf2a83795a4b171fa556be44a57. Local formal commit 7200800a2f88105b736aa292a1ec518302074d94 (not asserted pushed), submission_sync/new_formal/greedy/GreedyAffine.lean, lines 43-67, SHA-256 5199684125a29b206d508d42c435db1c20a7cb0da21008d4e73cd13b18831f83.