Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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.

FALSE: every quotient map is an open map

Statement

False claim: every quotient map q:X→Y (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection) is an open map, that is, carries open subsets of X to open subsets of Y (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

The converse implication is the one that holds: a continuous open surjection is a quotient map (A continuous open surjection, a continuous closed surjection, and a continuous surjection admitting a continuous section are all quotient maps, clause 1). The claim above fails for the cheapest identification there is, collapsing a closed interval of R to a point. Take X:=R with its usual topology (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), B:=[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length), and let

q:R→R/B

be the canonical projection of the quotient that identifies all of B to one point and identifies nothing else (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 q is a quotient map by construction, and q[(−1, 1/2)] is not open.

Facts & Assumptions

Given: R with its usual topology; B=[0,1]; the equivalence relation on R whose classes are B and the singletons {t} for t∉B; the quotient R/B with the quotient topology and its canonical projection q; and the set U:=(−1, 1/2).

[A1]

q is a surjection, the topology of R/B is the quotient topology of q, and consequently V⊆R/B is open exactly when q−1[V] is open in R; so q is 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).

[A2]

A⊆R is saturated for q exactly when A∩B is ∅ or B, and q−1[q[A]] is the saturation of A (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[L1]

Refutation

technique · direct
1.1

U=(−1, 1/2) is open in R, being a bounded open interval.

L1
1.2

U∩B=[0, 1/2), which is neither ∅, since it contains 0, nor B, since 1∈B and 1∉[0,1/2); so U is not saturated.

A2L1
1.3

(−1, 1] is not open in R: for every r>0 the interval (1−r, 1+r) contains 1+r/2, which satisfies 1+r/2>1 and so lies outside (−1,1]; hence no bounded open interval around 1 lies inside (−1,1].

L1
2.1

q−1[q[U]]=U∪B=(−1, 1]: the saturation of U adds to U exactly the class of each of its points, and the only non-singleton class meeting U is B itself, by step 1.2.

step 1.2A2L1
3.1

By step 2.1 and step 1.3 the set q−1[q[U]] is not open in R, so q[U] is not open in R/B by [A1].

step 2.1step 1.3A1L3
4.1

By [A1] the map q is a quotient map, and by step 1.1 and step 3.1 it carries the open set U to a set that is not open; so q is not an open map by [A3], and the claim is false.

step 1.1step 3.1A1A3L2∎

Remarks

Depends on

Used by

Dependency tree · two levels

42 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