No finite variance correction repairs the Gini transport increment
ProvedDerivativeChainGiniFamily.actual_polynomial_family_counterexampleFor every real constant , with no sign restriction, there exists a natural number (the domain includes and has no additional lower-bound hypothesis) such that the following joint assertion holds. Put , , , and . Let be the finite root-slot type of the multiset of roots of , retaining multiplicities; it has slots. On the disjoint union , define and to be the complex root value of slot , parent weights , , and child weights , . For a polynomial , define , , and ; all root sums retain multiplicity. Define as the real infimum of over all real nonnegative arrays with every row sum and every column sum , without further constraints. The joint assertion is: ; is monic; ; ; for every function , ; independently for every such , ; ; ; and . These universally quantified test functions need no measurability, continuity, boundedness, or integrability hypotheses because the expectations are finite sums. The root-law bridge declarations identify and , with . The optimization in this assertion is specifically the finite array problem on , related to the polynomial root laws by the two displayed expectation identities. Its nonempty admissible set is exhibited separately by the array sending from each root slot to and retaining on that slot's diagonal; , each slot has norm , and the source separately proves that every admissible array costs at least . The derivative is the actual formal derivative, scaled by the nonzero complex scalar .
import Mathlib import Definitions.Def_DerivativeChainGini_GiniBinomialFamily import Definitions.Def_DerivativeChainGini_GiniCandidateB import Definitions.Def_DerivativeChainGini_GiniFamilyTransport 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 Polynomial DerivativeChainContinuation open DerivativeChainGiniFamily
theorem DerivativeChainGiniFamily.actual_polynomial_family_counterexample (C : ℝ) : ∃ n : ℕ,
source n = (X^(n+2)-1 : ℂ[X])^16 ∧ (source n).Monic ∧
(source n).natDegree = 16*(n+2) ∧
Polynomial.C ((16*(n+2) : ℂ)⁻¹)*(source n).derivative =
X^(n+1)*(X^(n+2)-1)^15 ∧
(∀ f : ℂ → ℝ, (∑ i : Option (Slots n), parentMass i*f (point (rootSlot n) i)) =
empiricalExpectation (source n) f) ∧
(∀ f : ℂ → ℝ, (∑ i : Option (Slots n), childMass (epsilon n) i*f (point (rootSlot n) i)) =
empiricalExpectation (normalizedChild n) f) ∧
empiricalVariance (source n) = 1 ∧
optimalW1 (rootSlot n) (epsilon n) = epsilon n ∧
empiricalGini (source n)-empiricalGini (normalizedChild n) +
C*Real.sqrt (empiricalVariance (source n))/(source n).natDegree <
optimalW1 (rootSlot n) (epsilon n) := by sorry