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 approximate Haar functionals are positive and invariant in the limit
Statement
Fix . Every , for , is nonnegative, strictly positive on nonzero arguments, positively homogeneous, exactly left invariant and satisfies . It is subadditive and obeys the coordinate bounds for , independently of . Any coordinatewise limit obeys these same conditions, with value zero at . Additivity is not asserted for the approximants.
Facts & Assumptions
Given: nonzero and nonnegative; .
Ratios have finite positive denominators, homogeneity, invariance, subadditivity and the displayed coordinate bounds. (Haar covering ratios are finite and positive)
Proof
Dividing the numerator identities and inequalities by gives for , and subadditivity. The numerator at equals the denominator, hence ; the zero numerator gives .
For each nonzero the two finite bounds in [F1] are independent of , and the lower bound is strictly positive. Each normalization, invariance or homogeneity equation involves finitely many coordinates and defines a closed subset of the real product; each inequality does too. Therefore every coordinatewise limit stays in these sets and retains the stated bounds and properties.
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
Used by
Dependency tree · two levels
4 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
- Pedersen, Haar integral, p.2 definitions and lemma; p.3 Theorem 1; pp.4–5 second proof and Remark 2 (standard reference, not scraped)