Erdős Problem #723
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: falsifiable (not automatically the live result).
Subject areas: combinatorics.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Must the order q of every finite projective plane be a prime power? Such a plane has q²+q+1 points and the same number of lines, each with q+1 points; every pair of points lies on exactly one line. This is FALSIFIABLE by a single non-prime-power plane but has no known counterexample. Existence for prime-power q is classical; it is unknown for q=12.
A small example
For q=2 the seven Fano lines {j,j+1,j+3} modulo 7 form a projective plane; each line has 3 points and each unordered pair lies on exactly one line. By contrast, q=6 is impossible by the Bruck–Ryser condition: since 6≡2 (mod 4), a plane would force 6=x²+y² for integers x,y, which is false. This does NOT rule out q=12, where the Bruck–Ryser condition has no such consequence.
What is known
Bruck–Ryser 1949: for q≡1 or 2 modulo 4, projective-plane existence requires q to be a sum of two integer squares; Bruck–Ryser–Chowla refinements are separate. Order q=10 was ruled out by Lam et al.'s exhaustive computer-assisted classification (1989/1990). All q≤11 have been resolved. The GCL-pinned Formal Conjectures #723 main and variants carry answer(sorry) and by sorry placeholders; no GCL kernel certification. A hypothetical non-prime-power plane would refute the prime-power order conjecture, but neither q=12 nor other orders have a certified plane in hand.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: projective plane non prime power order falsifiable; order 12 existence unknown; gcl pinned fc sorry. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Audit a precise Fano incidence certificate (7 lines, exactly one per pair) and the Bruck–Ryser q=6 arithmetic obstruction. Source-lock Lam's order-ten nonexistence computation and the exact #723 Lean theorem predicate, without treating finite verification as all-orders proof.
Sources and claim boundaries
Maintained Erdős #723; GCL source report. Original historical theorem pages and full formal proof chain not independently inspected; no new independent primary theorem certification, browser readback is a protected publication verification gateor V2 admission.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1994 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.