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

C1 local diffeomorphisms preserve null sets locally

Statement

Let F:M→N be a C1 local diffeomorphism. For every p∈M there are coordinate neighbourhoods (U,φ) of p and (V,ψ) of F(p) such that F∣U:U→V is a diffeomorphism and, for every A⊆U, using the closed-cube nullity of Measure zero and content zero in Rm by countable and finite cube covers,

φ(A) is null in Rn  ⟺  ψ(F(A)) is null in Rn.

For n=0, “null” means empty.

Facts & Assumptions

Given: A C1 local diffeomorphism F:M→N and p∈M.

[F1]

A local diffeomorphism restricts near p to a diffeomorphism onto an open neighbourhood of F(p) (Diffeomorphisms and local diffeomorphisms of manifolds).

[F2]

In dimension zero, the nullity convention in the Statement means emptiness.

[L1]

A C1 coordinate map has bounded derivative on a compact cube lying in its domain, hence is Lipschitz there (A C1 map is locally Lipschitz on compact coordinate subsets).

[L2]

Global Lipschitz maps of Rn preserve closed-cube null sets (A Lipschitz map Rm→Rm sends null sets to null sets).

Proof

technique · direct
1.1F1givenchoose

By [F1], shrink around p so that F∣U:U→V is a diffeomorphism and both U and V are chart domains. The coordinate map T=ψ∘F∘φ−1 is a C1 diffeomorphism between open subsets D=φ(U) and E=ψ(V) of Rn.

2.1F2step 1.1

If n=0, T is bijective between subsets of the one-point space R0, so a set is empty exactly when its image is empty. This gives the claim in dimension zero.

2.2L1step 1.1construct

Suppose n>0. Choose a closed coordinate cube Q⊆D around φ(p) and a closed coordinate cube R⊆E around T(φ(p)), both with interiors containing those points. Shrink U to the preimage of int⁡Q∩T−1(int⁡R) and set V=F(U). The continuous derivatives of T on Q and T−1 on R are bounded; the mean-value inequality on these convex cubes makes the restrictions Lipschitz, as in [L1].

3.1L2step 2.1step 2.2∎

The coordinatewise clamps rQ:Rn→Q and rR:Rn→R are 1-Lipschitz. Thus T∘rQ and T−1∘rR are global Lipschitz maps; the first agrees with T on φ(U)⊆Q, and the second agrees with T−1 on ψ(V)⊆R. Apply [L2] to each. For every B⊆φ(U), B is null if and only if T(B) is null. Taking B=φ(A) and including step 2.1 proves the claim.

Depends on

Used by

Dependency tree · two levels

22 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