Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, and reflection in the origin preserves it

Statement

Let n≥1, assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), let c be a nonzero real and write cE:={ cx:x∈E } for E⊆Rn, where (cx)i:=cxi. Then:

  1. λn∗(cE)=∣c∣ n λn∗(E) for every subset E, the product being defined in R‾ because ∣c∣ n>0;
  2. E is Lebesgue measurable if and only if cE is;
  3. λn(cE)=∣c∣ nλn(E) for every Lebesgue measurable E.

At c=−1 the map is reflection in the origin and ∣c∣ n=1, so it preserves outer measure, measurability and measure. The value c=0 is excluded because 0E is {0} or ∅ and carries no information about E.

Facts & Assumptions

Given: A natural number n≥1, the Axiom of Countable Choice, a nonzero real c, and a subset E⊆Rn.

[L1]

Assuming countable choice, λcl(E)=λn∗(E), the infimum of ∑k=0∞vol⁡[uk,vk] over countable covers of E by closed rectangles (Countable covers by closed boxes, by open boxes and by closed cubes all compute Lebesgue outer measure, Lebesgue outer measure on Rn).

[L2]

A set E is Lebesgue measurable when λn∗(A)=λn∗(A∩E)+λn∗(A∖E) for every A⊆Rn, and λn is the restriction of λn∗ to the family of these (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, Carathéodory measurable sets, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[F1]

[a,b]:={x∈Rm:aj≤xj≤bj (j<m)} and vol⁡[a,b]:=∏j<m(bj−aj) (Axis-parallel rectangles in Rm and their volume).

[F2]

∏k<n(akbk)=(∏k<nak)(∏k<nbk), and finite products are defined by the recursion Π0=1, Πσ(n)=Πn⋅an (Laws of finite sums and finite products, claim 6; Finite sums and finite products, by recursion).

[F3]

The defining recursion for natural powers is a0=1 and an+1=an⋅a (Integer powers am), and (ab)n=anbn (Laws of integer exponents, claim 1).

[F4]

ab:=+∞ when one of a,b is ±∞, the other is ≠0, and both are >0 or both are <0; every product with one factor 0 and the other ±∞ is left undefined (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined).

[F5]

The absolute value satisfies ∣c∣>0 for c≠0 and ∣cd∣=∣c∣∣d∣ (Absolute value in an ordered field, Basic properties of the absolute value).

[F6]

For positive reals, multiplication preserves order and reciprocals stay positive: if 0<q and u≤v then qu≤qv, and if 0<q then 0<q−1 (Sign rules for products and monotonicity of multiplication, Inverses of positives are positive, and reciprocation reverses order, Ordered field).

Proof

technique · direct
1.1F1F2F3F5

For reals ui≤vi one has c[u,v]=[cu,cv] when c>0 and c[u,v]=[cv,cu] when c<0, in both cases a closed rectangle whose i-th side length is ∣c∣(vi−ui); its volume is therefore ∏i<n(∣c∣(vi−ui))=(∏i<n∣c∣)∏i<n(vi−ui)=∣c∣ nvol⁡[u,v].

1.2F3F4F5F6

Put q:=∣c∣ n>0. If s0=inf⁡S for a nonempty S⊆[0,+∞], then qs0 is a lower bound of qS:={qs:s∈S}: for every real s∈S the inequality s0≤s gives qs0≤qs by [F6], while the claim is automatic when s=+∞. Conversely, let t be a lower bound of qS. If t=+∞, then every element of qS is +∞, hence every element of S is +∞ and therefore s0=+∞. If t is real, then q−1>0 by [F6], so t≤qs implies q−1t≤s for every real s∈S, and again the claim is automatic when s=+∞; thus q−1t is a lower bound of S, so q−1t≤s0 and therefore t≤qs0. Hence inf⁡(qS)=q inf⁡S.

2.1step 1.1step 1.2L1F6

The assignment [u,v]↦c[u,v] is a bijection from the countable closed-rectangle covers of E onto those of cE, with inverse given by multiplication by c−1. For one such cover, let (ak) be its sequence of rectangle volumes and (sn) the partial sums of ∑k=0∞ak in the sense of Series in the nonnegative extended real line; let (tn) be the partial sums of the transformed cover cost. By step 1.1 each transformed term is qak, and the shared recursion of nonnegative extended series gives tn=qsn for every n. Therefore the transformed cover cost is q∑k=0∞ak by step 1.2. So step 1.2 turns the infimum of all transformed cover costs into λcl(cE)=∣c∣ nλcl(E), and [L1] then gives the same identity for λn∗.

3.1step 2.1L2F4F5∎

For a test set A one has A∩cE=c((c−1A)∩E) and A∖cE=c((c−1A)∖E), so step 2.1 turns the Carathéodory identity for cE tested against A into ∣c∣ n times the identity for E tested against c−1A; multiplication by the positive real ∣c∣ n is injective on [0,+∞], and A↦c−1A is a bijection of the power set, so cE is Lebesgue measurable exactly when E is, and then λn(cE)=λn∗(cE)=∣c∣ nλn∗(E)=∣c∣ nλn(E).

Depends on

Used by

Dependency tree · two levels

70 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