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 as Haar measure on rn
Example
Assume AC and . Lebesgue measure restricted to the Borel sets of is a left and right Haar measure. All its Haar measures are positive multiples of Lebesgue measure, and the normalization singles out Lebesgue measure.
Facts & Assumptions
Given: and AC.
The Haar requirements are invariance, nonzeroness, compact finiteness and Radon regularity. (Left Haar integral and left Haar measure)
Haar measures are positive scalar multiples. (Uniqueness of left Haar measure up to scale)
Lebesgue measure is Radon under countable choice. (Lebesgue measure is a Radon measure on R^n)
AC supplies countable choice and the uniqueness construction. (The Axiom of Choice)
Lebesgue measure is translation invariant on measurable sets. (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation)
Verification
Euclidean addition and negation are continuous; closed bounded cubes give compact neighbourhoods and the Euclidean metric is Hausdorff. By [F3], AC makes the Borel restriction of Lebesgue measure Radon. For a box , its defining volume is ; in particular , so the measure is nonzero.
[F5] gives for every Borel and every . Addition is commutative, so this is both left and right invariance. Thus [F1] identifies it as Haar, and [F2] gives for any Haar measure. On the unit cube , forcing under the specified normalization. As an explicit translation calculation, .
Sources
Knapp, Advanced Real Analysis, VI §2, pp.225–230, Lemmas 6.9–6.13. Local argument and conventions as displayed above.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
31 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
- Knapp, Advanced Real Analysis, VI §2, pp.225–230, Lemmas 6.9–6.13 (standard reference, not scraped)