Alphabeta Math
PropositionStatement: 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.

Assuming Countable Choice, every smooth manifold admits a countable smooth atlas with relatively compact domains

Statement

Assume the Axiom of Countable Choice. Every smooth manifold admits a countable smooth atlas whose chart domains have compact closures.

Facts & Assumptions

Given: The Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and a smooth manifold M.

[L1]

Under Countable Choice, the trivial open cover {M} has a countable subordinate cover by relatively compact coordinate balls (Every open cover of a manifold has a countable relatively compact coordinate-ball subcover). Applying this supplier in step 1.1 is the use of Countable Choice here.

[F1]

A smooth atlas is a cover by pairwise smoothly compatible smooth charts (Smooth atlases).

Proof

technique · direct
1.1L1given

By [L1], there are countably many coordinate balls B1,B2,… covering M, each with compact closure.

2.1F1step 1.1

Each Bn carries its inherited smooth chart, and these charts are pairwise compatible because they come from the smooth structure of M. Thus they form a countable smooth atlas by [F1].

3.1step 2.1∎

This is the required countable smooth atlas.

Depends on

Used by

Dependency tree · two levels

13 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