simple_graph_injective_is_equitable_coloring
theoremverified
For every finite simple graph G on type V and every injective function c : V → α, c satisfies simple_graph_is_equitable_coloring G c.
Statement
theorem simple_graph_injective_is_equitable_coloring {V α : Type*} [Fintype V] (G : SimpleGraph V) (c : V → α) (hc : Function.Injective c) : simple_graph_is_equitable_coloring G c
- Source
- arXiv:2611.18391
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- simple_graph_is_equitable_coloringA coloring c : V → α of a finite simple graph G is equitable (simple_graph_is_equitable_coloring G c) if for all vertices u and v with c u…
Read back from the Lean
Let $V$ and $\alpha$ be types with $V$ finite. Let $G$ be a simple graph on $V$ and $c : V \to \alpha$ be a function. If $c$ is injective, then $c$ is an equitable coloring of $G$ (as defined by simple_graph_is_equitable_coloring).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Every injective coloring of a finite simple graph is an equitable coloring. -/ theorem simple_graph_injective_is_equitable_coloring {V α : Type*} [Fintype V] (G : SimpleGraph V) (c : V → α) (hc : Function.Injective c) : simple_graph_is_equitable_coloring G c := fun u v huv _ => by rw [hc huv]