Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

Lebesgue measure on Rn is invariant under every orthogonal linear map

Statement

Let n≥1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), and let T be an orthogonal operator on Rn with the Euclidean inner product (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn). Then T[E] is Lebesgue measurable for every Lebesgue measurable E and

λn(T[E])  =  λn(E).

Both the orientation-preserving operators, of determinant 1, and those of determinant −1 are covered, since only the absolute value of the determinant enters; nothing is asserted here about which matrices occur in either class.

Facts & Assumptions

Given: A natural number n≥1, the Axiom of Countable Choice, and an orthogonal operator T on Rn.

[L1]

Assuming countable choice, an invertible linear T with matrix A sends Lebesgue measurable sets to Lebesgue measurable sets with λn(T[E])=∣det⁡A∣ λn(E) (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not).

[F1]

An invertible linear isometry from a real finite-dimensional inner product space to itself is an orthogonal operator (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).

[F2]
[F3]

For every linear L:Rm→Rn there is a unique matrix A such that (Lh)i=∑j<maijhj (Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0).

Proof

technique · direct
1.1F1F2F3

An orthogonal operator is by definition an invertible linear map of Rn to itself, and its matrix A satisfies ∣det⁡A∣=1, so in particular det⁡A≠0.

2.1step 1.1L1F2∎

The linear change of variables therefore applies in its invertible clause and gives λn(T[E])=∣det⁡A∣ λn(E)=λn(E) for every Lebesgue measurable E, with T[E] measurable.

Depends on

Used by

Dependency tree · two levels

71 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