Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite polar chain is bounded by radius increase plus angular variation

Proved
DerivativeChainPrivate.chainCost_le_radius_add_turn

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

compressed-support-20261019derivative-chain-privatepolynomials

For a positive finite length n, let radii r_i be nonnegative, nondecreasing and bounded by R>=0. If the sum of the absolute consecutive angle increments is at most alpha, the complex chain r_i exp(i theta_i) has cost at most R-r_0+R alpha. The theorem concerns any such polar chain; actual derivative-root membership is not assumed or concluded.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
open Polynomial DerivativeChainPrivate
set_option autoImplicit false
Formal statement
theorem DerivativeChainPrivate.chainCost_le_radius_add_turn {n : ℕ} (hn : 1 ≤ n)
    (r theta : ℕ → ℝ) (R alpha : ℝ) (hR : 0 ≤ R)
    (hr : ∀ i < n, 0 ≤ r i) (hmono : ∀ i < n - 1, r i ≤ r (i + 1))
    (hradius : ∀ i < n, r i ≤ R)
    (hturn : (∑ i ∈ Finset.range (n - 1), |theta (i + 1) - theta i|) ≤ alpha) :
    chainCost (fun i : Fin n => (r i.val : ℂ) * Complex.exp (Complex.I * theta i.val)) ≤
      R - r 0 + R * alpha := by sorry
Source
Derivative-zero chains: public formalization reference, R50, DerivativeChainPrivate.chainCost_le_radius_add_turn. https://gist.github.com/Amal-David/d6612109c98595b12561cd638c60edf5/3883c57ddc7bf9d4c0e898c3d6bfd2ca0d7f9c95#file-notes-md
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by labuka · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

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