is_steiner_system
def
Given natural numbers t and r, and a set S : Set (Finset α) of finite subsets (blocks) of a type α, is_steiner_system t r S holds if every block B ∈ S has Finset.card B = r, and for every finset T : Finset α with Finset.card T = t, there exists a unique block B ∈ S such that T ⊆ B.
Statement
def is_steiner_system {α : Type*} (t r : ℕ) (S : Set (Finset α)) : Prop
- Defined in
- arXiv:2611.11191, Section 2
- Verified
- 11 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a type α, natural numbers t and r, and a set S of finite subsets of α, is_steiner_system t r S asserts that:
1. Every element B of S has cardinality r; and
2. For every finite subset T of α with cardinality t, there exists a unique B ∈ S such that T ⊆ B.
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
/-- A family of r-subsets S on alpha is a Steiner system S(t, r) if every t-subset is contained in a unique block. -/ def is_steiner_system {α : Type*} (t r : ℕ) (S : Set (Finset α)) : Prop := (∀ B ∈ S, B.card = r) ∧ ∀ T : Finset α, T.card = t → ∃! B ∈ S, T ⊆ B