Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-14
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.

Tautological lines over projective spaces

Example

For F=R or C, the tautological line γ1 over FPN has fiber the line represented by its base point. For finite N, its inclusion in FPN×FN+1 has Grassmannian classifying map the standard finite-stage inclusion

Gr1(FN+1)Gr1(F).

For N= this map is the identity of BO(1)=RP or BU(1)=CP.

Facts & Assumptions

Given: F=R or C and NN{}.

[F1]

Gr1(FM) consists of lines in FM, and its tautological bundle has fiber that line (Stiefel spaces, Grassmannians, and tautological bundles).

[F2]

The stable Grassmannians are denoted BO(n) and BU(n) in the real and complex models, respectively (Real and complex vector bundles are classified by stable Grassmannians).

Verification

technique · direct
1.1

For finite N, by definition FPN is the quotient of FN+1{0} by nonzero scalar multiplication, so a point is exactly a line FN+1. Hence FPN=Gr1(FN+1), and the set {(,v):v} is exactly the tautological bundle in [F1]. For N=, both projective space and its tautological line are the filtered unions of these finite stages inside F; no expression F+1 is used.

F1given
2.1

For finite N, the displayed bundle inclusion sends its fiber over to the same line in FN+1F. Taking image planes therefore sends to itself under the standard finite-stage inclusion, and pulling back γ1 returns the original pairs (,v). At N= the same assertion is the identity on the filtered union.

F1step 1.1
3.1

For N=, the finite-stage inclusions unite to the identity on Gr1(F). The classifying-space notation in [F2] gives BO(1) and BU(1), while step 1.1 gives RP and CP. All identifications are direct and use no choice principle.

F1F2step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

12 results within two dependency steps 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