Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-12
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.

Uniqueness of left Haar measure up to scale

Statement

Assume AC. Any two left Haar measures on an LCH group are positive scalar multiples on every Borel set.

Facts & Assumptions

Given: Left Haar measures μ,ν on G, and AC.

[F1]

For the associated functionals, symmetric small-support functions make the comparison error arbitrarily small and have positive integrals. (Haar integral comparison inequality)

[F2]

Equality on Cc integrals identifies Radon measures on the Borel sigma algebra. (Assuming Dependent Choice, uniqueness of the RMK representing measure among Radon measures)

[F3]

Under DC, a compact set inside an open set admits a compactly supported cutoff that is one on the compact set. (LCH Urysohn cutoff)

[F4]

Given a set A, an element a∈A and a function f:A→A, recursion gives g:N→A with g(0)=a and g(n+1)=f(g(n)). (The recursion theorem)

[A1]

AC is assumed in the choice-function form stated in the cited definition. (The Axiom of Choice)

Proof

technique · direct
1.1F1F3F4A1

First discharge the dependent-choice hypothesis of [F3] directly. For any set A, a prescribed a∈A, and a relation R⊆A×A with every successor set R[x]={y∈A:xRy} nonempty, [A1] chooses one member of each set in {R[x]:x∈A}. Composing this choice function with x↦R[x] gives f:A→A with xRf(x). By [F4], g(0)=a and g(n+1)=f(g(n)) define an infinite R-chain. This proves exactly the required dependent-choice principle, including the prescribed starting point. Now let I(f)=∫f dμ and J(f)=∫f dν. Compact finiteness makes these real-valued on real Cc. They are positive and invariant. They are nonzero: for each measure, nonzeroness and outer regularity give an open set of positive mass, open inner regularity gives a compact subset of positive mass, and [F3] gives a cutoff dominating its indicator. Use one such nonzero cutoff as f0; strict positivity in [F1] gives I(f0),J(f0)>0.

2.1F1step 1.1

Fix f≥0 and ϵ>0. Choose the same symmetric u so the [F1] bounds for f and f0 are both at most ϵ, using the intersection of their identity neighbourhoods. Divide by I(u)>0 and set r=J(u)/I(u). Then ∣rI(f)−J(f)∣≤ϵ and ∣rI(f0)−J(f0)∣≤ϵ. Multiplying by I(f0) and I(f) respectively and subtracting cancels r, giving ∣I(f0)J(f)−I(f)J(f0)∣≤ϵ(I(f0)+I(f)). Letting ϵ↓0 proves J(f)=cI(f) with c=J(f0)/I(f0)>0.

3.1F2step 2.1∎

For real h=h+−h−, linearity extends J=cI from the positive cone to all Cc(G;R). The measure cμ is Radon because scaling by a finite positive scalar preserves each regularity equality and compact finiteness. Therefore [F2] gives ν=cμ on all Borel sets, including those of infinite measure.

Sources

Pedersen, Haar integral, p.2 definitions and lemma; p.3 Theorem 1; pp.4–5 second proof and Remark 2. Local argument and conventions as displayed above.

Depends on

Dependency tree · 2 levels

Sources