Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Complete telescoping root chain for mixed-sign real spokes

Proved
DerivativeChainPrivate.spoke_geodesic

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

cluster-anchorsderivative-chainsradial-prefix

For k≥2, r<k and nonzero real-rooted q, suppose X^r q(X^k) has degree n+1. There is a sequence z starting at zero, with z_i an actual root of its (n−i)-th derivative for every i<n+1, and |z_(i+1)−z_i|=|z_(i+1)|−|z_i| for every i<n. Roots of q may have either sign.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_SpokeRows
set_option autoImplicit false
namespace DerivativeChain
end DerivativeChain
namespace DerivativeChainClusterAnchor
end DerivativeChainClusterAnchor
namespace DerivativeChainContinuation
end DerivativeChainContinuation
namespace DerivativeChainExtremal
end DerivativeChainExtremal
namespace DerivativeChainPrefixLaws
end DerivativeChainPrefixLaws
namespace DerivativeChainPrivate
end DerivativeChainPrivate


set_option autoImplicit false
open scoped BigOperators
open DerivativeChainPrivate
open Polynomial

Formal statement
theorem DerivativeChainPrivate.spoke_geodesic (n k r : ℕ) (q : Polynomial ℝ) (hk : 2 ≤ k)
    (hr : r < k) (hq : q.Splits) (hqne : q ≠ 0)
    (hdegree : (spokePoly k r q).natDegree = n + 1) :
    ∃ z : ℕ → ℂ, z 0 = 0 ∧
      (∀ i < n + 1, (Polynomial.derivative^[n - i] (spokePoly k r q)).eval (z i) = 0) ∧
      (∀ i < n, ‖z (i + 1) - z i‖ = ‖z (i + 1)‖ - ‖z i‖) := by sorry
Source
Previously frozen formal source /private/tmp/prove2me-greedy-extensions-verified-20261026/RayTrinomial/RayChain.lean, lines 9-82, SHA-256 a6d60f43a655863ce55dffcfe62b804439a649e12a9dd8e98ca704e33afbd50b. Supporting statement retained exactly from the verified archive.

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