AFTD Auto-Formalizing Theoretical Domains

petersen_strip_small_boundary_attainment

theoremverified

For each natural number k ≥ 8, there exists a finite vertex set S in the generalized Petersen strip such that its boundary card is at most 2k + 1 and S.card = k^2/2 + 1.

Statement

theorem petersen_strip_small_boundary_attainment (k : ℕ) (hk : 8 ≤ k) : ∃ S : Finset PetersenStripVertex, (petersen_strip_boundary k S).card ≤ 2 * k + 1 ∧ S.card = k ^ 2 / 2 + 1
Source
step towards petersen_strip_small_boundary_quadratic_extremum
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
  • petersen_strip_witnessExplicit finite vertex set witness achieving the quadratic bound k^2/2 + 1 with external boundary at most 2k + 1 in the generalized…
  • petersen_strip_boundaryFor a natural number k and a finite vertex set S : Finset PetersenStripVertex, petersen_strip_boundary k S is the…
  • petersen_strip_witness_cardFor each natural number k ≥ 8, the witness set petersen_strip_witness k has cardinality k^2/2 + 1.
  • petersen_strip_witness_boundary_cardFor each natural number k ≥ 8, the external boundary of petersen_strip_witness k has cardinality at most 2k + 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…

Lean source view module on GitHub

/-- For each natural number k ≥ 8, there exists a finite vertex set S in the generalized Petersen strip with boundary card at most 2k + 1 and S.card = k^2/2 + 1. -/
theorem petersen_strip_small_boundary_attainment (k : ℕ) (hk : 8 ≤ k) : ∃ S : Finset PetersenStripVertex, (petersen_strip_boundary k S).card ≤ 2 * k + 1 ∧ S.card = k ^ 2 / 2 + 1 := ⟨petersen_strip_witness k, petersen_strip_witness_boundary_card k hk, petersen_strip_witness_card k hk⟩
See it in the graphDiscuss this resultChallenge it