Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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 chart cover detects manifold null sets

Statement

Let M be a smooth manifold. If {(Uj,φj)}jN is a countable smooth atlas with relatively compact domains, then a subset EM is null if and only if every φj(EUj) is null in RdimM when dimM1, and every φj(EUj) is empty when dimM=0.

Facts & Assumptions

Given: A countable smooth atlas {(Uj,φj)}jN with relatively compact domains on a smooth manifold M.

[F1]

On a 0-manifold, the only null subset is the empty set (Null subsets of a smooth manifold).

[L2]

Nullity is independent of the chosen smooth atlas (The null-set definition is independent of the smooth atlas).

Proof

technique · direct
1.1

If dimM=0, [F1] says that E is null exactly when E=. Because the chart domains cover M, this is equivalent to every EUj being empty, hence to every chart image being empty.

F1givencases
1.2

Assume dimM1. If E is null, then every chart image φj(EUj) is null by definition.

givencases
2.1

Conversely, the given countable atlas is itself a smooth atlas, so [L2] says that being null with respect to this atlas is the same as being null with respect to any other. Therefore the displayed chartwise condition implies that E is null.

L2step 1.1step 1.2
3.1

Hence this countable chart cover detects manifold null sets in every dimension.

step 1.1step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

9 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