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.

The image of a lower-dimensional C1 manifold is null

Statement

Assume the Axiom of Countable Choice. Let Pm and Nn be smooth manifolds with m<n, and let F:P→N be a C1 map. Then F(P)⊆N is a null subset of N.

Facts & Assumptions

Given: Countable Choice and a C1 map F:Pm→Nn with m<n.

[L1]

An equidimensional C1 map sends null sets to null sets (An equidimensional C1 map sends null sets to null sets).

[L2]

A countable chart cover detects manifold nullity (A countable chart cover detects manifold null sets).

[L3]

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

[L4]

Countable unions and subsets of manifold null sets are null under Countable Choice (Countable unions and subsets of manifold null sets are null).

[F1]

A Euclidean null set has arbitrarily small countable closed-cube covers (Measure zero and content zero in Rm by countable and finite cube covers).

Proof

technique · direct
1.1L3L4given

Under the stated Countable Choice, choose countable smooth atlases {(Ui,φi)} on P and {(Vj,ψj)} on N as in [L3]. The countable family of open sets Ui∩F−1(Vj) covers P. It is enough to show that the image of each is null in N, then use [L4] for their union.

2.1F1L1step 1.1

Fix one open overlap U=Ui∩F−1(Vj), write Ω=φi(U)⊆Rm, and let (Vj,ψj) be its target chart. Define F~:Ω×Rn−m→Rn,F~(u,z):=(ψj∘F∘φi−1)(u). The slice Ω×{0} is Euclidean null: cover it by countably many bounded m-cubes times {0}; for each cube, finite (n)-cube covers of arbitrarily small total volume are obtained by choosing a sufficiently thin grid in the remaining n−m≥1 coordinates, and [F1] combines these with geometric error budgets under Countable Choice. The map F~ is C1. Thus [L1] makes F~(Ω×{0})=ψj(F(U)) Euclidean null.

3.1L2L4step 1.1step 2.1∎

To check every target chart Vk, apply the same argument to the further open overlap U∩F−1(Vk); its coordinate map has target Vk, so step 2.1 makes ψk(F(U)∩Vk) Euclidean null. The countable chart cover on N detects F(U) as null by [L2]. Finally [L4] makes the countable union F(P) null.

Depends on

Used by

Dependency tree · two levels

28 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