Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 50 — the subtree intersections of two different cliques are disjoint

Proved
GavrilSubtree.Chordal.inter_cliques_disjoint

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

cliquep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subtree-graph

Let GGG be a graph represented by a family of subtrees (vˉ)v∈V(\bar v)_{v \in V}(vˉ)v∈V​ of a tree TTT. For two different cliques (maximal completely connected sets) A1≠A2A_1 \neq A_2A1​=A2​ of GGG,

(⋂v∈A1vˉ)∩(⋂v∈A2vˉ)=∅.\Big(\bigcap_{v \in A_1} \bar v\Big) \cap \Big(\bigcap_{v \in A_2} \bar v\Big) = \varnothing.(v∈A1​⋂​vˉ)∩(v∈A2​⋂​vˉ)=∅.

Together with Lemma 1 this says that the sets sA=⋂v∈Avˉs_A = \bigcap_{v \in A} \bar vsA​=⋂v∈A​vˉ, A∈μ(G)A \in \mu(G)A∈μ(G), are nonempty and pairwise disjoint, so one can pick a distinct tree point for each clique; this is the first step of the proof of Theorem 2.

Formalization Note No finiteness of VVV is assumed; the statement holds for arbitrary graphs.

Preamble
import Mathlib
import Definitions.Def_GavrilSubtree_Chordal_Setting
Formal statement
namespace GavrilSubtree.Chordal

universe u

theorem inter_cliques_disjoint {V : Type u} {G : SimpleGraph V} {β : Type u}
    {T : SimpleGraph β} {F : V → Set β} (hF : IsSubtreeRep G T F) (A₁ A₂ : Cliques G)
    (hne : A₁ ≠ A₂) :
    (⋂ v ∈ A₁.1, F v) ∩ (⋂ v ∈ A₂.1, F v) = ∅ := by sorry

end GavrilSubtree.Chordal
Source
Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16 (1974), p. 50, §2, the sentence after the proof of Lemma 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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