Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cubic inverse graphs with strict exterior gaps have no northeast boundary contact

Proved
DerivativeChainPrivate.exterior_cubic_graph_no_contact

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

cubic-power-components-20261019derivative-chain-privatepolynomials

Supporting boundary-exclusion theorem. At complex points w,z and remainder values e0,e1, compare alpha0w^3-b0w+e0 and alpha1z^3-b1z+e1. Assume Re w>0, Im w>0, alpha0>alpha1>0, the source real value is nonnegative, A0>=0, A1<=M, C0<=K, C1>=0, M<b1-(alpha1/alpha0)b0 and K<b0-b1, where Aj=Re(ej)/Re(pointj) and Cj=(3Aj-Im(ej)/Im(pointj))/2. If z lies on the vertical or horizontal boundary northeast of w, these graph values are unequal. No analytic branch, remainder bound, root-count persistence, or root existence is asserted.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainPrivate_foundations
open Polynomial DerivativeChainPrivate
set_option autoImplicit false
Formal statement
theorem DerivativeChainPrivate.exterior_cubic_graph_no_contact (w z e₀ e₁ : ℂ)
    (α₀ α₁ b₀ b₁ M K : ℝ)
    (hwre : 0 < w.re) (hwim : 0 < w.im)
    (hα₁ : 0 < α₁) (hα : α₁ < α₀)
    (hsource : 0 ≤ ((α₀ : ℂ) * w ^ 3 - (b₀ : ℂ) * w + e₀).re)
    (hA₀ : 0 ≤ e₀.re / w.re) (hA₁ : e₁.re / z.re ≤ M)
    (hC₀ : (3 * (e₀.re / w.re) - e₀.im / w.im) / 2 ≤ K)
    (hC₁ : 0 ≤ (3 * (e₁.re / z.re) - e₁.im / z.im) / 2)
    (hvertical : M < b₁ - (α₁ / α₀) * b₀)
    (hhorizontal : K < b₀ - b₁)
    (hboundary : (z.re = w.re ∧ w.im ≤ z.im) ∨ (w.re ≤ z.re ∧ z.im = w.im)) :
    (α₀ : ℂ) * w ^ 3 - (b₀ : ℂ) * w + e₀ ≠
      (α₁ : ℂ) * z ^ 3 - (b₁ : ℂ) * z + e₁ := by sorry
Source
Derivative-zero chains: public formalization reference, R56, DerivativeChainPrivate.exterior_cubic_graph_no_contact. 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