Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A finite projective plane of order n has n2+n+1 points and the same number of lines

Statement

Let (P,L) be a finite projective plane of order n. Then P and L are both equal to n2+n+1.

Facts & Assumptions

Given: A finite projective plane (P,L) of order n.

[L1]

Every line contains exactly n+1 points (The order of a finite projective plane).

[L2]

Any two distinct points lie on exactly one line, any two distinct lines meet in exactly one point, and there exist four points no three of which lie on one line (A finite projective plane).

Proof

technique · direct
1.1

Choose a line L. Since no line contains three of the four noncollinear points from [L2], some point pP lies outside .

L2choose
2.1

For each point q, there is a unique line through p and q, and distinct points of give distinct lines through p. Conversely, any line through p meets in exactly one point by [L2]. Therefore exactly n+1 lines pass through p.

step 1.1L1L2algebra
3.1

Each of the n+1 lines through p contains exactly n points besides p, and the sets of those other points are pairwise disjoint because two distinct lines through p meet only at p. Every point distinct from p lies on exactly one of these lines, namely its unique joining line with p. Therefore P=1+n(n+1)=n2+n+1.

step 1.1step 2.1L1L2algebra
4.1

Count incident pairs (x,) with x. By [L1], each line contributes n+1 such pairs. By step 2.1 and the argument there applied to an arbitrary point, each point also lies on exactly n+1 lines. Therefore L(n+1)=P(n+1), and step 3.1 gives L=P=n2+n+1.

step 2.1step 3.1L1algebra

Depends on

Used by

Dependency tree · one level

3 results within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources