Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Haar covering ratios are finite and positive

Statement

For f≥0 and 0≠ϕ≥0 in Cc(G), (f:ϕ) is finite, is zero exactly when f=0, and is at least ∥f∥∞/∥ϕ∥∞. Covering ratios are monotone in the first argument, positively homogeneous there (including scalar zero), subadditive, and exactly left invariant. For nonzero ϕ,ψ, (f:ψ)≤(f:ϕ)(ϕ:ψ). Consequently, for fixed nonzero f0≥0 and nonzero f≥0, 0<1(f0:f)≤Iϕ(f)≤(f:f0)<∞.

Facts & Assumptions

Given: f,ϕ,ψ,f0 as stated.

[F1]

Ratios are infima of coefficient sums of finite translating covers. (Haar covering ratio of test functions)

[F3]

Compact sets admit finite subcovers; equivalently they satisfy the closed FIP condition. (A space is compact exactly when every family of closed subsets with the finite intersection property has nonempty intersection)

Proof

technique · direct
1.1F1F2F3

If f=0, the empty cover gives ratio zero. Otherwise put M=∥f∥∞>0. Choose y with ϕ(y)>0 and 0<t<ϕ(y). The open set W={ϕ>t} contains y. For every x∈supp⁡f, the translate xy−1W contains x. Finitely many such translates cover the compact support, and coefficients M/t on them dominate f, so the infimum is finite.

2.1F1F2step 1.1

Every cover satisfies f(x)≤∥ϕ∥∞∑cj for every x. Taking the supremum and then the infimum yields (f:ϕ)≥∥f∥∞/∥ϕ∥∞>0 when f≠0. In particular the normalizing denominator is finite and positive.

2.2F1step 1.1

A cover of a larger function covers a smaller one. Multiplying coefficients by t>0 and dividing them back by t proves (tf:ϕ)=t(f:ϕ); scalar zero follows from the empty cover. Combining covers of f and g and taking independently arbitrarily close upper approximations to the two infima gives (f+g:ϕ)≤(f:ϕ)+(g:ϕ). Translating a cover by a replaces each centre xj by axj; translation by a−1 reverses this operation. Thus (Laf:ϕ)=(f:ϕ).

3.1F1step 1.1step 2.1∎

If f≤∑jcjLxjϕ and ϕ≤∑kdkLykψ, substitution gives f≤∑j,kcjdkLxjykψ. Choose the two coefficient sums below their finite infima plus δ>0 and let δ↓0. Their product proves the claimed composition inequality, also for f=0. Applying it to (f,f0,ϕ) gives the upper coordinate bound. Applying it to (f0,f,ϕ) and dividing the positive factors gives the lower bound.

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