No finite pair-distance-drop factor on explicit polynomial powers
ProvedDerivativeChainDivisorAnchor.actual_power_pair_drop_counterexampleFor every real , with no sign hypothesis, there exists a natural for which the following joint assertion holds. For a natural , set , , , and , where the last exponent is real exponentiation, exactly . Set and . These are the source and child denoted obstructionSource and obstructionChild; their definitions before the simplification use with natural subtraction and the base polynomial , scaling its roots by or . For any complex polynomial , write for its multiset of complex roots, retaining every multiplicity, , and , where both sums count root occurrences and ordered pairs, including the zero diagonal. A root slot is one occurrence in the multiset, not merely a distinct root value. Define . Define as the real infimum of the set of costs over all real arrays on the two root-slot sets satisfying , for every source slot , and for every target slot . These are finite fractional couplings with only those nonnegativity and marginal constraints. Each occurrence has mass reciprocal to its polynomial's degree; there is no choice of distinct-root uniform law in this definition. Set , and , exactly pairSource and pairChild. Set , , , and . Thus pairDrop is half the difference of unnormalized ordered root-pair distance sums, poweredCost is , and pairRatio is ; none of these definitions inserts empirical-degree denominators into . It asserts , that is monic, , that every root occurrence of has norm at most , that , that as an identity of complex polynomials, that , and that . The natural exponent is subtraction in ; here , so it is the ordinary predecessor and no truncated-subtraction edge case occurs. The root and derivative bridges separately proved in the sources are , , , and . Thus the root law optimized by is uniform over all and multiset occurrences, respectively, including the repeated roots from the polynomial power. The target child is specifically , defined before asserting its equality with the scaled actual derivative. The positive degrees give a nonempty admissible coupling set via the product array and nonnegative costs. The source also proves the bridge , where ; this identity relates the half-pair-sum difference to the earlier anchor without replacing by another optimization.
import Mathlib import Definitions.Def_DerivativeChainGini_DivisorAnchorNoGo import Definitions.Def_DerivativeChainGini_DivisorParameters import Definitions.Def_DerivativeChainGini_DivisorRootTransport import Definitions.Def_DerivativeChainGini_PairDropNoGo import Definitions.Def_DerivativeChainGini_PairDropPolynomialPower 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 DerivativeChainGiniFamily open DerivativeChainDivisorAnchor
theorem DerivativeChainDivisorAnchor.actual_power_pair_drop_counterexample (K : ℝ) : ∃ k : ℕ, 3 ≤ k ∧
pairSource k=(obstructionSource k)^(12*orbitCount k) ∧ (pairSource k).Monic ∧
(pairSource k).natDegree=192*k^9 ∧
(∀ i : (pairSource k).roots, ‖(i:ℂ)‖ ≤ 1) ∧ (pairSource k).roots.sum=0 ∧
C (((pairSource k).natDegree:ℂ)⁻¹)*(pairSource k).derivative=pairChild k ∧
0 < pairDrop (pairSource k) (pairChild k) ∧
K*pairDrop (pairSource k) (pairChild k) <
(pairSource k).natDegree*(((pairSource k).natDegree:ℝ)-1)*uniformRootW1 (pairSource k) (pairChild k) := by sorry