is_kst_code_singleton
Any singleton set consisting of a single graph on vertex set [n] is a K_{s,t}-code.
Statement
theorem is_kst_code_singleton (s t n : ℕ) (G : SimpleGraph (Fin n)) : is_kst_code s t n {G}- Source
- arXiv:2610.35136, Sharp Bounds for Graph-Codes Avoiding Complete Bipartite Differences, Section 1
- Verified
- 28 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- is_kst_codeA family C of simple graphs on vertex set [n] is a K_{s,t}-code if for every two distinct graphs G, G' in C and every pair of disjoint…
Read back from the Lean
For all natural numbers $s$, $t$, and $n$, and for every simple graph $G$ on the vertex type Fin n, the singleton set $\{G\}$ satisfies is_kst_code s t n {G}.
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 definition of a K_{s,t}-code requires that every pair of distinct graphs in the family has a symmetric difference that is not a complete bipartite graph K_{s,t}. For a singleton family {G}, any two members must both equal G and therefore cannot be distinct. Consequently, the defining condition is satisfied vacuously.
To show that {G} is a K_{s,t}-code, consider arbitrary graphs G₁, G₂ ∈ {G} and assume G₁ ≠ G₂.
By definition, a family of graphs is a K_{s,t}-code if any two distinct graphs in it satisfy a condition on their symmetric difference. We introduce arbitrary graphs G₁ and G₂ in {G} along with the assumption hne : G₁ ≠ G₂.
intro G₁ G₂ h₁ h₂ hneThe defining condition holds vacuously because {G} contains no two distinct graphs.
Rewriting the memberships G₁ ∈ {G} and G₂ ∈ {G} with Set.mem_singleton_iff gives G₁ = G and G₂ = G. Combining these by transitivity and symmetry yields G₁ = G₂, which directly contradicts the assumption G₁ ≠ G₂ (hne).
uses
Set.mem_singleton_iffrw [Set.mem_singleton_iff] at h₁ h₂ exact absurd (h₁.trans h₂.symm) hne
Set.mem_singleton_iff- An element a belongs to the singleton set {b} if and only if a = b.
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.
/-- Any singleton family of graphs is a K_{s,t}-code. -/theorem is_kst_code_singleton (s t n : ℕ) (G : SimpleGraph (Fin n)) : is_kst_code s t n {G} := by intro G₁ G₂ h₁ h₂ hne rw [Set.mem_singleton_iff] at h₁ h₂ exact absurd (h₁.trans h₂.symm) hne