Degree-16 obstruction to transport-Gini Candidate A
ProvedDerivativeChainGini.actual_polynomial_counterexampleThis declaration has no parameters or hypotheses. Let in , let parent multiplicities be and child multiplicities be , and define as parent multiplicity divided by and as child multiplicity divided by . For any real mass vector on these five indices, put . Put ; this is a real infimum over fractional finite couplings with no further constraints. Let and , the defined source and normalizedChild. The declaration asserts, jointly: ; is monic; ; as a complex polynomial identity; for each of the five indices , and , where is the root multiset and counts multiplicity; ; ; ; and . The mass laws use all root occurrences, not a uniform law on distinct root values: the source has four occurrences at each of and none at zero, while the child has three at every listed point and degree , as identified by the separate root and degree bridge declarations. The five-point infimum has a feasible coupling with for , for , and all other entries zero; the source separately proves its cost and the lower bound for every feasible array. There are no free polynomial or degree quantifiers in this assertion.
import Mathlib import Definitions.Def_DerivativeChainGini_GiniCounterexample set_option autoImplicit false namespace DerivativeChain end DerivativeChain namespace DerivativeChainContinuation end DerivativeChainContinuation namespace DerivativeChainDivisorAnchor end DerivativeChainDivisorAnchor namespace DerivativeChainGini end DerivativeChainGini namespace DerivativeChainGiniCircle end DerivativeChainGiniCircle namespace DerivativeChainGiniFamily end DerivativeChainGiniFamily namespace DerivativeChainPrivate end DerivativeChainPrivate set_option autoImplicit false open scoped BigOperators open DerivativeChainGini open Polynomial
theorem DerivativeChainGini.actual_polynomial_counterexample :
source = (X^4-1 : ℂ[X])^4 ∧ source.Monic ∧ source.natDegree = 16 ∧
C (1/16 : ℂ) * source.derivative = X^3*(X^4-1)^3 ∧
(∀ i : Fin 5, parentMass i = (source.roots.count (vertex i) : ℝ)/source.natDegree) ∧
(∀ i : Fin 5, childMass i = (normalizedChild.roots.count (vertex i) : ℝ)/normalizedChild.natDegree) ∧
optimalW1 = 1/5 ∧ gini parentMass = (1+Real.sqrt 2)/2 ∧
optimalW1 - ((16/15 : ℝ)*gini parentMass-gini childMass) = (23-16*Real.sqrt 2)/75 ∧
(16/15 : ℝ)*gini parentMass-gini childMass < optimalW1 := by sorry