Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

A space is normal if and only if every closed AA inside an open UU admits an open VV with AVVUA \subseteq V \subseteq \overline{V} \subseteq U

Statement

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), with closures as in Interior, closure, boundary, exterior, derived set and isolated point in a topological space. The following two conditions are equivalent.

In particular, in a normal space any two disjoint closed sets AA and DD admit an open VAV \supseteq A with VD=\overline{V} \cap D = \varnothing: apply (b) to AA and the open set XDX \setminus D. That corollary is the form in which normality is used later on this page.

Facts & Assumptions

Given: A topological space (X,T)(X,\mathcal{T}), a closed set AA, an open set UU with AUA \subseteq U, and disjoint closed sets A0,B0A_0, B_0.

[L2]

A set is closed exactly when its complement is open, and complementation reverses inclusion (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

Assume (a), and let AA be closed with AUA \subseteq U and UU open; then B:=XUB := X \setminus U is closed by [L2] and AB=A \cap B = \varnothing, so [A1] gives disjoint open VAV \supseteq A and WBW \supseteq B.

A1L2assume-hyp
1.2

Assume (b), and let A0,B0A_0, B_0 be disjoint closed sets; then U0:=XB0U_0 := X \setminus B_0 is open by [L2] and contains A0A_0, so (b) gives an open V0V_0 with A0V0V0U0A_0 \subseteq V_0 \subseteq \overline{V_0} \subseteq U_0.

L2assume-hyp
2.1

Under step 1.1: VXWV \subseteq X \setminus W, since VW=V \cap W = \varnothing, and XWX \setminus W is closed by [L2], so VXW\overline{V} \subseteq X \setminus W by [L1]; and XWXB=UX \setminus W \subseteq X \setminus B = U because BWB \subseteq W and complementation reverses inclusion.

step 1.1L1L2
2.2

Under step 1.2: put W0:=XV0W_0 := X \setminus \overline{V_0}, which is open by [L1] and [L2]; then V0W0=V_0 \cap W_0 = \varnothing because V0V0V_0 \subseteq \overline{V_0}, and B0=XU0XV0=W0B_0 = X \setminus U_0 \subseteq X \setminus \overline{V_0} = W_0 because V0U0\overline{V_0} \subseteq U_0.

step 1.2L1L2
3.1

Step 2.1 gives AVVUA \subseteq V \subseteq \overline{V} \subseteq U with VV open, so (a) implies (b).

step 2.1
3.2

Step 2.2 gives disjoint open V0A0V_0 \supseteq A_0 and W0B0W_0 \supseteq B_0, so (b) implies (a) by [A1].

step 2.2A1
4.1

Steps 3.1 and 3.2 make (a) and (b) equivalent.

step 3.1step 3.2
5.1

For the final assertion, let AA and DD be disjoint closed sets in a normal XX; then XDX \setminus D is open by [L2] and contains AA, so (b) gives an open VV with AVVXDA \subseteq V \subseteq \overline{V} \subseteq X \setminus D, whence VD=\overline{V} \cap D = \varnothing.

step 4.1L2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 21 results over 10 levels. 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