Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Endpoint Pair Multiplicity Simple Graph

Proved
EndpointPairMultiplicitySimpleGraph

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

crossing-consequencestrellis-port

Let AAA be a finite set of indices and let ϵ:A→Sym⁡2(V)\epsilon:A\to \operatorname{Sym}^{2}(V)ϵ:A→Sym2(V) assign to each index an unordered pair of vertices of VVV. Suppose that no assigned pair is diagonal, and that for every unordered pair eee in the image of ϵ\epsilonϵ, at most two indices of AAA are assigned to eee. Then there is a simple graph GGG on VVV with finite edge set such that the edge set of GGG is exactly the image of ϵ\epsilonϵ, and

∣A∣/2≤∣E(G)∣.|A|/2\le |E(G)|.∣A∣/2≤∣E(G)∣.

Formalization Note This node is ported from the Trellis formalization of the crossing lemma and its consequences (wpegden/crossing-consequences, commit 8769d142, W. Pegden, Apache-2.0); the statement is the Trellis node EndpointPairMultiplicitySimpleGraph.

Preamble
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Combinatorics.SimpleGraph.Finite
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Set.Finite.Basic
import Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Basic

open Classical
open scoped Real
noncomputable section
Formal statement
lemma EndpointPairMultiplicitySimpleGraph {ι V : Type*} [DecidableEq ι] [DecidableEq V]
    (A : Finset ι) (endpoint : ι → Sym2 V)
    (h_nondiag : ∀ i ∈ A, ¬ (endpoint i).IsDiag)
    (h_multiplicity : ∀ e ∈ A.image endpoint,
      (A.filter (fun i => endpoint i = e)).card ≤ 2) :
    ∃ G : SimpleGraph V, ∃ (_ : Fintype G.edgeSet),
      (A.card : ℝ) / 2 ≤ (G.edgeFinset.card : ℝ) ∧
        G.edgeFinset = A.image endpoint := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/EndpointPairMultiplicitySimpleGraph.lean#L1-L64

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