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 locally finite open cover by subspaces with σ-locally-finite bases yields a σ-locally-finite basis of the whole space

Statement

Let U be a locally finite open cover of X. If every U∈U, with its subspace topology, has a σ-locally-finite open basis ⋃nBU,n, then X has a σ-locally-finite open basis.

Facts & Assumptions

Given: A locally finite open cover U and the stated relative bases.

[L1]

A locally finite family has a neighbourhood at each point meeting only finitely many members (Refinements, locally finite families, point-finite families, and star refinements).

Proof

technique · direct
1.1

Since every U∈U is open in X, every member of a relative open basis BU,n is open in X by [L2]. Put Bn=⋃U∈UBU,n.

L2construct
2.1

The family Bn is locally finite. At x, take from [L1] a neighbourhood meeting only finitely many U; within each of those finitely many U, local finiteness of BU,n supplies a neighbourhood meeting finitely many members, and their finite intersection meets only finitely many members of Bn.

L1step 1.1
2.2

If O is open and x∈O, choose U∈U containing x and then a member of the basis of U containing x and contained in O∩U. Thus ⋃nBn is a basis of X.

step 1.1
3.1

Steps 2.1 and 2.2 prove the result.

step 2.1step 2.2∎

Depends on

Used by

Dependency tree · two levels

10 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