Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

A translation-invariant Borel measure giving the unit cube measure one gives each generation-k dyadic cube measure 2kn

Statement

Let n1 and let μ be a measure on (Rn,B(Rn)) (Measures on sigma-algebras, The Borel sigma-algebra of a topological space) such that

μ(E+h)=μ(E)for every Borel E and every hRn,μ((0,1]n)=1.

Then μ(Q)=2kn for every dyadic cube Q of generation k (Dyadic cubes of generation k in Rn).

Only translates of half-open boxes are used, and those are Borel (The sigma-algebra generated by the half-open boxes of Rn is the Borel sigma-algebra), so the invariance hypothesis is applied only where it is unambiguously meaningful.

Facts & Assumptions

Given: A natural number n1, a natural number k, and a measure μ on the Borel sets of Rn that is translation invariant and gives the unit cube measure 1.

[L1]

Qk,m={xRn:mi2k<xi(mi+1)2k for every i<n}, and Q0,0=(0,1]n (Dyadic cubes of generation k in Rn, Half-open boxes in Rn and their volume, Integer powers am).

[L2]

Every xRn lies in exactly one dyadic cube of generation k (For each generation, the dyadic cubes of that generation are pairwise disjoint and cover Rn).

[F1]

A measure on (X,A) is a function μ:A[0,+] with μ()=0 that is countably additive on pairwise disjoint sequences (Measures on sigma-algebras); padding a finite disjoint list with empty sets makes it finitely additive.

[F2]

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

[F3]

k<nλ=nλ, where n denotes the canonical natural of R (Laws of finite sums and finite products, claim 2; Finite sums and finite products, by recursion).

[F4]

For a0 and m,nZ, am+n=aman and (am)n=amn (Laws of integer exponents, claims 1 and 3; Integer powers am).

[F5]

Let SN; if 0S and σ(n)S whenever nS, then S=N (The principle of mathematical induction).

[F6]

The order on Z is total and compatible with addition (The integers form a totally ordered ring); the canonical embedding of N into Z has as image exactly the nonnegative integers (The naturals embed in the integers, The integers as equivalence classes of pairs of naturals); and m<n in N exactly when σ(m)n (Discreteness: σ(n) is the immediate successor).

Proof

technique · direct
1.1

A generation-k dyadic cube is contained in (0,1]n exactly when 0mi and mi+12k for every i<n, and every point of (0,1]n lies in such a cube: if x(0,1]n and m is the index of the generation-k cube containing x, then mi<2kxi2k and mi+12kxi>0, so 0mi and mi+12k by discreteness of Z; conversely such a cube lies in (0,1]n because mi2k0 and (mi+1)2k1.

L1L2F4F6
1.2

Every generation-k dyadic cube is a translate of Qk,0=(0,2k]n, namely Qk,m=Qk,0+m2k, and it is a half-open box, hence Borel; so all generation-k cubes receive the same value under μ.

L1L3F2
2.1

The indices admitted in step 1.1 are exactly the functions from n to the set {jN:j<2k}, and there are 2kn of them: by induction on n, at n=0 there is exactly one such function and 20=1, while each function on n+1 coordinates is a function on n coordinates together with one of 2k values in the new coordinate, so the count is multiplied by 2k and (2k)n2k=(2k)n+1=2k(n+1).

F4F5F6
3.1

By steps 1.1 and 2.1 the cube (0,1]n is the union of a list of 2kn pairwise disjoint generation-k dyadic cubes, so finite additivity and step 1.2 give 1=μ((0,1]n)=r<2knμ(Qk,0); no term can be +, since then the sum would be + rather than 1, so the common value is a real and the sum is 2knμ(Qk,0).

step 1.1step 1.2step 2.1L2F1F3
4.1

Dividing by the strictly positive real 2kn gives μ(Qk,0)=2kn, and step 1.2 transfers the value to every generation-k dyadic cube.

step 1.2step 3.1F4

Depends on

Used by

Dependency tree · two levels

75 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