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 candidate sets have the finite intersection property

Statement

Assume AC and fix 0≠f0∈Cc(G)+. Put P=∏0≠f∈Cc(G)+[1/(f0:f),(f:f0)]. For each open identity neighbourhood U, let EU be the closure in P of the vectors Iϕ with 0≠ϕ≥0 and supp⁡ϕ⊆U. These closed sets are nonempty and have the finite intersection property, and ⋂UEU≠∅. Every common point, extended by value zero at 0, is additive, positively homogeneous, strictly positive on nonzero nonnegative functions, normalized at f0, and left invariant.

Facts & Assumptions

Given: AC, f0, the product and closed candidate sets as stated.

[F1]

Approximant vectors obey closed coordinate bounds and the exact normalization, homogeneity and invariance equations. (Normalized approximate Haar functionals are positive and invariant in the limit)

[F2]

All sufficiently small-support approximants have arbitrarily small additivity error. (Haar covering functionals are asymptotically additive)

[F5]

Cutoffs at a compact singleton exist under DC. (LCH Urysohn cutoff)

[F6]

AC is assumed for the compact product and inherited cutoffs. (The Axiom of Choice)

Proof

technique · direct
1.1F1F5F6

For any U, a cutoff v at {e}⊆U has v(e)=1, 0≤v≤1U and compact support. Set ϕ=(v−1/2)+. Then ϕ(e)=1/2 and its support lies in the compact set {v≥1/2}⊆U. Thus EU contains an approximant. The coordinate intervals are nonempty because they contain every such vector, and they are finite closed real intervals.

2.1F3F4F6step 1.1

For finitely many neighbourhoods U1,…,Un, their intersection W is an identity neighbourhood, and EW⊆⋂jEUj. Step 1.1 makes this intersection nonempty. For n=0 the intersection is P, also nonempty by an approximant. The compact real intervals and AC give compactness of P, so the closed FIP theorem supplies a common point T.

3.1F1F2step 2.1∎

The closed equations in [F1] hold throughout each EU, hence for T, and its strictly positive coordinate lower bounds persist. Set T(0)=0. For f,g≥0 and ϵ>0, [F2] gives U such that 0≤Iϕ(f)+Iϕ(g)−Iϕ(f+g)<ϵ on its approximants. This finite-coordinate condition with upper bound ≤ϵ is closed, so it holds for T∈EU. An error in [0,ϵ] for every positive ϵ is zero. Thus T is additive; when an argument is zero this is already the assigned zero value.

Sources

Knapp, Advanced Real Analysis, VI §2, pp.225–230, Lemmas 6.9–6.13. Local argument and conventions as displayed above.

Depends on

Dependency tree · 2 levels

Sources