Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

The maps [x][mx] on R/Z are m-sheeted coverings for m1

Example

For every integer m1, the map Pm:R/ZR/Z given by Pm([x])=[mx] is a well-defined m-sheeted covering.

Facts & Assumptions

Given: The objects, hypotheses, and choice principles stated above.

[F1]

For the quotient by integer translation, q:RR/Z is a covering map, and every deck transformation is a unique translation xx+n with nZ. (The quotient RR/Z is a covering with integer translations as deck transformations).

[F2]

A covering map is a continuous surjection p:EB such that every bB has an open neighbourhood U for which p1(U) is a disjoint union of open sets Vj, called sheets, and each restriction pVj:VjU is a homeomorphism (def-continuous-map-top, def-homeomorphism-and-open-maps, def-disjoint-union-topology). Such a U is evenly covered, and p1(b) is the fibre over b. A covering is trivial when it is isomorphic over B to a product projection B×FB with F discrete. (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

[F3]

For a covering p:EB, the cardinality of p1(b) is locally constant as a function of bB. If B is connected, all fibres are equinumerous. (The cardinality of a covering fibre is locally constant and is constant on a connected base).

[F4]

On the set N×N of pairs of natural numbers, define (a,b)(c,d)    a+d=b+c. This is an equivalence relation (lem-int-equivalence). The integers are the quotient Z:=(N×N)/, and we write [(a,b)] for the equivalence class of (a,b). (The integers as equivalence classes of pairs of naturals).

[F5]

Let a,bZ with b>0. Then there exist integers q and r with a=qb+r and 0r<b, and this pair is unique (Division with remainder in Z: for aZ and b>0 there are unique q,rZ with a=qb+r and 0r<b).

Verification

technique · direct
1.1

Check well-definedness modulo integer translation.

givenF1
2.1

Around a class take an interval short enough that its m inverse branches are disjoint; these branches give the evenly covered neighbourhood of [F2]. The fibre has exactly m points because the branches are indexed by the residues of the integers modulo m, and by the division algorithm [F5] every integer has exactly one residue r with 0r<m: existence gives m distinct branch labels and uniqueness stops two labels from coinciding. [F4] constructs Z but supplies no division algorithm.

step 1.1F2F4F5
3.1

At m=1 the map is the identity, so no zero-sheet or division-by-zero case is hidden.

step 2.1F3
4.1

The preceding construction and implications establish the assertion.

step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 75 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources