Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-29
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 C^1 diffeomorphism maps Lebesgue null sets to Lebesgue null sets

Statement

Let U,VRn be open and let T:UV be a C1 diffeomorphism. If NU is Lebesgue null, then T(N) is Lebesgue null.

Facts & Assumptions

Given: Open sets U,VRn, a C1 diffeomorphism T:UV, and a null set NU.

[L1]

Lipschitz self-maps of Euclidean space send null sets to null sets. (A Lipschitz map RmRm sends null sets to null sets)

[L2]

Lebesgue measure is countably subadditive. (Finite and countable subadditivity of measures)

[A1]

There are closed cubes QjU with jQj=U such that for each j there is a Lipschitz map Sj:RnRn agreeing with T on Qj. This is the standard cube-and-clamp construction: choose an open cube whose closure still lies in U, use continuity of DT there to get a derivative bound and hence a Lipschitz bound on that cube, then compose T with the coordinatewise clamp onto the cube to obtain a global Lipschitz extension.

Proof

technique · direct
1.1

Write N=j1(NQj) using [A1]. Each set NQj is null, and the global Lipschitz extension Sj from [A1] agrees with T on Qj. Therefore [L1] gives λn(T(NQj))=λn(Sj(NQj))=0 for every j.

A1L1
2.1

Since T(N)=j1T(NQj), [L2] implies λn(T(N))j1λn(T(NKj))=0. Hence T(N) is Lebesgue null.

L2step 1.1

Depends on

Used by

Dependency tree · two levels

19 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