Every monic cubic has a balanced signed-turning law
ProvedCubicTurning.every_monic_cubic_signed_turning_lawFor , use Euclidean modulus and set , with real division by zero defined to be . Let mean or the same two inequalities with exchanged. Put , if holds and otherwise, and if holds and otherwise. Every threshold inequality is non-strict. For complex , put , , and . For complex put . A length-three chain means precisely , , and . Being forward for an axis and consecutive displacements , means , , and ; zero displacements and zero projections are allowed. A uniform labelled law for with start consists of three chains , , and axes , each forward for its chain, satisfying and , , . Its mean energy is . These are three equally weighted slots; repetitions remain separate slots, and no distinctness, independence, or greedy minimization condition is imposed. For every polynomial that is monic and has natural degree exactly , there exist complex with and a uniform labelled law for this triple with start such that: for every , , so the orders at are ; for every function , ; ; and the scalar is at most both and . The same existential triple and law satisfy every conclusion. The two bounds are non-strict; has no regularity assumption. Repeated roots, a triple root, zero variance, and zero displacements are included; degree exactly three excludes lower-degree and zero polynomials. No uniqueness or greedy condition is asserted.
This is the all-monic-cubic upper result for a finite labelled law. For its single constructed law,
The terminal marginal counts root multiplicity; the statement includes every degenerate cubic allowed by monicity and degree three.
import Mathlib import Definitions.Def_CubicTurning_foundations import Definitions.Def_DerivativeChainPrivate_foundations set_option autoImplicit false set_option maxHeartbeats 1200000 open scoped BigOperators open ComplexConjugate
theorem CubicTurning.every_monic_cubic_signed_turning_law (p : Polynomial ℂ)
(hp : p.Monic) (hd : p.natDegree=3) :
∃ a b c : ℂ, p=DerivativeChainPrivate.fromRoots (![a,b,c] : Fin 3 → ℂ) ∧
∃ L : AffineUniformForwardLaw a b c (centroid a b c),
(∀ i j : Fin 3, ((Polynomial.derivative^[3-(j.val+1)]) p).eval (L.paths i j)=0) ∧
(∀ f : ℂ → ℝ, (∑ i,f (L.paths i 2))/3=(f a+f b+f c)/3) ∧
(∑ i,(1/3:ℂ)*(L.paths i 2-centroid a b c))=0 ∧
(∑ i,halfAngleEnergy (L.axes i) (L.paths i 1-L.paths i 0) (L.paths i 2-L.paths i 1))/3 ≤
(anisotropy a b c+Real.sqrt (anisotropy a b c*(2*centeredVariance a b c-anisotropy a b c)))/3 ∧
(∑ i,halfAngleEnergy (L.axes i) (L.paths i 1-L.paths i 0) (L.paths i 2-L.paths i 1))/3 ≤
(2/3)*centeredVariance a b c := by sorry