Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One-mode Appell rows admit a geodesic to a chosen endpoint

Proved
DerivativeChainContinuation.appell_one_mode_geodesic

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

centroid-returncoefficient-gapcontinuation-20261026derivative-chainssparse-families

Let 2≤q≤M2\le q\le M2≤q≤M, let c:N→Cc:\mathbb N\to\mathbb Cc:N→C satisfy c0=1c_0=1c0​=1 and cj=0c_j=0cj​=0 for j≤Mj\le Mj≤M outside {0,q}\{0,q\}{0,q}, and let bq=−(Mq)cqb^q=-\binom Mq c_qbq=−(qM​)cq​. There are points z0,…,zM−1z_0,\ldots,z_{M-1}z0​,…,zM−1​ with

z0=0,zM−1=b,Ai+1(zi)=0,∣zi+1−zi∣=∣zi+1∣−∣zi∣.z_0=0,\quad z_{M-1}=b,\quad A_{i+1}(z_i)=0,\quad |z_{i+1}-z_i|=|z_{i+1}|-|z_i|.z0​=0,zM−1​=b,Ai+1​(zi​)=0,∣zi+1​−zi​∣=∣zi+1​∣−∣zi​∣.

The last two assertions apply to i<Mi<Mi<M and i<M−1i<M-1i<M−1, respectively. For c:N→Cc:\mathbb N\to\mathbb Cc:N→C, write Am(X)=∑j=0m(mj)cjXm−jA_m(X)=\sum_{j=0}^m\binom mj c_jX^{m-j}Am​(X)=∑j=0m​(jm​)cj​Xm−j and Am,u(X)=Am(X−u)A_{m,u}(X)=A_m(X-u)Am,u​(X)=Am​(X−u). This supplies a compatible sparse prefix, not merely independent roots.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainContinuation_AppellRows
import Definitions.Def_DerivativeChainPrivate_foundations
import Definitions.Def_DerivativeChain_root_probability
open DerivativeChain DerivativeChainPrivate
open Polynomial
open scoped BigOperators
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false

set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
namespace DerivativeChainContinuation
open Polynomial





end DerivativeChainContinuation

Formal statement
theorem DerivativeChainContinuation.appell_one_mode_geodesic (M q : ℕ) (hq : 2 ≤ q) (hqM : q ≤ M)
    (c : ℕ → ℂ) (hc0 : c 0=1)
    (hs : ∀ j ≤ M, j ≠ 0 → j ≠ q → c j=0)
    (b : ℂ) (hb : b^q= -((M.choose q:ℂ)*c q)) :
    ∃ z : ℕ → ℂ, z 0=0 ∧ z (M-1)=b ∧
      (∀ i < M, (appellRow (i+1) c).eval (z i)=0) ∧
      (∀ i < M-1, ‖z (i+1)-z i‖ = ‖z (i+1)‖-‖z i‖) := by sorry
Source
https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/AppellPrefix.lean#L30-L49

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