Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

For a quotient map q:X→Y, a map out of Y is continuous iff its composite with q is; a continuous map on X constant on the fibres of q factors uniquely through q; and a composite of quotient maps is a quotient map

Statement

Let q:X→Y be a quotient map (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Then:

  1. Characteristic property. For every space W and every function k:Y→W, k is continuous   ⟺  k∘q is continuous.
  2. Factorisation. Let f:X→W be continuous and constant on the fibres of q, that is q(x)=q(x′) implies f(x)=f(x′). Then there is exactly one function fˉ:Y→W with fˉ∘q=f, and it is continuous.
  3. Composites. If q:X→Y and p:Y→Z are quotient maps then p∘q:X→Z is a quotient map.

Facts & Assumptions

Given: A quotient map q:X→Y, a space W, a function k:Y→W, a continuous f:X→W constant on the fibres of q, and a further quotient map p:Y→Z.

[A1]

q is a surjection and V⊆Y is open exactly when q−1[V] is open in X; the topology of Y is the final topology of the one-element family (q) (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection, Injection, surjection, bijection).

[L3]

Preimages compose: (u∘v)−1[T]=v−1[u−1[T]]; a composite of surjections is a surjection (Injection, surjection, bijection).

Proof

technique · direct
1.1

By [A1] the topology of Y is a final topology of the one-element family (q), so [L1] gives claim 1 at once.

A1L1
1.2

Define fˉ:={ (y,w):there is x∈X with q(x)=y and f(x)=w }. It is total on Y, since q is surjective by [A1]; and it is single valued, since q(x)=q(x′) implies f(x)=f(x′) by hypothesis. So fˉ is a function Y→W with fˉ∘q=f.

givenA1
1.3

Any g:Y→W with g∘q=f equals fˉ: for y∈Y pick x with q(x)=y, available by surjectivity, and then g(y)=f(x)=fˉ(y).

givenA1
1.4

p∘q is a surjection, being a composite of surjections.

A1A2L3
1.5

For V⊆Z: (p∘q)−1[V]=q−1[p−1[V]] by [L3].

L3
2.1

By step 1.2 the map fˉ exists with fˉ∘q=f continuous, so fˉ is continuous by step 1.1; with step 1.3 this is claim 2.

step 1.1step 1.2step 1.3
2.2

Let V⊆Z. If V is open in Z then p−1[V] is open in Y by [L2] and [A2], hence q−1[p−1[V]] is open in X by [A1]; by step 1.5 that set is (p∘q)−1[V].

step 1.5A1A2L2
2.3

Conversely, if (p∘q)−1[V] is open in X, then q−1[p−1[V]] is open in X by step 1.5, so p−1[V] is open in Y by [A1], so V is open in Z by [A2].

step 1.5A1A2
3.1

By steps 1.4, 2.2 and 2.3 the map p∘q is a surjection for which V is open in Z exactly when (p∘q)−1[V] is open in X; that is claim 3. With steps 1.1 and 2.1 all three claims are proved.

step 1.1step 1.4step 2.1step 2.2step 2.3A1L4∎

Remarks

  • Claim 2 is how every quotient space in this library is identified. To produce a continuous map out of an identification space one never works with equivalence classes directly: one writes a continuous map on the original space, checks that it does not distinguish identified points, and quotes claim
  1. Both examples of gluing on the companion page are exactly this move.

Depends on

Used by

…and 12 more results.

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