Alphabeta Math
TheoremStatement: 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.

Existence of a left Haar integral

Statement

Assume AC. Every LCH group admits a nonzero positive left-invariant real-linear functional on Cc(G;R) and its complex-linear extension on Cc(G;C).

Facts & Assumptions

Given: An LCH group and AC.

[F1]

The target is a nonzero positive invariant real-linear functional. (Left Haar integral and left Haar measure)

[F2]

A nonnegative cutoff f0≠0 and a common point T give an additive homogeneous positive-cone functional with T(f0)=1. (Haar candidate sets have the finite intersection property)

[A1]

AC is assumed in the choice-function form stated in the cited definition. (The Axiom of Choice)

Proof

technique · direct
1.1F2A1

Take a nonzero nonnegative cutoff at the identity and a common point T from [F2]. That lemma gives T(u+v)=T(u)+T(v) for all nonnegative u,v; it is positively homogeneous, invariant, and T(f0)=1.

2.1step 1.1

Every real f∈Cc(G) is u−v with u=f+ and v=f−. Define I(f)=T(u)−T(v). If also f=u′−v′ with nonnegative terms, then u+v′=u′+v, so additivity gives T(u)−T(v)=T(u′)−T(v′). The value is independent of the decomposition.

3.1F1step 1.1step 2.1∎

Adding decompositions and multiplying them by a nonnegative scalar proves additivity and positive homogeneity of I; exchanging their terms gives I(−f)=−I(f), hence real linearity. For f≥0 use f−0 to obtain I(f)=T(f)≥0. Translating both nonnegative terms gives I(Laf)=I(f); I(f0)=1 makes I nonzero. Finally IC(u+iv)=I(u)+iI(v) is well-defined by unique real and imaginary parts, and IC(i(u+iv))=−I(v)+iI(u)=iIC(u+iv) proves complex linearity together with real linearity.

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