Projective planes of order 12 admit no collineation of order 3 with exactly ten fixed points
We prove that no projective plane of order 12 admits a collineation of order 3 with exactly ten fixed points. Together with earlier work, it follows that the collineation group of such a plane is trivial, or of order 2 and generated by an elation, or of order 3 and generated by a collineation with exactly 1, 4 or 7 fixed points. The proof has three parts. First, a structure theory for collineations of order 3 with n−2 fixed points in a plane of order n reduces the problem to the unsatisfiability of 7,725 explicit Boolean formulas. Second, this reduction is formalized in the Lean 4 proof assistant, starting from a projective plane with such a collineation, and the formula files used in the computation are byte-identical to the output of the functions about which the formal theorem speaks. Third, every formula is refuted by a SAT solver, and every refutation is certified by a DRAT proof that was checked independently and is tied to a digest of the exact solver input. For planes of order 9 the same method gives a certified proof that no collineation of order 3 has exactly seven fixed points, in agreement with the classification of these planes. The mathematics, the software and the text of this paper were produced by AI agents directed by the author; Section 9 describes how, and which checks were applied.
Authors
- Martin Havelka
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-13
- DOI
- https://doi.org/10.5281/zenodo.24198428
- Primary Topic
- Mathematics and Applications
- Type
- preprint