simple_graph_triangle_degree_bot
In the empty graph every vertex has triangle-degree 0.
Statement
theorem simple_graph_triangle_degree_bot {V : Type*} [Fintype V] [DecidableEq V] (v : V) : simple_graph_triangle_degree (⊥ : SimpleGraph V) v = 0
- Source
- Sanity lemma for simple_graph_triangle_degree (arXiv:2610.08478 (Regular K_3-Irregular Graphs of Every Regularity at Least Nine)).
- Verified
- 11 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- simple_graph_triangle_degreeThe triangle-degree td_G(v): the number of triangles of G containing v, i.e. the number of 2-element subsets {u, w} of the neighbourhood…
The proof, explained
The proof unfolds the definition of triangle-degree, which counts the number of pairs of adjacent neighbors of a vertex. Since the empty graph has no edges, the neighborhood of any vertex is empty, containing no 2-element subsets and therefore no triangles. The simplifier evaluates this cardinality to 0 directly.
The triangle-degree of any vertex v in the empty graph ⊥ is 0. automation
Unfolding the definition of triangle-degree, the triangle-degree of v is the number of pairs of adjacent vertices in the neighborhood of v. In the empty graph ⊥, the neighborhood of v is empty, so it has no 2-element subsets, and the filtered finset of triangles has cardinality 0. The simplifier resolves this definition and basic finset operations automatically.
uses
simple_graph_triangle_degreesimp [simple_graph_triangle_degree]
simple_graph_triangle_degree- The triangle-degree of a vertex v in a graph G, defined as the number of pairs of adjacent neighbors of v (that is, the number of triangles on v).
- The simplifier automatically evaluates the neighborhood of any vertex in the empty graph to be empty, so the cardinality of its 2-element subsets is 0.
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.
theorem simple_graph_triangle_degree_bot {V : Type*} [Fintype V] [DecidableEq V] (v : V) : simple_graph_triangle_degree (⊥ : SimpleGraph V) v = 0 := by simp [simple_graph_triangle_degree]