Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 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.

An invertible linear map of Rn scales the Lebesgue measure of every Borel set by a positive constant depending only on the map

Statement

Let n≥1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and let T:Rn→Rn be an invertible linear map (Linear map between vector spaces over the same field). Then:

  1. T[E] is a Borel set for every Borel set E, and T carries open sets to open sets;
  2. there is a strictly positive real c(T), namely c(T)=λn(T[(0,1]n]), with λn(T[E])  =  c(T) λn(E)for every E∈B(Rn);
  3. c(S∘T)=c(S) c(T) for invertible linear S and T, and c(id)=1.

Facts & Assumptions

Given: A natural number n≥1, the Axiom of Countable Choice, and an invertible linear map T of Rn.

[L1]

Assuming countable choice, a measure μ on B(Rn) with μ(E+h)=μ(E) for every Borel E and every h, and with μ((0,1]n)=1, equals λn on B(Rn); in particular the theorem notes that the restriction of λn to B(Rn) satisfies these hypotheses (A translation-invariant measure on the Borel sets of Rn giving the unit cube measure one is the restriction of Lebesgue measure).

[L3]

Every set R with R∘⊆R⊆R‾ is Lebesgue measurable with λn(R)=∏i<n(bi−ai) (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included).

[F1]

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

[F2]

The translate of E⊆Rn by a is E+a:={x+a:x∈E} (Translation of a subset of Rn).

[F3]

A measure on (X,A) is a function μ:A→[0,+∞] with μ(∅)=0 that is countably additive on pairwise disjoint sequences (Measures on sigma-algebras), and a scalar multiple cμ is again a measure (Nonnegative scalar multiples and countable weighted sums of measures are measures, Nonnegative scalar multiples and countable weighted sums of measures).

[F4]

The Borel sigma-algebra is the sigma-algebra generated by the open sets (The Borel sigma-algebra of a topological space), σX(E) is the smallest sigma-algebra containing E (Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal), and a sigma-algebra is closed under complements and countable unions (Sigma-algebras).

Proof

technique · direct
1.1F1F6

The inverse T−1 is linear, so there are reals K≥0 and KT≥0 with ∥T−1y∥2≤K∥y∥2 and ∥Tx∥2≤KT∥x∥2 for all x,y; put K′:=K+1>0.

2.1step 1.1F1F5F6

T carries open sets to open sets: if U is open, y=Tx∈T[U] and B(x,r)⊆U, then d2(y,z)<r/K′ gives d2(x,T−1z)=∥T−1(y−z)∥2≤K d2(y,z)<r, so T−1z∈U and z∈T[U].

3.1step 2.1F4

The family of E⊆Rn with T[E] Borel is a sigma-algebra, because T is a bijection and so T[⋅] commutes with complements and with countable unions, and it contains every open set by step 2.1; minimality of B(Rn) over the open sets gives claim 1.

3.2step 2.1L2L3L4F1F5F6

T[(0,1]n] is bounded, being contained in the ball about the origin of radius KTn+1, so it has finite measure; and it contains T[V] for the nonempty open box V:={x:0<xi<1 (i<n)}, which is open and nonempty by step 2.1, hence contains a ball B(y,r) and with it the open box {x:∣xi−yi∣<r/n}, whose measure (2r/n)n is a strictly positive real. So c(T):=λn(T[(0,1]n]) is a strictly positive real.

4.1step 3.1L1L2F2F3

The assignment ν(E):=λn(T[E]) is well defined on B(Rn) by claim 1, and it is a measure: ν(∅)=0, and T being injective carries a pairwise disjoint sequence to a pairwise disjoint sequence with T[⋃kEk]=⋃kT[Ek], so countable additivity of λn transfers. It is translation invariant, since T[E+h]=T[E]+T(h) by linearity and λn is translation invariant.

5.1step 3.2step 4.1L1L3F3∎

By step 3.2 the scalar multiple c(T)−1ν is a measure on B(Rn), it is translation invariant, and it gives the unit cube the value 1, so the uniqueness theorem identifies it with λn on the Borel sets; that is claim 2. Claim 3 follows by evaluating at the unit cube: c(S∘T)=λn(S[T[(0,1]n]])=c(S)λn(T[(0,1]n])=c(S)c(T), and the identity map gives c(id)=λn((0,1]n)=1.

Depends on

Used by

Dependency tree · two levels

114 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