Both completions are the Fano plane
ProvedFanoUnique.completions_are_fanoLet be a Steiner triple system on whose lines are exactly completion A or exactly completion B:
Then is the Fano plane up to relabelling: some permutation of the points carries its lines exactly onto . For A the permutation works.
import Mathlib import Definitions.Def_FanoUnique_isFano
namespace FanoUnique
open RolesForceSeven
theorem completions_are_fano (S : STS 7)
(h : S.lines = {{0, 1, 2}, {0, 3, 4}, {0, 5, 6}, {1, 3, 6}, {1, 4, 5}, {2, 3, 5}, {2, 4, 6}} ∨
S.lines = {{0, 1, 2}, {0, 3, 4}, {0, 5, 6}, {1, 3, 5}, {1, 4, 6}, {2, 3, 6}, {2, 4, 5}}) :
IsFano S := by
sorry
end FanoUniqueRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Throughout, the point set is (the type of natural numbers below , with addition taken modulo ). A Steiner triple system on points (in the sense used here) is a triple consisting of
- a finite collection of subsets of (the lines),
- the property that every line has exactly elements,
- the property that for all points there is exactly one line with and .
The theorem takes an arbitrary such system on points, with line collection (the two axioms are part of the data of ).
Hypothesis. is literally equal (as a set of -element subsets of ) to one of the following two collections:
That is, or (an inclusive "or"). Each of and consists of seven distinct -element sets, and in each every pair of distinct points of lies in exactly one of the seven sets, so both alternatives are compatible with the Steiner-system axioms; the hypothesis is not vacuous.
Reference system. The fixed "Fano" system on has as lines the sets (addition mod ) for , i.e.
Conclusion. "is Fano", which by definition means: there exists a bijection (a permutation of the seven points) such that
where is the pointwise image of the line . In words: under either hypothesis on the lines of , some relabelling of the points carries the set of lines of exactly onto the set of lines of the reference system (equality of collections of lines, so every line of maps to a line of and every line of is the image of some line of ). Only existence of such a permutation is asserted; no uniqueness is claimed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.