Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-09-23 (gpt-6-sol)
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 countable coordinate-ball cover has a countable locally finite shrinking

Statement

Assume countable choice ACω. Let (Un)n≥1 be a countable cover of a smooth manifold M by coordinate balls with compact closures. Then there is an at-most-countable index set I and families of open sets (Wk)k∈I and coordinate balls (Vk)k∈I such that M=⋃k∈IWk, each Wk‾⊆Vk⊆Vk‾⊆Un(k) for some index n(k), and the family (Vk) is locally finite. The index set may be finite or empty.

Facts & Assumptions

Given: Countable choice and a countable cover (Un)n≥1 of M by coordinate balls with compact closures.

[L1]

Coordinate balls form a basis of the underlying topological manifold, and the basis balls supplied there have compact closures (Coordinate balls form a basis of a topological manifold).

[A1]

Smooth manifolds are Hausdorff and regular.

[A2]

Countable choice selects one finite covering list for each compact annulus from independently specified nonempty sets of lists (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenL3

Put Hr:=⋃i=1rUi‾ for r≥1. Each Hr is compact, and the interiors of the Hr cover M because Ur⊆int⁡(Hr).

2.1step 1.1choose

Set r1=1. Recursively, compactness of Hrm and the open cover (int⁡(Hr))r≥1 give an integer rm+1>rm such that Hrm⊆int⁡(Hrm+1). Put Km:=Hrm and K−1=K0=∅. Then Km⊆int⁡(Km+1) and the interiors of the Km cover M.

3.1L1L2L3step 2.1construct

Put A1:=K1 and Am:=Km∖int⁡(Km−1) for m≥2; each Am is compact by [L3]. For each m, consider all tuples (n,W,V) with V a coordinate ball, W open, and W‾⊆V⊆V‾⊆Un∩int⁡(Km+1)∖Km−2. Their W-sets cover Am: for an individual x∈Am, take any Un containing x and successively use [L2] and [L1] inside the displayed open neighbourhood to construct such V and W around x. This proves existence at each point without a simultaneous point-indexed choice. By compactness, the set of finite ordered lists of these tuples whose W-sets cover Am is nonempty (and contains the empty list when Am=∅).

4.1A2step 2.1step 3.1choose

Use [A2] once on the countable family of nonempty finite-list sets from step 3.1. Concatenate the chosen lists into an at-most-countable indexed family (Wk,Vk)k∈I; take I=∅ when every list is empty. They cover M because the annuli Am cover M. Given y∈M, choose m with y∈int⁡(Km). If Vk came from annulus Aj with j≥m+3, then Vk∩int⁡(Km)=∅ because Kj−2⊇Km. Only finitely many tuples came from the remaining finitely many annuli, so (Vk) is locally finite.

5.1step 4.1∎

Hence (Wk) and (Vk) give the required countable locally finite shrinking.

Depends on

Used by

Dependency tree · two levels

25 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