Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

An equidimensional C1 map sends null sets to null sets

Statement

Assume the Axiom of Countable Choice. Let F:Mm→Nm be a C1 map between smooth manifolds of the same dimension. If E⊆M is null, then F(E)⊆N is null.

Facts & Assumptions

Given: The Axiom of Countable Choice, a C1 map F:Mm→Nm and a null subset E⊆M.

[L0]

Under Countable Choice, each smooth manifold admits a countable smooth atlas with relatively compact chart domains (Assuming Countable Choice, every smooth manifold admits a countable smooth atlas with relatively compact domains).

[L1]

Under Countable Choice, countable chart atlases of M and N detect manifold nullity (A countable chart cover detects manifold null sets, The Axiom of Countable Choice (ACω)).

[L3]

A Lipschitz map of all of Rm into Rm sends null sets to null sets (A Lipschitz map Rm→Rm sends null sets to null sets).

Proof

technique · direct
1.1L0L1givencases

If m=0, then nullity means emptiness by [L1], so E=∅ and the claim follows. Assume m≥1. By [L0] under the stated Countable Choice, take countable chart atlases (Uj,φj) of M and (Vk,ψk) of N. For each pair (j,k), the set Djk:=φj(Uj∩F−1(Vk)) is open in Rm and the coordinate map fjk:=ψk∘F∘φj−1 is C1 on Djk.

2.1L1L2L3step 1.1construct

For every (j,k), enumerate the nondegenerate closed cubes with rational endpoints whose closures lie in Djk. Their interiors cover Djk, and the family is countable. On each such cube Q, [L2] bounds ∥Dfjk∥ and makes fjk∣Q Lipschitz, since Q is convex. Define πQ:Rm→Q by clamping each coordinate to its interval; each scalar clamp is 1-Lipschitz, so πQ is 1-Lipschitz in Euclidean norm and fixes Q. Hence fjk∘πQ is Lipschitz on all of Rm. The set AjkQ:=φj(E∩Uj)∩Q is null by [L1], so [L3] makes fjk(AjkQ)=(fjk∘πQ)(AjkQ) null.

3.1L1step 1.1step 2.1algebra∎

Fix k. Every point of ψk(F(E)∩Vk) comes from some p∈E∩Uj∩F−1(Vk), and φj(p) lies in the interior of one of the cubes from step 2.1. Thus ψk(F(E)∩Vk) is contained in the countable union of the null sets fjk(AjkQ) over j,Q. Countable subadditivity makes it null. Since this holds for each k, [L1] detects F(E) as null in N.

Depends on

Used by

Dependency tree · two levels

49 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