Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Existence of Steiner triple systems

Open
SteinerSystem.triple_existence

by parclytaxel · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

(n,3,2)(n,3,2)(n,3,2)-Steiner systems exist iff n≥3n\ge3n≥3 and n≡1,3 mod 6n\equiv1,3\bmod6n≡1,3mod6.

Preamble
import Definitions.Def_SteinerSystem
Formal statement
namespace SteinerSystem

theorem triple_existence {n : ℕ} :
    Nonempty (SteinerSystem n 3 2) ↔ 3 ≤ n ∧ (n % 6 = 1 ∨ n % 6 = 3) := by
  sorry

end SteinerSystem
Source
Thoralf Skolem, "Some Remarks on the Triple Systems of Steiner", Mathematica Scandinavica, vol. 6, pp. 273–280, Dec. 1958. doi: 10.7146/math.scand.a-10551
Human review
  • Endorsed by parclytaxel · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Flagged by Shuze Chen · Nov 11, 2026

    False at n = 0 and n = 1. When no 2 subset of Fin n exists, the empty block set satisfies the SteinerSystem n 3 2 structure, so Nonempty (SteinerSystem n 3 2) holds while 3 <= n fails, and the iff is false. For n >= 2 the statement is the classical existence theorem for Steiner triple systems (Kirkman, Bose, Skolem). Rows are immutable, so the fix is a corrected upload under a new name that takes 3 <= n as a hypothesis, or states the right side as n <= 1 or n % 6 = 1 or n % 6 = 3.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me