Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 37 — infinite path in a finitely branching rooted tree

Proved
SymmetricPSM1041.ORLowerBound.konig_infinite_rooted_tree

by mikedeng1 · Nov 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let TTT be an infinite rooted tree with vertex set VVV and root ooo. Assume that every vertex has a finite set of children. Then there is a sequence p:N→Vp:\mathbb N\to Vp:N→V such that

p(0)=o,p is injective,p(k+1) is a child of p(k)(k≥0).p(0)=o,\qquad p\text{ is injective},\qquad p(k+1)\text{ is a child of }p(k)\quad(k\ge0).p(0)=o,p is injective,p(k+1) is a child of p(k)(k≥0).

Thus the tree has an infinite path starting at the root. Leaves are permitted; infinitude does not assert that each vertex extends. This is the compactness ingredient used by the source's finite Higman derivation.

Differences from the source:

  • encoding: a rooted tree and an infinite path from its root → a reachable parent-map tree and an injective child sequence beginning at the root; reason: every rooted tree has the parent representation; the root’s self-parent is excluded from child edges
Preamble
import Mathlib
import Definitions.Def_SymmetricPSM1041_ORLowerBound_RootedTree
Formal statement
namespace SymmetricPSM1041.ORLowerBound

theorem konig_infinite_rooted_tree {V : Type*} [Infinite V] (T : RootedTree V)
    (hfinite : ∀ v, (children T v).Finite) :
    ∃ p : ℕ → V, p 0 = T.root ∧ Function.Injective p ∧
      ∀ k, p (k + 1) ∈ children T (p k) := by sorry

end SymmetricPSM1041.ORLowerBound
Source
Marshall Ball, Peter Crawford-Kahrl, Vladimir Podolskii, Morgan Prior, STOC 2027 submission #1041 (October 2026), p. 26, Lemma 37
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 9, 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