Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge 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.

Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison

Definition

Let XX be a set and write P(X)\mathcal{P}(X) for its power set. A topology on XX is a family TP(X)\mathcal{T} \subseteq \mathcal{P}(X) such that

  • (T1) T\varnothing \in \mathcal{T} and XTX \in \mathcal{T};
  • (T2) ST\bigcup \mathcal{S} \in \mathcal{T} for every ST\mathcal{S} \subseteq \mathcal{T};
  • (T3) UVTU \cap V \in \mathcal{T} for all U,VTU, V \in \mathcal{T}.

A topological space is a pair (X,T)(X, \mathcal{T}) consisting of a set XX and a topology T\mathcal{T} on it; the elements of XX are its points. When only one topology is in play we write XX for the pair; when several are, the topology is always named.

The members of T\mathcal{T} are the open sets of (X,T)(X,\mathcal{T}). A subset FXF \subseteq X is closed when its complement XFX \setminus F is open, and clopen when it is both open and closed. By (T1) both \varnothing and XX are clopen. Open and closed are not opposites: a set may be neither, and it may be both, so "not open" is never a synonym for "closed".

Finite intersections, and the empty one. Axiom (T3) is stated for two sets because that is all that is ever needed: if n1n \ge 1 and U1,,UnTU_1, \dots, U_n \in \mathcal{T}, then U1UnTU_1 \cap \dots \cap U_n \in \mathcal{T} follows by iterating (T3) n1n-1 times. The intersection of the empty family of subsets of XX is XX, since the condition "lies in every member of the empty family" is vacuous; that case is covered by (T1) rather than by (T3), which is one of the two reasons XTX \in \mathcal{T} is demanded outright. The other is that (T2) alone gives only =\bigcup \varnothing = \varnothing.

The closed sets, and the dual axiomatisation. Put C:={XU:UT}\mathcal{C} := \{\, X \setminus U : U \in \mathcal{T} \,\}, the family of closed sets. Then

  • (C1) C\varnothing \in \mathcal{C} and XCX \in \mathcal{C};
  • (C2) DC\bigcap \mathcal{D} \in \mathcal{C} for every nonempty DC\mathcal{D} \subseteq \mathcal{C};
  • (C3) CDCC \cup D \in \mathcal{C} for all C,DCC, D \in \mathcal{C}.

Conversely, if a family CP(X)\mathcal{C} \subseteq \mathcal{P}(X) satisfies (C1), (C2) and (C3), then T:={XC:CC}\mathcal{T} := \{\, X \setminus C : C \in \mathcal{C} \,\} is a topology on XX whose closed sets are exactly the members of C\mathcal{C}. So a topology may be presented equally well by its open sets or by its closed sets, and this library uses whichever is shorter.

Both directions are one computation, and it is carried out here rather than assumed. The map UXUU \mapsto X \setminus U is an involution of P(X)\mathcal{P}(X), hence a bijection, and it carries the two De Morgan identities

XiIAi=iI(XAi)(I),XiIAi=iI(XAi)(I)X \setminus \bigcup_{i \in I} A_i = \bigcap_{i \in I} (X \setminus A_i) \quad (I \ne \varnothing), \qquad X \setminus \bigcap_{i \in I} A_i = \bigcup_{i \in I} (X \setminus A_i) \quad (I \ne \varnothing)

term by term into each other. Given (T1)–(T3): =XX\varnothing = X \setminus X and X=XX = X \setminus \varnothing lie in C\mathcal{C}, which is (C1); for nonempty DC\mathcal{D} \subseteq \mathcal{C} the family S={XC:CD}\mathcal{S} = \{\, X \setminus C : C \in \mathcal{D} \,\} lies in T\mathcal{T} and D=XS\bigcap \mathcal{D} = X \setminus \bigcup \mathcal{S} is closed by (T2), which is (C2); and CD=X((XC)(XD))C \cup D = X \setminus ((X \setminus C) \cap (X \setminus D)) is closed by (T3), which is (C3). Given (C1)–(C3) the same three lines run backwards, the empty-union case =\bigcup \varnothing = \varnothing being supplied by (C1) rather than by (C2); and {XC:CC}\{\, X \setminus C : C \in \mathcal{C} \,\} has C\mathcal{C} as its family of complements because complementation is an involution.

Comparison of topologies. If T1\mathcal{T}_1 and T2\mathcal{T}_2 are topologies on the same set XX and T1T2\mathcal{T}_1 \subseteq \mathcal{T}_2, then T1\mathcal{T}_1 is coarser than T2\mathcal{T}_2 and T2\mathcal{T}_2 is finer than T1\mathcal{T}_1; the comparison is strict when the inclusion is. Inclusion is a partial order on the set of topologies on XX (Partial order and partially ordered set), and it is not a total one: two topologies on the same set may be incomparable.

Remarks

  • The topology is part of the data. Two different topologies on one set are two different topological spaces, exactly as two different metrics on one set are two different metric spaces. Every statement below that says "the space XX" has a topology fixed in advance.

  • Nothing is assumed beyond (T1)–(T3). In particular no separation property is built into the word space here: distinct points need not lie in disjoint open sets, singletons need not be closed, and both failures occur in the standard topologies defined on the next item. Where a separation property is used it is stated as a hypothesis.

  • This library always writes coarser and finer. The synonyms smaller/larger are unambiguous, but weaker/stronger is used in both directions in the literature and is avoided here entirely.

  • Why "arbitrary unions, finite intersections" and not the reverse. The asymmetry is not a convention: it is what makes the metric notion of open set (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) an instance, and an arbitrary intersection of open sets genuinely need not be open. The failure is recorded on this page as a false statement, with witnesses in two different spaces.

Depends on

Used by

…and 138 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 1 result over 1 level. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources