Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-09 (codex)
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.

Every regular Lindelöf space is normal

Statement

Every regular Lindelöf space is normal.

Facts & Assumptions

Given: A regular Lindelöf space X and disjoint closed sets A,B⊆X.

[F2]

Proof

technique · direct
1.1

Let V be the family of all open V⊆X satisfying V‾⊆X∖B. For every a∈A, [L1] supplies a member of V containing a, so V∪{X∖A} is an open cover of X.

L1
2.1

By Lindelöfness, an at most countable subfamily of V covers A. Interchanging A and B gives an at most countable family of open sets covering B, each with closure disjoint from A. List these families as (Un)n≥0 and (Vn)n≥0, padding a finite family with empty sets. The countable-listing convention is part of [F1]. Only two subcovers and their listings are selected; no axiom of choice is needed.

F1step 1.1
3.1

Set U=⋃n≥0(Un∖⋃i≤nVi‾) and W=⋃n≥0(Vn∖⋃i≤nUi‾). Each summand is open because it removes only finitely many closed sets from an open set. Every point of A lies in some Un and in none of the Vi‾, so A⊆U. Similarly B⊆W.

step 2.1
4.1

A point in the nth summand of U and the mth summand of W is impossible: if m≤n, the first summand excludes Vm‾; if n≤m, the second excludes Un‾. Thus U∩W=∅, and these open sets prove normality, including empty A or B.

F2step 3.1∎

Depends on

Used by

Dependency tree · two levels

22 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