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.
Normalized Haar measure on a finite group
Example
Assume AC. For a finite group of order , the normalized Haar probability is , and . It is invariant on both sides and under inversion.
Facts & Assumptions
Given: A finite group of order , with AC for the cited general uniqueness theorem.
A compact Hausdorff group has a unique normalized Haar probability under AC. (Normalized Haar probability on a compact group)
Counting measure on a discrete group is Haar and its integrals are finite sums. (Counting measure as Haar measure on a discrete group)
AC is assumed in the choice-function form stated in the cited definition; the explicit finite formula itself uses no choice. (The Axiom of Choice)
Verification
With the discrete topology is compact and Hausdorff: its singleton sets are open, and finitely many of them cover . Counting measure has total mass , so dividing by gives the stated Haar probability by [F2]. Left multiplication, right multiplication and inversion each permute the summands; hence their pullbacks preserve the displayed average. Under the assumed AC, [F1] identifies this probability with the general normalized Haar probability.
For , take , , . Then . Left or right translation by and inversion only rearrange these three values, so their integrals remain . For the formula is evaluation at the identity, and for it is zero.
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
8 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)