Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

L1 of a second-countable locally compact group is separable

Statement

Assume the Axiom of Choice. Let G be a second-countable locally compact Hausdorff group with a fixed left Haar measure μ (Second countability: an at most countable basis for the topology, Left Haar integral and left Haar measure, Complex Haar L^p spaces and compactly supported functions). Then L1(G,μ;C) is a separable Banach space. There is a countable Borel algebra A0 generating the Borel sigma-algebra of G such that the Q(i)-linear span of {1A:A∈A0, μ(A)<∞} is dense in L1(G). Moreover, the image of Cc(G;C) in L1(G) contains a countable dense subset.

Facts & Assumptions

Given: AC, a second-countable locally compact Hausdorff group G, and a fixed left Haar measure μ.

[F1]

The left Haar measure is a Radon Borel measure and is finite on compact sets; Cc(G;C)⊆L1(G) is dense, and L1(G) is complete under AC (Left Haar integral and left Haar measure, Measures on sigma-algebras, Complex Haar L^p spaces and compactly supported functions, Compact support, Cc(X), and C0(X), Completeness of the complex Haar L1 and L2 spaces and density of Cc).

[F5]

For every ϵ>0 there is a natural k≥1 with 1/k<ϵ (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε). Q is countable and dense in R. Every z∈C has unique coordinates z=a+bi and ∣z∣=a2+b2. Hence Q(i)={q+ir:q,r∈Q} is countable, and it is dense in C: approximate a,b separately within ϵ/3 by rationals, giving ∣(a−q)+i(b−r)∣≤∣a−q∣+∣b−r∣<ϵ (The rationals as equivalence classes of pairs of integers, The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i, C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2), Real and imaginary parts, complex conjugation, and modulus, Q is countably infinite, A product of two at most countable sets is at most countable, A nonempty set is at most countable iff it is a surjective image of N, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

[F6]

AC implies DC and therefore Countable Choice; finite choices from a listed finite family of nonempty sets are provable in ZF (The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice (ACω), Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[F7]

Measures are monotone, nonnegative integrals preserve pointwise order and nonnegative scalar multiplication, and the integral of c1E is cμ(E) for a measurable set E and c≥0, by the simple-integral definition. Measurable functions are closed under subtraction and modulus (Measures are monotone, Measures on sigma-algebras, Nonnegative simple measurable functions, The integral of a nonnegative simple function, Monotonicity and nonnegative homogeneity of the nonnegative integral, Closure properties of measurable functions used by the integral, Integrable real and complex functions, and their integrals).

[F8]

Proof

technique · direct
1.1F2F6

Let B be an at most countable basis for G. The relatively compact open sets form a basis by [F2], so the family of all relatively compact open sets covers G. By Lindelofness and AC's implication of Countable Choice in [F6], it has an at most countable subcover; enumerate that nonempty subcover as (Vn)n∈N, repeating terms if it is finite.

2.1F1F3step 1.1

Put Kn=⋃j≤nVj‾. Each closure is compact; an ambient open cover of Kn has a finite subcover on each of the finitely many closures by [F3], and their finite union covers Kn. Thus Kn is compact, and it is closed and Borel because G is Hausdorff. The sequence increases and covers G. If f∈Cc(G), compactness of supp⁡f gives a finite subcover from (Vn); taking the largest index in that subcover (or n=0 for empty support) shows supp⁡f⊆Kn for some n. Each Kn has finite Haar measure by [F1].

3.1F1F2F4F8step 2.1

The family G=B∪{Kn:n∈N} is countable by [F4]. Set A0 specifically to the algebra of finite Boolean combinations of G. As in the countable-algebra supplier proof in [F4], enumerate G and let Cm be the finite algebra generated by its first m terms. Then A0=⋃mCm: every finite Boolean combination uses some finite prefix. These algebras increase, so their union is an algebra, and [F4] makes it countable. Its generators are Borel, and finite Boolean operations preserve Borel sets, so every member of A0 is Borel. Every open set is a union of basis members, and because B is countable this is a countable union; therefore σ(A0) contains every open set. Conversely A0 consists of Borel sets, so minimality in [F8] gives σ(A0)=B(G). Each Kn∈A0 and has finite measure by step 2.1.

4.1F1F3F5F6F7step 2.1step 3.1

Fix f∈Cc(G) and a target η>0, and choose n with supp⁡f⊆Kn by step 2.1. If μ(Kn)=0, then f is zero as an L1 class because it vanishes outside the null set Kn; the zero function is in the required span since ∅∈A0. Otherwise set δ=η/(4μ(Kn)). Let Uδ be the family of all U∈B for which there exists x∈Kn such that ∣f(y)−f(x)∣<δ for every y∈U. Continuity and the basis property show that Uδ covers Kn; compactness gives a finite subcover U1,…,Um. For each i, choose a witness xi∈Kn for its defining property, and set E1=Kn∩U1 and Ei=(Kn∩Ui)∖⋃j<iUj for i>1. These sets partition Kn, belong to A0, and have finite measure by [F7]. For each nonempty Ei, choose yi∈Ei and qi∈Q(i) with ∣qi−f(yi)∣<δ; these are finitely many choices, justified by [F6] and density in [F5]. Then g=∑i:Ei≠∅qi1Ei lies in the required span and in L1, since it is measurable and bounded with support in the finite-measure set Kn. For y∈Ei, ∣f(y)−f(yi)∣<2δ, hence ∣f(y)−g(y)∣<3δ; outside Kn both functions vanish. Thus ∣f−g∣≤3δ1Kn and [F7] gives ∥f−g∥1≤3δμ(Kn)=3η/4<η.

5.1F1F4F5F6step 3.1step 4.1

Let E={A∈A0:μ(A)<∞} and let D0 consist of all finite Q(i)-linear combinations of 1A with A∈E. The family E is countable as a subset of A0; the alphabet C=Q(i)×E is at most countable by [F4,F5]. Every finite power Cm, including the one-point C0, is at most countable by [F4]. AC gives Countable Choice by [F6], so [F4] makes ⋃m∈NCm, the set of finite lists of coefficient/set pairs, at most countable. Its image under the finite-sum map is D0, so D0 is countable. Each generator indicator is integrable because its set has finite measure, and finite linear combinations remain in L1. For h∈L1(G) and ϵ>0, choose f∈Cc(G) with ∥h−f∥1<ϵ/2 by [F1], then choose d∈D0 with ∥f−d∥1<ϵ/2 by step 4.1. The triangle inequality gives ∥h−d∥1<ϵ, so D0 is dense in L1(G).

6.1F1F4F5F6step 5.1

The set D0×N>0 is countable by [F4]. For each (d,k) in it, density of Cc(G) in L1(G) gives a nonempty set of c∈Cc(G) with ∥c−d∥1<1/k. AC's implication of Countable Choice [F6] selects one such cd,k for every pair. The resulting set of functions is countable; for any h∈L1(G) and ϵ>0, choose d∈D0 with ∥h−d∥1<ϵ/2 and then k with 1/k<ϵ/2. It follows that ∥h−cd,k∥1<ϵ, so their image in L1(G) is a countable dense subset contained in the image of Cc(G).

7.1F1step 3.1step 5.1step 6.1∎

Step 5.1 proves separability of L1(G), and [F1] gives its completeness, so it is a separable Banach space. Steps 3.1 and 5.1 give the asserted generating Borel algebra and dense Q(i)-linear span, while step 6.1 gives the countable dense subset from Cc(G).

Depends on

Used by

Dependency tree · two levels

122 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