Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

Every line in a finite projective plane has the same number of points

Statement

In a finite projective plane, any two lines have the same number of points.

Facts & Assumptions

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

[L1]

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

Proof

technique · direct
1.1

Let and m be distinct lines, and write p:=m, which exists and is unique by [L1].

L1choose
1.2

There is a point x outside m. If one of the four noncollinear points from [L1] lies outside m, choose it. Otherwise exactly two of them lie on and two lie on m; let am and cm be such points. The line through a and c is distinct from both and m, so because every line contains at least three points, it has a point x different from a and c, and that x lies on neither nor m.

L1choose
2.1

For each y{p}, let φ(y) be the unique point where the line through x and y meets m. Since xm, one has φ(y)p, and if φ(y1)=φ(y2) then the lines through x and y1,y2 coincide, forcing y1=y2. So φ is injective from {p} to m{p}.

step 1.1step 1.2L1choose
3.1

Reversing the same construction with the roles of and m exchanged gives an injective map from m{p} to {p}. Since the two sets are finite, they have the same cardinality. Therefore =m.

step 1.1step 1.2step 2.1L1algebra

Depends on

Used by

Dependency tree · one level

1 result 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