Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Complex endpoint transport cost, centroid, and normalized ratio

Definition
DerivativeChainContinuation_CollinearTransport

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

continuation-20261026derivative-chainsreal-transport

For a0,…,an∈Ca_0,\ldots,a_n\in\mathbb Ca0​,…,an​∈C, let μ=(n+1)−1∑iai\mu=(n+1)^{-1}\sum_i a_iμ=(n+1)−1∑i​ai​. Let Ca(v)C_a(v)Ca​(v) be the infimum of L(z)=∑i=0n−1∣zi+1−zi∣L(z)=\sum_{i=0}^{n-1}|z_{i+1}-z_i|L(z)=∑i=0n−1​∣zi+1​−zi​∣ over derivative chains for ∏i(X−ai)\prod_i(X-a_i)∏i​(X−ai​) ending at vvv. Define

R(a)=∑iCa(ai)2∑i∣ai−μ∣2.R(a)=\frac{\sum_i C_a(a_i)^2}{\sum_i|a_i-\mu|^2}.R(a)=∑i​∣ai​−μ∣2∑i​Ca​(ai​)2​.

The transport theorem controls this ratio when the roots are collinear and the denominator is positive.

Definition code
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations

set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
namespace DerivativeChainContinuation
open Polynomial DerivativeChainPrivate
open scoped BigOperators

noncomputable def complexCentroid {n : ℕ} (a : Fin (n+1) → ℂ) : ℂ :=
  (∑ i,a i)/(n+1 : ℂ)









noncomputable def complexEndpointCost {n : ℕ} (a : Fin (n+1) → ℂ) (v : ℂ) : ℝ :=
  sInf {t : ℝ | ∃ z : Fin (n+1) → ℂ,IsChain a z ∧ z (Fin.last n)=v ∧ chainCost z=t}

noncomputable def uniformComplexTransportRatio {n : ℕ} (a : Fin (n+1) → ℂ) : ℝ :=
  (∑ i,(complexEndpointCost a (a i))^2)/(∑ i,‖a i-complexCentroid a‖^2)




end DerivativeChainContinuation
Source
https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/CollinearTransport.lean#L9-L10; https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/CollinearTransport.lean#L72-L73; https://github.com/Amal-David/derivative-chain-prize/blob/21d2a2ac5cd4b4e6263cbc715dd5f925427fc976/continuation_formal/Source/CollinearTransport.lean#L75-L76

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