Elementary upper bound for the two-orbit anchor
ProvedDerivativeChainDivisorAnchor.anchor_upper_boundactual-polynomial-counterexamplesderivative-chainstransport-gini
For natural n, , , and , put , , and . Then
The derivative power relation is supplied separately in the final family.
Preamble
import Mathlib import Definitions.Def_DerivativeChainGini_DivisorActualFamily import Definitions.Def_DerivativeChainGini_DivisorAnchorFunctional 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 DerivativeChainGiniFamily open DerivativeChainDivisorAnchor
Formal statement
theorem DerivativeChainDivisorAnchor.anchor_upper_bound (n k : ℕ) (hk : 3 ≤ k) (a b : ℝ)
(ha : 0 < a) (ha1 : a ≤ 1) (hb : 0 < b) (hb1 : b ≤ 1) :
rootAnchor (anchorSource n k a) (anchorChild n k b) <
(n+2 : ℝ)*(a/(2*(k:ℝ))+a^2/2+(1-b))+1 := by sorrySource
New formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/gini/DivisorAnchorBounds.lean, lines 35-69, SHA-256 00eab1559ae822d709d6486c1a6771b3371817193203a6bed95cb4ca1b983593. 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, Sections 1-5, SHA-256 65bd4415daa590832808ea570d591ae862689459fcd4ec90f9b1b278fa8104e2.