A linear anchor bound for the actual obstruction family
ProvedDerivativeChainDivisorAnchor.obstruction_anchor_upperactual-polynomial-counterexamplesderivative-chainstransport-gini
For natural , let , , and let b be the positive radius satisfying . Put and . Then
The family bridge proves .
Preamble
import Mathlib import Definitions.Def_DerivativeChainGini_DivisorAnchorNoGo 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.obstruction_anchor_upper (k : ℕ) (hk : 3 ≤ k) : obstructionAnchor k < 3*(k:ℝ)+2 := by sorry
Source
New formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/gini/DivisorAnchorNoGo.lean, lines 47-58, SHA-256 92c050c87bcf8bfe92676d362fb4304d232323d6882ed3da175723476b2518ba. 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.