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

Trivial coverings are products with a discrete fibre

Example

If X is any space and F is a nonempty discrete space, the projection X×FX is a trivial covering with fibre F. If X=, the same holds for F=; for nonempty X, an empty fibre would violate surjectivity.

Facts & Assumptions

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

[F1]

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).

[F2]

The product set. Let I be a set and let Xi be a set for each iI. The product is iIXi  :=  {x:x is a function with domain I and x(i)Xi for every iI}, and we write xi:=x(i), the i-th coordinate of x. Two elements of the product are equal exactly when they agree at every index, functions being equal when they have the same domain and the same values. For jI the j-th projection is πj:iIXiXj,πj(x):=xj.. The product topology TΠ on iXi is the initial topology of the projections: the topology generated by the subbasis {πi1[U]:iI, UTi}. Finite intersections of subbasic sets form a basis for it, and they are exactly the boxes iIUi with every Ui open in Xi and Ui=Xi for all but finitely many i. (The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

[F3]

Throughout, a topology is as in def-topological-space, and finite, at most countable and uncountable are as in def-countable, so that "countable" always means "at most countable" and every finite set is countable. Let X be a set. The six families below are topologies on X; that each really satisfies (T1), (T2) and (T3) is discharged in full after the list. Among those six is the discrete topology Tdisc:=P(X), in which every subset is open and hence every subset is also closed. (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

Verification

technique · direct
1.1

For any space X and discrete set F, verify that the projection X×FX is a covering, with every open subset of the base evenly covered.

givenF1F2F3
2.1

Identify its sheets and fibre, including F=: the projection then fails surjectivity unless X=, so state the nonempty-fibre convention explicitly.

step 1.1F1F2
3.1

The preceding construction and implications establish the assertion.

step 2.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 51 results over 20 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