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

Well-definedness of the full group C star norm and its zero ideal

Statement

Assume the Axiom of Choice. Let G be an LCH group and define the local function pG(f):=sup⁡π∥π(f)∥(f∈L1(G)), where one may take the set of GNS representations indexed by P1(G); this gives the same supremum as testing all strongly continuous unitary representations. In this lemma write ∥f∥C∗:=pG(f). Then ∥f∥C∗≤∥f∥1<∞ for all f, so the supremum is finite; ∥⋅∥C∗ is a submultiplicative ∗-seminorm on L1(G); the set N={f:∥f∥C∗=0} is a closed two-sided ∗-ideal; and the completion of L1(G)/N in the induced norm is a C*-algebra in which ∥a∗a∥=∥a∥2.

Facts & Assumptions

Given: AC; an LCH group G with fixed left Haar measure; the seminorm ∥⋅∥C∗ defined as the supremum of operator norms of integrated forms.

[F1]

For every unitary representation π, the integrated form is complex-linear, multiplicative, star-preserving and contractive: π(f∗h)=π(f)π(h), π(f∗)=π(f)∗ and ∥π(f)∥≤∥f∥1 (Integrated forms are contractive nondegenerate star representations of L one).

[F2]

B(H) is a C*-algebra: ∥T∗T∥=∥T∥2 and ∥T∗∥=∥T∥ for every bounded operator T (Bounded Hilbert operators form a C star algebra).

[F3]

L1(G) is a Banach ∗-algebra with ∥f∗h∥1≤∥f∥1∥h∥1 and ∥f∗∥1=∥f∥1 (L1 of a locally compact group is a Banach star-algebra, Banach star-algebra without a required unit).

[F4]

Under Countable Choice, every metric space has a completion given by equivalence classes of Cauchy sequences, with distance the limit of the distances of representatives and a dense isometric embedding by constant sequences (Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences). AC supplies this assumption. The defining algebraic and norm conditions of a C*-algebra are those of C star algebra.

[F5]

Normalized positive-type functions form the set P1(G)⊆CG, and their GNS triples are exactly the pointed cyclic representations with a unit cyclic vector (GNS construction for a continuous positive-type function, Normalized positive type and pointed cyclic unitary representations). Under AC every closed Hilbert subspace has its orthogonal decomposition (Orthogonal decomposition by a closed subspace).

Proof

technique · direct

Given: AC, an LCH group G, and the seminorm ∥f∥C∗=sup⁡π∥π(f)∥.

1.1F1F5

The universal supremum is set-sized. Given a representation π and a unit vector ξ, its cyclic subspace M=span⁡‾{π(g)ξ:g∈G} is invariant. Its orthogonal complement is invariant as well, because π is unitary, so its projection commutes with every π(g). The weak integral identity then shows that π(f)M⊆M. By [F5] the restricted pointed representation is equivalent to the GNS triple of its normalized coefficient in P1(G). Thus ∥π(f)ξ∥ is bounded by the supremum of the integrated norms of these GNS representations. Taking the supremum over unit vectors, and observing that every GNS representation is itself eligible, proves equality with the universal supremum. The zero representation contributes only zero, and P1(G) is nonempty because it contains the constant function 1.

1.2F1F2

∥⋅∥C∗ is a finite submultiplicative ∗-seminorm on L1(G): for each f, F1 gives ∥π(f)∥≤∥f∥1 for every π, so ∥f∥C∗≤∥f∥1<∞; ∥αf∥C∗=∣α∣∥f∥C∗ by linearity; ∥f+h∥C∗≤∥f∥C∗+∥h∥C∗ by the operator triangle inequality before taking the supremum; N contains 0; for f,h∈L1(G) and each π, ∥π(f∗h)∥=∥π(f)π(h)∥≤∥π(f)∥ ∥π(h)∥≤∥f∥C∗∥h∥C∗, so ∥f∗h∥C∗≤∥f∥C∗∥h∥C∗; and ∥f∗∥C∗=sup⁡π∥π(f)∗∥=sup⁡π∥π(f)∥=∥f∥C∗ by F1 and F2.

2.1F3step 1.2

N={f:∥f∥C∗=0} is a closed two-sided ∗-ideal of L1(G): it is a linear subspace by the seminorm identities, and it is closed in the L1 norm because ∣∥f∥C∗−∥h∥C∗∣≤∥f−h∥C∗≤∥f−h∥1; if f∈N and h∈L1(G) then step 1.2 gives ∥f∗h∥C∗≤∥f∥C∗∥h∥C∗=0 and ∥h∗f∥C∗≤∥h∥C∗∥f∥C∗=0, so N is a two-sided ideal; and f∈N implies ∥f∗∥C∗=∥f∥C∗=0, so N is a ∗-ideal. Hence L1(G)/N is a normed ∗-algebra with the induced norm and involution.

3.1F1F2step 2.1

The C*-identity holds on L1(G) and descends to the quotient: for every f, ∥f∗∗f∥C∗=sup⁡π∥π(f)∗π(f)∥=sup⁡π∥π(f)∥2=∥f∥C∗2, using multiplicativity, π(f∗)=π(f)∗ F1 and the C*-identity in B(H) F2; in particular ∥[f]∗[f]∥=∥[f]∥2 for the coset [f] in L1(G)/N.

4.1F4step 1.2step 2.1step 3.1

Put B=L1(G)/N with its induced norm. Apply F4 to its norm metric, and define addition, scalar multiplication, multiplication and involution on Cauchy-sequence classes termwise. These operations are well defined: Cauchy sequences are bounded, and ∥xnyn−xmym∥≤∥xn∥ ∥yn−ym∥+∥xn−xm∥ ∥ym∥ shows that products are Cauchy; the same estimate for equivalent representatives shows independence of representatives. The isometry of the involution from step 1.2 gives both its preservation of Cauchy sequences and independence of representatives; addition and scalar multiplication follow from their norm inequalities. The norm is ∥[xn]∥=lim⁡n∥xn∥, so submultiplicativity passes to the limit, as do the vector-space and star-algebra identities. Thus the complete metric space is a Banach ∗-algebra with dense isometric copy of B. Finally step 3.1 gives ∥[xn]∗[xn]∥=lim⁡n∥xn∗xn∥=lim⁡n∥xn∥2=∥[xn]∥2. This is a C*-algebra by F4.

5.1givenF1∎

The Axiom of Choice is inherited from the integrated-form and completion suppliers of F1–F4, as declared in the definition of the universal seminorm (The Axiom of Choice).

Depends on

Used by

Dependency tree · two levels

76 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