Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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.

The L1 involution is isometric, involutive and reverses convolution

Statement

Assume AC. Let G be an LCH group with a fixed left Haar measure μ. The involution f↦f∗ of L1(G) (Involution on L1 of a locally compact group) is conjugate-linear and isometric, satisfies (f∗)∗=f for every f∈L1(G), and reverses convolution, (f∗g)∗=g∗∗f∗(f,g∈L1(G)), with ∗ the convolution of Convolution on L1 of a locally compact group.

Facts & Assumptions

Given: An LCH group G with a fixed left Haar measure μ, the modular function ΔG, the complex space L1(G) with norm ∥⋅∥1, and AC.

[F1]

The involution is f∗(x)=ΔG(x−1)f(x−1)‾, defined on classes and independent of the representative, with ∥f∗∥1=∥f∥1 (Involution on L1 of a locally compact group).

[F2]

ΔG is a continuous homomorphism into R>0, so ΔG(y−1)ΔG(x−1y)=ΔG(x−1) for all x,y∈G and ΔG(x)ΔG(x−1)=1 (The modular function is a continuous homomorphism).

[F3]

For every nonnegative Borel H one has ∫GH(x−1) dμ(x)=∫GΔG(x−1)H(x) dμ(x) (Haar change of variables under inversion).

[F4]

μ is left invariant: μ(xE)=μ(E) for every Borel set E and every x∈G (Left Haar integral and left Haar measure).

[F5]

On Cc(G) convolution is (f∗g)(x)=∫Gf(y)g(y−1x) dμ(y), with f∗g∈Cc(G) (Compactly supported convolution on a group, Convolution preserves compact support and is associative).

[F6]

The L1 convolution of Convolution on L1 of a locally compact group is the unique C-bilinear extension of the Cc convolution satisfying ∥f∗g∥1≤∥f∥1∥g∥1, hence jointly continuous (Convolution on L1 of a locally compact group, Submultiplicativity of convolution in the L1 norm).

[F8]

Inversion inv⁡(x)=x−1 is a homeomorphism of G, hence carries compact sets to compact sets; ΔG∘inv⁡ is continuous (Left and right translations and inversion in a topological group are homeomorphisms, The modular function is a continuous homomorphism).

[A1]

AC is assumed in the choice-function form of the cited definition, inherited here from the Haar and modular interfaces (The Axiom of Choice).

Proof

technique · direct
1.1

Conjugate-linearity. Let f,g∈L1(G) and α,β∈C. For every x the defining formula of [F1] gives (αf+βg)∗(x)=ΔG(x−1)αf(x−1)+βg(x−1)‾=α‾f∗(x)+β‾g∗(x), as conjugation is additive and αβ‾=α‾β‾; since the identity holds pointwise it holds for the classes, so (αf+βg)∗=α‾f∗+β‾g∗.

F1
1.2

Isometry. For f∈L1(G) the modulus of f∗ is ∣f∗(x)∣=ΔG(x−1)∣f(x−1)∣, the factor being positive. Apply the change of variables [F3] (whose choice hypothesis is discharged by [A1]) to the nonnegative Borel function H(t):=ΔG(t)∣f(t)∣. Then ∫G∣f∗∣ dμ=∫GH(x−1) dμ(x)=∫GΔG(x−1)H(x) dμ(x)=∫G∣f∣ dμ, using ΔG(x−1)ΔG(x)=1. Hence ∥f∗∥1=∥f∥1.

A1F1F3
1.3

Involutivity. For f∈L1(G) and x∈G, the definition gives (f∗)∗(x)=ΔG(x−1)f∗(x−1)‾=ΔG(x−1)ΔG(x)f(x)‾‾=ΔG(x−1)ΔG(x)f(x)=f(x), where ΔG is real-valued and ΔG(x)ΔG(x−1)=1 by [F2]; hence (f∗)∗=f.

F1F2
1.4

The involution preserves Cc(G). If f∈Cc(G) then f∗ is continuous by [F1] and [F8], and its support is supp⁡(f∗)=inv⁡(supp⁡f), a compact set because inv⁡ is a homeomorphism and continuous images of compact sets are compact; thus f∗∈Cc(G).

F1F8
1.5

Anti-multiplicativity on Cc(G). Let f,g∈Cc(G) and x∈G. By [F5] and [F1], (f∗g)∗(x)=ΔG(x−1)∫Gf(y)g(y−1x−1) dμ(y)‾=ΔG(x−1)∫Gf(y)‾ g(y−1x−1)‾ dμ(y), conjugation being continuous. In the other order, [F5] and [F1] give (g∗∗f∗)(x)=∫Gg∗(y)f∗(y−1x) dμ(y)=∫GΔG(y−1)ΔG(x−1y)g(y−1)‾ f(x−1y)‾ dμ(y)=ΔG(x−1)∫Gg(y−1)‾ f(x−1y)‾ dμ(y), where [F2] computes ΔG(y−1)ΔG(x−1y)=ΔG(y−1x−1y)=ΔG(x−1). Substituting y=xu in this last integral and using left invariance [F4] turns it into ΔG(x−1)∫Gg(u−1x−1)‾f(u)‾ dμ(u), which is the first expression with the order of the two factors interchanged. Hence (f∗g)∗(x)=(g∗∗f∗)(x) for every x, so (f∗g)∗=g∗∗f∗ for f,g∈Cc(G).

F1F2F4F5
2.1

Anti-multiplicativity on L1(G). Fix F,G∈L1(G) and choose fn,gn∈Cc(G) with fn→F and gn→G in ∥⋅∥1, possible by [F7]. By step 1.5, (fn∗gn)∗=gn∗∗fn∗ for every n. The left side converges to (F∗G)∗: indeed fn∗gn→F∗G by joint continuity of the extension [F6], and the involution is isometric by step 1.2, hence norm continuous. The right side converges to G∗∗F∗ by joint continuity [F6] applied to gn∗→G∗ and fn∗→F∗, again by step 1.2. Since limits in the normed space L1(G) are unique, (F∗G)∗=G∗∗F∗.

F6F7step 1.2step 1.5
3.1

Concatenating: step 1.1 gives conjugate-linearity, step 1.2 isometry, step 1.3 involutivity and step 2.1 the reversal property, for all f,g∈L1(G). ∎

step 1.1step 1.2step 1.3step 2.1

Remarks

  • Where the modular factor is used. The factor ΔG(x−1) enters through [F1] in steps 1.2, 1.3 and 2.1; the multiplicativity in step 2.1 is exactly the computation ΔG(y−1)ΔG(x−1y)=ΔG(x−1), which is where a naive involution without ΔG would fail (Naive inversion is not the L1 involution on a nonunimodular group ↗).
  • Choice cost. [A1] is inherited from the Haar measure and modular function used in [F1]; the algebraic computations of this proof spend no further choice.

Depends on

Used by

Dependency tree · two levels

46 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