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⊆S⊆X the closure of A in S is A‾X∩S, while the interior only contains int⁡X(A)∩S, with equality when S is open; and a dense subset of X traces to a dense subset of every open S

Statement

Let (X,T) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), let S⊆X carry the subspace topology TS (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) and let A⊆S. Write A‾ and int⁡(A) for the closure and the interior of A in X, and cl⁡S(A) and int⁡S(A) for those taken in the space (S,TS) (Interior, closure, boundary, exterior, derived set and isolated point in a topological space). Then:

  1. Closure traces exactly. cl⁡S(A)  =  A‾∩S.
  2. Interior traces only one way. int⁡(A)⊆S, so int⁡(A)∩S=int⁡(A), and int⁡(A)  ⊆  int⁡S(A), an inclusion that may be strict.
  3. Equality for an open subspace. If S∈T then int⁡S(A)=int⁡(A).
  4. Density traces to open subspaces only. If D⊆X is dense in X (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) and S∈T, then D∩S is dense in (S,TS). Without the hypothesis S∈T this fails.

Both failures are witnessed inside the proof, in Sierpinski space (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies): the unqualified forms of claims 2 and 3 and of claim 4 are false, and the counterexamples are two lines each rather than deferred.

Facts & Assumptions

Given: A topological space (X,T), a subset S⊆X with its subspace topology TS={ U∩S:U∈T }, and a subset A⊆S. Also Sierpinski space E={a,b} with a≠b and TE={∅,{b},E}.

[A1]

TS is a topology on S, and C⊆S is closed in S if and only if C=F∩S for some closed F⊆X (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).

[L1]

int⁡(A) is the largest open subset of A and A‾ is the smallest closed superset of A; both are taken in whichever space is named (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[L2]

D is dense in a space exactly when D meets every nonempty open subset of that space (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

Proof

technique · direct
1.1

A‾∩S is closed in S by [A1], since A‾ is closed in X, and it contains A, since A⊆A‾ and A⊆S.

A1L1
1.2

cl⁡S(A)=F∩S for some closed F⊆X, by [A1] applied to the set cl⁡S(A), which is closed in S; and A⊆cl⁡S(A)=F∩S⊆F.

A1L1
1.3

int⁡(A) is open in X and satisfies int⁡(A)⊆A⊆S, so int⁡(A)=int⁡(A)∩S is a trace of an open set of X and hence lies in TS.

givenL1
1.4

In E, put S0:={a}, A0:={a} and D0:={b}. Then int⁡S0(A0)=S0={a}, since S0 is open in S0 and S0⊆A0; and the interior of A0 in E is ∅, since by [L3] the only open subset of {a} in E is ∅. So the inclusion of claim 2 is strict for this pair.

L1L3
1.5

Assume S∈T. Then int⁡S(A), being open in S, is open in X by [A2], and it is contained in A; so int⁡S(A)⊆int⁡(A) by [L1].

A2L1
1.6

Assume S∈T and that D is dense in X, and let W be a nonempty open subset of S. By [A2] the set W is open in X, so W∩D≠∅ by [L2]; and W⊆S gives W∩D=W∩(D∩S).

A2L2
2.1

In E with the sets of step 1.4: the closure of D0 in E is E, since by [L3] the only closed superset of {b} is E, so D0 is dense in E; and D0∩S0=∅, which is not dense in the nonempty space S0, because S0 is a nonempty open subset of S0 that ∅ does not meet.

L1L2L3
2.2

cl⁡S(A)⊆A‾∩S: by step 1.1 the set A‾∩S is a closed subset of S containing A, and cl⁡S(A) is the smallest such.

step 1.1L1
2.3

A‾∩S⊆cl⁡S(A): with F as in step 1.2 one has A⊆F with F closed in X, so A‾⊆F by [L1], whence A‾∩S⊆F∩S=cl⁡S(A).

step 1.2L1
2.4

int⁡(A)⊆int⁡S(A): by step 1.3 the set int⁡(A) is open in S and contained in A, and int⁡S(A) is the largest such.

step 1.3L1
3.1

Steps 2.2 and 2.3 give cl⁡S(A)=A‾∩S, which is claim 1.

step 2.2step 2.3
3.2

Step 1.3 gives int⁡(A)∩S=int⁡(A), step 2.4 gives the inclusion, and step 1.4 exhibits a case where the inclusion is strict; this is claim 2.

step 1.3step 2.4step 1.4
3.3

Steps 2.4 and 1.5 give int⁡S(A)=int⁡(A) when S∈T, which is claim 3.

step 2.4step 1.5
4.1

By step 1.6 the set D∩S meets every nonempty open subset of S, hence is dense in (S,TS) by [L2]; and step 2.1 shows that the conclusion fails for a subspace that is not open. This is claim 4, and with steps 3.1, 3.2 and 3.3 all four claims are proved.

step 1.6step 2.1step 3.1step 3.2step 3.3L2∎

Remarks

  • The same two failures occur in R, and there they are the familiar ones. With the usual topology, S=[0,1] and A=[0,1] give int⁡S(A)=[0,1] while int⁡(A)=(0,1); and Q is dense in R while its trace on the subspace of irrationals is empty, so a dense set need not trace to a dense set of a subspace that is not open. Sierpinski space is used in the proof only because it needs no real-number machinery.

  • Why closure behaves better than interior. Claim 1 holds for every S, with no hypothesis, because the closed sets of a subspace are exactly the traces of the closed sets and tracing preserves the "smallest superset" that defines a closure. The interior is a largest subset, and tracing does not preserve that: a set can be open in S without being the trace of any open set of X that is contained in A, which is exactly what step 1.4 exhibits.

  • Claim 4 is what makes "has a countable dense subset" behave the way it does. The property passes to open subspaces by claim 4, and it does not pass to arbitrary subspaces; the witness for the failure is worked on the companion page, where an uncountable discrete subspace is exhibited inside a space with a countable dense subset.

Depends on

Used by

Dependency tree · two levels

20 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