simple_graph_odd_girth_ge_bot
The empty simple graph on any vertex type has odd girth at least k for every natural number k.
Statement
theorem simple_graph_odd_girth_ge_bot {V : Type*} (k : ℕ) : simple_graph_odd_girth_ge (⊥ : SimpleGraph V) k
- Source
- folklore
- Verified
- 05 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- simple_graph_odd_girth_geA simple graph G has odd girth at least k if every cycle in G of odd length has length at least k.
Read back from the Lean
For any type V and any natural number k, the empty simple graph on V (denoted ⊥, with no edges) satisfies simple_graph_odd_girth_ge (⊥ : SimpleGraph V) k; that is, every closed walk from a vertex to itself in the empty graph that is a cycle of odd length has length at least k.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem holds vacuously because the empty graph contains no cycles. Any cycle would have to be a walk, but a cycle cannot be trivial (of length 0), and a non-trivial walk requires at least one edge, which does not exist in the empty graph.
It suffices to show that any cycle w of odd length in the empty graph has length at least k.
Unfolding the definition of simple_graph_odd_girth_ge, we fix a vertex u, a closed walk w from u to u, and assume that w is a cycle of odd length.
intro u w hw _The walk w cannot be the trivial empty walk.
We case-split on the structure of the walk w. In the nil case, w is a walk of length 0, which contradicts the requirement that a cycle cannot be nil (hw.ne_nil rfl), closing the case via False.elim.
uses
False.elimcases w with | nil => exact False.elim (hw.ne_nil rfl)
The walk w cannot contain any edges, completing the proof vacuously.
In the cons case, the walk begins with an edge h connecting u to some vertex v. But the empty graph ⊥ has no edges, so h is a proof of False, and False.elim finishes the proof.
uses
False.elim| cons h _ => exact False.elim h
False.elim- from a contradiction (False), any proposition follows (ex falso quodlibet)
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The empty simple graph has odd girth at least k for all k. -/theorem simple_graph_odd_girth_ge_bot {V : Type*} (k : ℕ) : simple_graph_odd_girth_ge (⊥ : SimpleGraph V) k := by intro u w hw _ cases w with | nil => exact False.elim (hw.ne_nil rfl) | cons h _ => exact False.elim h