Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A concrete powered pair-drop ratio above twenty-five sixths

Proved
DerivativeChainDivisorAnchor.explicit_pair_drop_k5

by labuka · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

actual-polynomial-counterexamplesderivative-chainstransport-gini

This declaration has no parameters or hypotheses. For any complex polynomial TTT, write RTR_TRT​ for its multiset of complex roots, retaining every multiplicity, dT=T.natDegreed_T=T.\mathrm{natDegree}dT​=T.natDegree, and S(T,U)=∑x∈RT∑y∈RU∣x−y∣S(T,U)=\sum_{x\in R_T}\sum_{y\in R_U}|x-y|S(T,U)=∑x∈RT​​∑y∈RU​​∣x−y∣, 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 A(T,U)=[S(T,T)−S(T,U)]/dTA(T,U)=[S(T,T)-S(T,U)]/d_TA(T,U)=[S(T,T)−S(T,U)]/dT​. Define W(T,U)W(T,U)W(T,U) as the real infimum of the set of costs ∑i∈RT∑j∈RUqij∣i−j∣\sum_{i\in R_T}\sum_{j\in R_U}q_{ij}|i-j|∑i∈RT​​∑j∈RU​​qij​∣i−j∣ over all real arrays on the two root-slot sets satisfying qij≥0q_{ij}\ge0qij​≥0, ∑jqij=1/dT\sum_jq_{ij}=1/d_T∑j​qij​=1/dT​ for every source slot iii, and ∑iqij=1/dU\sum_iq_{ij}=1/d_U∑i​qij​=1/dU​ for every target slot jjj. 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. Fix k=5k=5k=5, m=4⋅54=2500m=4\cdot5^4=2500m=4⋅54=2500, a=1/25a=1/25a=1/25, c=[1+4a2500]/5c=[1+4a^{2500}]/5c=[1+4a2500]/5, b=Real.rpow⁡(c,1/2500)b=\operatorname{Real.rpow}(c,1/2500)b=Real.rpow(c,1/2500), B=(X2500−a2500)(X2500−1)4B=(X^{2500}-a^{2500})(X^{2500}-1)^4B=(X2500−a2500)(X2500−1)4, Q=X2499(X2500−1)3(X2500−b2500)Q=X^{2499}(X^{2500}-1)^3(X^{2500}-b^{2500})Q=X2499(X2500−1)3(X2500−b2500), r=12m=30000r=12m=30000r=12m=30000, P=BrP=B^rP=Br, and H=Br−1QH=B^{r-1}QH=Br−1Q. These are obstructionSource 5, obstructionChild 5, pairSource 5, and pairChild 5 as applicable. Let N=dPN=d_PN=dP​, D=[S(P,P)−S(H,H)]/2D=[S(P,P)-S(H,H)]/2D=[S(P,P)−S(H,H)]/2, and ρ=N(N−1)W(P,H)/D\rho=N(N-1)W(P,H)/Dρ=N(N−1)W(P,H)/D, exactly pairRatio 5; the sums inside DDD are unnormalized sums over ordered root occurrences. The declaration asserts jointly N=375000000N=375000000N=375000000, 25/6<ρ25/6<\rho25/6<ρ, and 4<ρ4<\rho4<ρ. It has no quantified parameter, and the two ratio inequalities are strict. The separately proved family bridges give D>0D>0D>0, dH=N−1d_H=N-1dH​=N−1, N−1P′=HN^{-1}P'=HN−1P′=H, RP=30000RBR_P=30000R_BRP​=30000RB​, and RH=29999RB+RQR_H=29999R_B+R_QRH​=29999RB​+RQ​; hence the ratio's denominator is positive for this specialization and WWW uses finite uniform-root-occurrence couplings of these two concrete polynomials. Those bridge facts are not additional conjuncts in this fixed declaration. The positive source and child degrees also give a nonempty admissible cost set by the product coupling.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainGini_PairDropNoGo
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






































Formal statement
theorem DerivativeChainDivisorAnchor.explicit_pair_drop_k5 :
    (pairSource 5).natDegree=375000000 ∧ (25/6:ℝ) < pairRatio 5 ∧ 4 < pairRatio 5 := by sorry
Source
New formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/gini/PairDropNoGo.lean, lines 163-167, SHA-256 3c0f5d48398e77c3f79f3ad99c46b208e604edb819ff48e371399c9f408e08b4. This new Lean code is not present in commit 21d2a2ac5cd4b4e6263cbc715dd5f925427fc976. Mathematical source: private analytic checkpoint d69f598e254dee1915468fa93b3e33b8e1b5b7d6, /Users/amal/.codex/worktrees/q1-q2-unified-20261025/derivative-chain-prize/research-results/unified-20261025/proofs/TRANSPORT_NO_GO.md, Section 6, SHA-256 65bd4415daa590832808ea570d591ae862689459fcd4ec90f9b1b278fa8104e2.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me