Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, proof of Lemma 1, p. 50 — subtrees each containing two of three points have a common point

Proved
GavrilSubtree.Chordal.three_point_inter_nonempty

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

helly-propertyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subtreetree

Let TTT be a tree, let a1,a2,a3a_1, a_2, a_3a1​,a2​,a3​ be three vertices of TTT, and let (ti)i∈I(t_i)_{i \in I}(ti​)i∈I​ be any family of subtrees of TTT (nonempty vertex sets inducing connected subgraphs) such that every tit_iti​ contains at least two of the three points a1,a2,a3a_1, a_2, a_3a1​,a2​,a3​. Then the subtrees have a common point:

⋂i∈Iti≠∅.\bigcap_{i \in I} t_i \neq \varnothing.i∈I⋂​ti​=∅.

This is the remark with which Gavril opens the proof of Lemma 1: the three simple paths between the pairs of points meet, and each subtree contains the path between the two points it contains. It is the base of the Helly-type property of subtrees used in Lemma 1.

Formalization Note The paper takes a subset Fˉ\bar FFˉ of the (finite) representing family FFF; the Lean statement allows an arbitrary index type III, which is a stronger statement and still true. For empty III 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 three_point_inter_nonempty {β : Type u} (T : SimpleGraph β) (hT : T.IsTree)
    {ι : Type*} (t : ι → Set β) (ht : ∀ i, (T.induce (t i)).Connected) (a₁ a₂ a₃ : β)
    (h : ∀ i, (a₁ ∈ t i ∧ a₂ ∈ t i) ∨ (a₁ ∈ t i ∧ a₃ ∈ t i) ∨ (a₂ ∈ t i ∧ a₃ ∈ t i)) :
    (⋂ i, t i).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, §2, proof of Lemma 1 (first paragraph)
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