Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02
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 T1 space with a compatible normal sequence of open covers is metrizable

Statement

If a T1 space has a compatible normal sequence of open covers, then it is metrizable.

Facts & Assumptions

Given: A T1 space X and a compatible normal sequence (Un)n∈N.

Proof

technique · constructive
1.1

Put Vn={(x,y):y∈St⁡(x,Un)}. Each Vn is symmetric, contains the diagonal, and normality gives Vn+1∘Vn+1⊆Vn: two successive Un+1-links lie in the star of one member, which is contained in a member of Un.

givenconstruct
2.1

Define d(x,y) as the smaller of 1 and the infimum of ∑r=1k2−nr over finite chains x=x0,…,xk=y with (xr−1,xr)∈Vnr, taking the infimum of an empty collection to be +∞. Reversing a chain gives symmetry. Concatenation gives the triangle inequality within a chain-connected component, while points in different components have distance 1; truncation at 1 preserves the triangle inequality. The diagonal chains give d(x,x)=0.

step 1.1construct
3.1

The containment in step 1.1 lets every chain of total weight below 2−n−1 be compressed, from its finest links upward, to a Vn-link. Hence d(x,y)<2−n−1 implies (x,y)∈Vn; conversely (x,y)∈Vn gives d(x,y)≤2−n.

step 1.1step 2.1
4.1

Compatibility (i) and step 3.1 show d(x,y)>0 when x≠y. Compatibility (ii), the two bounds in step 3.1, and [L1] show that the d-balls and the original neighbourhoods contain one another at every point. Thus d is a metric inducing the given topology.

L1step 3.1discharge-construct∎

Depends on

Used by

Dependency tree · two levels

33 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