Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-09-26 (gpt-6-sol)
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.

Pulling a covering back to an evenly covered open set gives a trivial covering

Example

If U is evenly covered by p:E→B, then the pullback of p along the inclusion U↪B is a trivial covering of U.

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]

If X is any space and F is a nonempty discrete space, the projection X×F→X is a trivial covering with fibre F. If X=∅, the same holds for F=∅; for nonempty X, an empty fibre would violate surjectivity. (Trivial coverings are products with a discrete fibre).

Verification

technique · direct
1.1F1F2F3

Let f:U↪B be the inclusion. If U=∅, its pullback is empty and is isomorphic over U to U×∅→U, which is a trivial covering by [F3]. Hence assume U≠∅. Choose an evenly covered decomposition p−1(U)=⨆j∈JVj as in [F2]. Surjectivity of p makes J nonempty. The pullback f∗E is {(u,e):u=p(e)∈U} by [F1].

2.1step 1.1F1F2

Give J the discrete topology. Define h:U×J→f∗E by h(u,j)=(u,(p∣Vj)−1(u)). Each e∈p−1(U) belongs to exactly one sheet Vj, so the inverse is h−1(u,e)=(u,j) for that unique j. Both maps preserve the projection to U.

3.1step 1.1step 2.1F1F2

The restriction of h to each open slice U×{j} is continuous because (p∣Vj)−1 is continuous. These slices cover U×J, so h is continuous. The pullback subset {(u,e):e∈Vj, u=p(e)} is open in f∗E, since Vj is open in E; on it, h−1 has the continuous form (u,e)↦(u,j). These subsets cover f∗E, so h−1 is continuous. Thus h is a homeomorphism over U.

4.1step 3.1F3∎

By [F3], U×J→U is a trivial covering. The homeomorphism of step 3.1 identifies it with the pullback covering, proving the Example.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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