Quantitative divergence of the explicit powered pair-drop ratio
ProvedDerivativeChainDivisorAnchor.pair_ratio_boundFor every natural , under the sole hypothesis , the following two conclusions hold simultaneously. 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 . The conclusions are and . The natural number is cast to a real number wherever it appears in these real inequalities; , and is the first asserted conclusion, so both displayed denominators are nonzero on this domain. There is no free real constant, polynomial, coupling, or extra root-distribution hypothesis in this statement: its polynomials and laws are the explicitly defined family. The source separately proves , , , , and , so the finite coupling is between the multiplicity-weighted laws of an actual polynomial and its scaled derivative. Its admissible set is nonempty by the positive-degree product coupling. The algebraic bridge used in the proof is with ; the accompanying proved bounds are , , and . These bridge bounds are separate declarations, not extra hypotheses on .
import Mathlib 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.pair_ratio_bound (k : ℕ) (hk : 3 ≤ k) :
0 < pairDrop (pairSource k) (pairChild k) ∧ (k:ℝ)^2/((k:ℝ)+1) < pairRatio k := by sorry