Corollary A: an STS(7) has lines, three through each point
ProvedFanoUnique.seven_linesLet be a Steiner triple system on . Then has exactly lines, and every point lies on exactly of them.
The count through a point is the replication number with ; the number of lines is .
import Mathlib import Definitions.Def_FanoUnique_isFano
namespace FanoUnique
open RolesForceSeven
theorem seven_lines (S : STS 7) :
S.lines.card = 7 ∧ ∀ x : Fin 7, (S.lines.filter (fun l => x ∈ l)).card = 3 := by
sorry
end FanoUniqueRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of seven_lines.
Setting. The point set is , the seven elements of . The theorem has one hypothesis, a structure of type "". Expanding that definition, is exactly the following data together with two properties:
- a finite set of subsets of , called lines. Because is a set, a line cannot appear twice.
- (size three) every line has exactly points;
- (unique line through a pair) for all points with , there is exactly one with and .
Nothing else is assumed about . There are no further hypotheses and no typeclass assumptions. The hypothesis is satisfiable: the imported file builds one such structure, the "Fano" system whose lines are (addition mod ) for . The same imported files also define IsFano, which says a system is isomorphic to that Fano system under some bijection of the points, and RoleColouring. None of these three definitions (IsFano, fano, RoleColouring) appears in the statement.
Claim. For every such , both of the following hold:
Put simply, every Steiner triple system on exactly points (as defined above) has exactly lines, and every point lies on exactly lines.
Scope. The statement covers only points. It does not claim that is isomorphic to the Fano plane, and it says nothing about other values of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.