Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 23 — gij=(j−i)(n+3+i−j)g_{ij} = (j-i)(n+3+i-j)gij​=(j−i)(n+3+i−j) satisfies gik+gjl>max⁡{gij+gkl, gil+gjk}g_{ik}+g_{jl} > \max\{g_{ij}+g_{kl},\, g_{il}+g_{jk}\}gik​+gjl​>max{gij​+gkl​,gil​+gjk​}

Proved
AssocRealizations.SantosFan.g_inequality

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

associahedroninequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For n≥0n \ge 0n≥0 and integers i,ji, ji,j put gij=(j−i)(n+3+i−j)g_{ij} = (j - i)(n + 3 + i - j)gij​=(j−i)(n+3+i−j). Then for all integers 1≤i<j<k<l≤n+31 \le i < j < k < l \le n+31≤i<j<k<l≤n+3,

gik+gjl>max⁡{ gij+gkl, gil+gjk }.g_{ik} + g_{jl} > \max\{\, g_{ij} + g_{kl},\ g_{il} + g_{jk} \,\}.gik​+gjl​>max{gij​+gkl​, gil​+gjk​}.

Read on the (n+3)(n+3)(n+3)-gon with vertices 1,…,n+31, \dots, n+31,…,n+3, gijg_{ij}gij​ is a weight on chords, and the inequality says that for every quadrilateral ijklijklijkl the two crossing diagonals ik,jlik, jlik,jl have larger total weight than either pair of opposite sides. It is the perturbation that makes Santos' fan polytopal in the degenerate case (4) of Lemma 5.3.

Preamble
import Mathlib
import Definitions.Def_AssocRealizations_SantosFan_Setting
Formal statement
namespace AssocRealizations.SantosFan

open ChvatalArtGallery.FanPartition

/-- The inequality of p. 23: `g_ij = (j - i)(n + 3 + i - j)` satisfies
`g_ik + g_jl > max {g_ij + g_kl, g_il + g_jk}` for all `1 ≤ i < j < k < l ≤ n + 3`. -/
theorem g_inequality (n : ℕ) (i j k l : ℤ) (hi : 1 ≤ i) (hij : i < j) (hjk : j < k)
    (hkl : k < l) (hl : l ≤ (n : ℤ) + 3) :
    max (gW n i j + gW n k l) (gW n i l + gW n j k) < gW n i k + gW n j l := by sorry

end AssocRealizations.SantosFan
Source
Ceballos, Santos and Ziegler, Many non-equivalent realizations of the associahedron, arXiv:1109.5544v2, p. 23, proof of Theorem 5.2
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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