Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA 1, p. 50 — for every completely connected set A of a subtree graph, ⋂_{v∈A} v̄ ≠ ∅

Proved
GavrilSubtree.Chordal.lemma_1

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

cliquehelly-propertyp2o-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 (distinct vertices are adjacent exactly when their subtrees intersect). Then for every finite completely connected set AAA of GGG (a finite set of pairwise adjacent vertices)

⋂v∈Avˉ≠∅.\bigcap_{v \in A} \bar v \neq \varnothing.v∈A⋂​vˉ=∅.

This is the Helly property of subtrees of a tree: pairwise intersecting subtrees have a common point. It is what lets Theorem 2 attach to each clique a point of the tree.

Formalization Note The paper's graphs are finite, so every completely connected set is finite; the Lean statement takes AAA as a Finset and does not assume VVV finite. Finiteness of AAA is necessary: infinitely many nested rays of an infinite tree pairwise intersect with empty intersection. For A=∅A = \varnothingA=∅ the intersection is the whole tree, which is nonempty.

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

universe u

theorem lemma_1 {V : Type u} {G : SimpleGraph V} {β : Type u} {T : SimpleGraph β}
    {F : V → Set β} (hF : IsSubtreeRep G T F) (A : Finset V) (hA : G.IsClique (A : Set V)) :
    (⋂ v ∈ A, F v).Nonempty := 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, 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