Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Covering spaces are stable under restriction, finite products, and pullback

Statement

Restrictions of coverings to open subspaces, finite products of coverings, and pullbacks of coverings are covering maps. The empty product is the identity covering of a one-point space.

Facts & Assumptions

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

[F1]

For a covering p:E→B and a continuous map f:X→B, define f∗E:={(x,e)∈X×E:f(x)=p(e)} with the subspace topology, and let f∗p:f∗E→X be (x,e)↦x (def-product-topology, def-subspace-topology-top). This is the pullback covering space; its covering property is proved in prop-covering-spaces-are-stable-under-restriction-finite-products-and-pullback. (The pullback of a covering space along a continuous map).

[F2]

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

[F3]

The product set. Let I be a set and let Xi be a set for each i∈I. The product is ∏i∈IXi  :=  { x:x is a function with domain I and x(i)∈Xi for every i∈I }, 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 j∈I the j-th projection is πj:∏i∈IXi→Xj,πj(x):=xj.. The product topology TΠ on ∏iXi is the initial topology of the projections: the topology generated by the subbasis {πi−1[U]:i∈I, U∈Ti}. Finite intersections of subbasic sets form a basis for it, and they are exactly the boxes ∏i∈IUi with every Ui open in Xi and Ui=Xi for all but finitely many i. (The product set ∏i∈IXi 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).

[F4]

Let (X,T) be a topological space (def-topological-space) and let S⊆X. The subspace topology (also relative topology) on S is TS:={ U∩S:U∈T }, the family of traces on S of the open sets of X. The pair (S,TS) is a subspace of X. A subset of S that lies in TS is said to be open in S, and relatively open where the ambient space needs emphasis. (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Proof

technique · direct
1.1givenF2F1F4F3

Restrict an evenly covered neighbourhood for restriction, take products of evenly covered neighbourhoods for finite products, and identify each pullback sheet with the corresponding open subset of the new base.

2.1step 1.1∎

The preceding construction and implications establish the assertion.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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