petersen_strip_small_boundary_attainment_eight
In the generalized Petersen strip with step 8, there exists a finite vertex set S : Finset PetersenStripVertex such that (petersen_strip_boundary 8 S).card ≤ 17 and S.card = 33.
Statement
theorem petersen_strip_small_boundary_attainment_eight : ∃ S : Finset PetersenStripVertex, (petersen_strip_boundary 8 S).card ≤ 17 ∧ S.card = 33- Formalizes
- knowledge base OP-540; arXiv:2610.24059
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- petersen_strip_boundaryFor a natural number k and a finite vertex set S : Finset PetersenStripVertex,
petersen_strip_boundary k Sis the… - 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…
- PetersenStripVertexThe vertex set of the infinite generalized Petersen strip, consisting of outer vertices u_i and inner vertices v_i indexed by integers i…
- petersen_strip_boundaryFor a natural number k and a finite vertex set S : Finset PetersenStripVertex,
Read back from the Lean
There exists a finite set $S$ of vertices of type PetersenStripVertex such that the size of $S$ is 33 and the size of petersen_strip_boundary 8 S is at most 17.
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
To prove the existence of a vertex set of size 33 with boundary size at most 17 in the generalized Petersen strip with step k = 8, the proof supplies the explicit finite set `petersen_strip_witness 8`. Lean's `decide` tactic then computes both the set's size and its boundary size by direct finite evaluation, confirming that they satisfy the required conditions.
The explicit set S = petersen_strip_witness 8 satisfies |S| = 33 and |∂S| ≤ 17. automation
We provide `petersen_strip_witness 8` as the witness for the existential quantifier. Both conjuncts—that the cardinality of this finite set is 33 and that its boundary size in the strip with step 8 is at most 17—are decidable arithmetic statements about concrete finite sets, which the `decide` tactic evaluates and confirms directly by computation.
theorem petersen_strip_small_boundary_attainment_eight : ∃ S : Finset PetersenStripVertex, (petersen_strip_boundary 8 S).card ≤ 17 ∧ S.card = 33 := ⟨petersen_strip_witness 8, by decide⟩
- The verification of both the set size and the boundary size bound is performed entirely by Lean's computational reduction (`decide`) evaluating operations on explicit finite sets.
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.
/-- Attainment of the quadratic boundary extremum for k = 8. -/theorem petersen_strip_small_boundary_attainment_eight : ∃ S : Finset PetersenStripVertex, (petersen_strip_boundary 8 S).card ≤ 17 ∧ S.card = 33 := ⟨petersen_strip_witness 8, by decide⟩