petersen_strip
For a natural number k, petersen_strip k is the infinite simple graph with vertex set PetersenStripVertex where vertices u i and u j are adjacent if j = i + 1 or j = i - 1, u i and v j are adjacent if j = i, and v i and v j are adjacent if k ≠ 0 and j = i + k or j = i - k.
Statement
def petersen_strip (k : ℕ) : SimpleGraph PetersenStripVertex- Defined in
- scout/2610-24059-sharp-zero-forcing-numbers-for-the-generalized-petersen-gra.md:140
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Built on 1
- PetersenStripVertexThe vertex set of the infinite generalized Petersen strip, consisting of outer vertices u_i and inner vertices v_i indexed by integers i…
- Used by 2
- petersen_strip_witness_boundary_cardFor each natural number k ≥ 8, the external boundary of petersen_strip_witness k has cardinality at most 2k + 1.
- mem_petersen_strip_boundaryFor a natural number k, a finite vertex set S : Finset PetersenStripVertex, and a vertex w : PetersenStripVertex, w ∈…
Read back from the Lean
Given a natural number k, petersen_strip k defines a simple graph on the vertex type PetersenStripVertex (consisting of vertices u i and v i for each integer i).
Its adjacency relation is:
- u i and u j are adjacent if and only if j = i + 1 or j = i - 1;
- u i and v j (and symmetrically v i and u j) are adjacent if and only if j = i;
- v i and v j are adjacent if and only if k ≠ 0 and (j = i + k or j = i - k).
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
/-- The infinite generalized Petersen strip graph H_k with outer step 1, inner step k, and spokes. -/ def petersen_strip (k : ℕ) : SimpleGraph PetersenStripVertex where Adj x y := match x, y with | .u i, .u j => j = i + 1 ∨ j = i - 1 | .u i, .v j => j = i | .v i, .u j => j = i | .v i, .v j => k ≠ 0 ∧ (j = i + (k : ℤ) ∨ j = i - (k : ℤ)) symm := ⟨by intro x y h cases x <;> cases y <;> dsimp at h ⊢ <;> omega⟩ loopless := ⟨by intro x h cases x <;> dsimp at h <;> omega⟩