No finite universal divisor-anchor transport factor
ProvedDerivativeChainDivisorAnchor.actual_unit_disk_anchor_counterexampleFor every real , with no positivity assumption, there exists a natural with the following properties. 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. The assertion is that is monic, , every root occurrence satisfies , , as an identity of complex polynomials, , and . The zero sum is the unnormalized multiset sum, so it retains multiplicities. In this family , and are positive; the source separately proves , , , , , and , where is the root multiset of and multiplying a multiset by or means scaling each complex value, whereas a natural coefficient means repeating the multiset. These are the bridges to the actual derivative and root-slot law. For positive source and target degrees the constant product array is admissible and all costs are nonnegative, so this family uses a nonempty cost set bounded below.
import Mathlib import Definitions.Def_DerivativeChainGini_DivisorAnchorFunctional import Definitions.Def_DerivativeChainGini_DivisorAnchorNoGo import Definitions.Def_DerivativeChainGini_DivisorParameters import Definitions.Def_DerivativeChainGini_DivisorRootTransport 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_unit_disk_anchor_counterexample (K : ℝ) : ∃ k : ℕ, 3 ≤ k ∧
(obstructionSource k).Monic ∧ (obstructionSource k).natDegree = orbitCount k*k ∧
(∀ i : (obstructionSource k).roots, ‖(i:ℂ)‖ ≤ 1) ∧
(obstructionSource k).roots.sum = 0 ∧
C ((orbitCount k*k:ℂ)⁻¹)*(obstructionSource k).derivative = obstructionChild k ∧
0 < rootAnchor (obstructionSource k) (obstructionChild k) ∧
K*rootAnchor (obstructionSource k) (obstructionChild k) <
(((obstructionSource k).natDegree:ℝ)-1)*uniformRootW1 (obstructionSource k) (obstructionChild k) := by sorry