Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-09-23 (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.

A countable boundary coordinate cover has a locally finite shrinking

Statement

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

Facts & Assumptions

Given: Countable Choice and a countable relatively compact coordinate ball or half-ball cover (Un) of M.

[L1]

At every point of a boundary manifold, relatively compact coordinate balls or half-balls form a basis subordinate to any open neighbourhood (Relatively compact coordinate balls and half-balls form a boundary-manifold basis).

[L4]

Subsets of N2 are at most countable (N×N≈N).

[A1]

Smooth manifolds with boundary are Hausdorff.

[A2]

Countable Choice selects one finite covering list for each compact annulus from the nonempty set of all eligible finite lists (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenL3

Put Hr=⋃i=1rUi‾ for r≥1. Every Hr is compact: an open cover of this finite union restricts to an open cover of each compact Ui‾, and the union of finitely many finite subcovers is finite. Also Ur⊆int⁡Hr, so the interiors of the Hr cover M.

2.1step 1.1construct

Set r1=1. Given rm, compactness of Hrm and the increasing open cover (int⁡Hr)r≥1 give an integer rm+1>rm with Hrm⊆int⁡Hrm+1; take the least such integer, so this recursion uses no additional choice. Put Km=Hrm and K−1=K0=∅. Then Km⊆int⁡Km+1 and the interiors of the Km cover M.

3.1L1L3step 2.1

Let A1=K1 and Am=Km∖int⁡Km−1 for m≥2. Each Am is compact by [L3]. For each m, consider every tuple (n,W,V) with V a coordinate ball or half-ball, W open, and W‾⊆V⊆V‾⊆Un∩int⁡Km+1∖Km−2. Their W-sets cover Am: given x∈Am, the displayed open neighbourhood contains x for some n; use [L1] to take a relatively compact coordinate ball or half-ball V with compact closure inside it, then apply [L1] again inside V to take a ball or half-ball W with x∈W⊆W‾⊆V. This proves pointwise existence without selecting witnesses at every point. Compactness makes the set of finite ordered tuple lists whose W-sets cover Am nonempty; for an empty annulus, the empty list is eligible.

4.1A2L4step 2.1step 3.1

By [A2], choose one eligible finite ordered list for each m. If its length is sm, index its tuples by pairs (m,j) with 1≤j≤sm; thus I={(m,j):m≥1,1≤j≤sm}⊆N2 is at most countable by [L4], and is empty when all lists are empty. Write these tuples as (n(k),Wk,Vk). Since the annuli cover M, so do the Wk. For y∈M, choose m with y∈int⁡Km. Any Vk from annulus Aj with j≥m+3 misses this neighbourhood because it lies outside Kj−2⊇Km. Only finitely many tuples come from the finitely many earlier lists. Thus (Vk) is locally finite.

5.1step 3.1step 4.1∎

The constructed Wk,Vk have the required nesting and cover, and Vk is subordinate to an original Un(k) by its defining tuple.

Depends on

Dependency tree · 2 levels

Sources