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.
Haar covering functionals are asymptotically additive
Statement
Assume AC. For , and , there is an open identity neighbourhood such that every supported in satisfies .
Facts & Assumptions
Given: AC and the functions and error tolerance in the statement.
Right translations of each compactly supported continuous function converge uniformly to it at the identity. (Translations preserve compactly supported continuous functions)
Ratios are subadditive and homogeneous and . (Haar covering ratios are finite and positive)
Under DC a compact set has a compactly supported nonnegative cutoff equal to one on it. (LCH Urysohn cutoff)
AC supplies the inherited cutoff choices. (The Axiom of Choice)
Proof
If either , the error is zero. Otherwise set , choose compactly supported with on , and put , . Choose , then . Thus . AC implies the DC used for the cutoff.
Put and where , and zero elsewhere. On , ; a point where is outside that closed support and has a neighbourhood where . Hence is continuous, supported in , and . Choose so for all , both , and , using uniform right-translation continuity.
For a finite cover , a nonzero term at has . Consequently and . These coefficients are positive. The sum of the two coefficient sums is at most . Taking the infimum over covers of , then dividing by , gives .
Subtracting and using the coordinate bounds yields an upper error at most . Subadditivity gives its nonnegativity. The choices of preceded , so the bound holds uniformly for every allowed test function.
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
Dependency tree · two levels
13 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)