Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 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.

Convolution of matrix coefficients on a compact group

Example

Assume the Axiom of Choice. Let G be a compact Hausdorff group with its normalized Haar probability measure μ (Normalized Haar probability on a compact group). Then the constant function 1 satisfies 1∗1=1. Moreover, for continuous finite-dimensional irreducible unitary representations π on V and σ on W of G (Subrepresentations, direct sums of representations, and irreducibility) with first-variable-linear coefficients fu,vπ(x):=⟨π(x)u,v⟩(u,v∈V),fw,zσ(x):=⟨σ(x)w,z⟩(w,z∈W), the convolution of coefficients is zero when π≇σ. If they are equivalent, choose any unitary intertwiner T:W→V satisfying Tσ(x)=π(x)T. Then fu,vπ∗fw,zσ=⟨u,Tz⟩dim⁡π fTw,vπ. This formula is independent of the choice of T. When σ=π on the same space, one may take T=IV.

Facts & Assumptions

Given: A compact Hausdorff group G with its normalized Haar probability measure μ, continuous finite-dimensional irreducible unitary representations π on V and σ on W, and AC.

[F1]

A compact Hausdorff group has a left Haar probability measure, and that measure is right invariant; a compact group is unimodular, so ΔG≡1 and inversion preserves μ (Normalized Haar probability on a compact group, Compact, discrete and abelian groups are unimodular, Unimodular locally compact group, Haar change of variables under inversion).

[F2]

For f,g∈Cc(G) convolution is (f∗g)(x)=∫Gf(y)g(y−1x) dμ(y), and convolution on L1(G) is the unique C-bilinear extension with ∥f∗g∥1≤∥f∥1∥g∥1, jointly continuous and agreeing with the Cc formula (Compactly supported convolution on a group, Convolution on L1 of a locally compact group, Submultiplicativity of convolution in the L1 norm).

[F3]

Cc(G) is dense in L1(G) and in L2(G); on the probability space G one has ∥h∥1≤∥h∥2 for h∈L2(G), and Lp(G)=Lp(G,μ;C) with ∥h∥p=(∫G∣h∣p dμ)1/p (Completeness of the complex Haar L1 and L2 spaces and density of Cc, Complex Haar L^p spaces and compactly supported functions).

[F4]

L2(G) carries the first-variable-linear inner product ⟨h,k⟩=∫Ghk‾ dμ, whose induced norm is ∥⋅∥2 (The complex L2 pairing on equivalence classes).

[F5]

Left and modular right translations are strongly continuous on L2(G); since ΔG≡1 here, the plain right translation h↦h(⋅ g) is strongly continuous (Strong continuity of left and modular right translations on L1 and L2, [F1]).

[F6]

A subrepresentation of a finite-dimensional representation is a linear subspace carried into itself by every ρ(g), and irreducibility means the nonzero space has no proper nonzero subrepresentation; an intertwiner is a linear map with fρ(g)=σ(g)f for all g, and equivalence means the existence of an invertible intertwiner (Subrepresentations, direct sums of representations, and irreducibility, Intertwiners, the spaces Hom⁡G(V,W) and End⁡G(V), equivalent representations, and faithful representations, A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree).

[F7]

Every endomorphism of a nonzero finite-dimensional complex vector space has an eigenvalue in C (Every endomorphism of a nonzero finite-dimensional vector space over an algebraically closed field has an eigenvalue).

[F8]

For a continuous finite-dimensional irreducible unitary representation the coefficient fu,vπ(x)=⟨π(x)u,v⟩ is continuous because x↦π(x)u and the inner product are continuous, and ∣fu,vπ(x)∣≤∥u∥∥v∥ by Cauchy–Schwarz and unitarity, so it lies in L1(G) and L2(G) because μ is a probability measure.

[A1]

AC is assumed in the choice-function form of the cited definition; it is inherited from the Haar-measure, completeness and strong-continuity suppliers [F1], [F3] and [F5], and is first used in step 1.1 through [F3] (The Axiom of Choice).

Verification

technique · direct
1.1

Coefficients are square integrable. By [F8] each coefficient fu,vπ and fw,zσ is continuous with ∣fu,vπ∣≤∥u∥∥v∥ and ∣fw,zσ∣≤∥w∥∥z∥, so both lie in L∞(G)⊆L2(G) with ∥fu,vπ∥2,∥fw,zσ∥2<∞ because μ is a probability measure; the description of L2(G) used here is the one of [F3], available under the AC of [A1].

A1F3F8
1.2

The integral formula computes convolution for L2-functions. Let f,g∈L2(G) and put h(x):=∫Gf(y)g(y−1x) dμ(y). For each x the integral converges absolutely with ∣h(x)∣≤∥f∥2∥g∥2 by Cauchy–Schwarz [F4]. The function h is continuous: for x,x0∈G, Cauchy–Schwarz and the measure-preserving substitution y↦w=y−1x0 (measure preserving by the unimodularity and inversion invariance of [F1]) give ∣h(x)−h(x0)∣≤∥f∥2 ∥g(⋅ x0−1x)−g∥2→0 as x→x0 by strong continuity of right translation [F5]. Also ∥h∥2≤∥f∥2∥g∥2: the pointwise Cauchy–Schwarz bound and μ(G)=1 give ∫G∣h(x)∣2dμ(x)≤∫G(∫G∣f(y)∣2dμ(y))(∫G∣g(y−1x)∣2dμ(y))dμ(x)=∥f∥22∥g∥22 by left invariance of μ [F1]. Finally, on Cc(G)×Cc(G) the map (f,g)↦h is the Cc convolution by [F2], and both (f,g)↦h and the L1 convolution are continuous bilinear maps from L2(G)×L2(G) into L1(G): the first because ∥h∥1≤∥h∥2≤∥f∥2∥g∥2, the second because ∥f∗g∥1≤∥f∥1∥g∥1≤∥f∥2∥g∥2, using ∥t∥1≤∥t∥2 on the probability space G and [F2], [F3]; so density of Cc(G) in L2(G) [F3] forces h=f∗g for all f,g∈L2(G).

F1F2F3F4F5
1.3

The averaged operator. Define A:W→V by A(ξ):=∫G⟨σ(y)−1ξ,z⟩ π(y)u dμ(y), the integral being computed componentwise in a basis of V; the integrand is continuous on the compact group, so the integral exists and A is linear in ξ. Then A intertwines σ with π: for g∈G and ξ∈W, substituting y=gy′ and using invariance of μ gives A(σ(g)ξ)=∫G⟨σ(y)−1σ(g)ξ,z⟩π(y)u dμ(y)=∫G⟨σ(g−1y)−1ξ,z⟩π(y)u dμ(y)=∫G⟨σ(y′)−1ξ,z⟩π(gy′)u dμ(y′)=π(g)A(ξ), using σ(y)−1σ(g)=σ(y−1g) and the substitution y=gy′.

F1F6
2.1

The constant function. Since μ(G)=1 and 1∈L2(G) by [F3], the integral formula of step 1.2 gives (1∗1)(x)=∫G1 dμ=1 for every x, so 1∗1=1.

F1F3step 1.2
2.2

The product identity. For x∈G, the integral formula of step 1.2 applied to the coefficients of step 1.1 gives (fu,vπ∗fw,zσ)(x)=∫G⟨π(y)u,v⟩⟨σ(y−1x)w,z⟩ dμ(y)=⟨∫G⟨σ(y)−1σ(x)w,z⟩π(y)u dμ(y), v⟩, where the second equality uses σ(y−1x)=σ(y)−1σ(x) and the linearity of the inner product in its first variable; the right-hand side is ⟨A(σ(x)w),v⟩ with A as in step 1.3.

F4F6step 1.1step 1.2step 1.3
2.3

The trace of A in the case σ=π. Suppose σ is the same representation π on V, of dimension d, so that A is an endomorphism of V; write Ry(ξ):=⟨π(y)−1ξ,z⟩π(y)u=⟨ξ,π(y)z⟩π(y)u, a rank-one operator with tr⁡Ry=⟨π(y)u,π(y)z⟩=⟨u,z⟩ by unitarity of π(y). Integrating the traces, tr⁡A=∫G⟨u,z⟩ dμ(y)=⟨u,z⟩.

F1F4step 1.3
3.1

The Schur step. The kernel and the image of any intertwiner are subrepresentations, by [F6]; hence if A≠0, irreducibility makes A an isomorphism. Thus π≇σ forces A=0. If π≅σ, rescale an invertible intertwiner to a unitary one T:W→V: T∗T commutes with σ, hence is a positive scalar by the eigenvalue argument of [F7] and irreducibility. Then AT−1 commutes with π and is scalar by the same argument. Replacing z by Tz in the trace calculation of step 2.3 gives tr⁡(AT−1)=⟨u,Tz⟩, so A=(⟨u,Tz⟩/dim⁡π)T.

F6F7step 1.3step 2.3
4.1

The coefficient products. The coefficients lie in L2(G)⊆L1(G) by [F3] and [F8], so step 2.2 computes their convolution. If π≇σ, A=0 by step 3.1. Otherwise step 3.1 gives A=(⟨u,Tz⟩/dim⁡π)T, hence step 2.2 gives (fu,vπ∗fw,zσ)(x)=(⟨u,Tz⟩/dim⁡π)⟨π(x)Tw,v⟩. Any two unitary intertwiners differ by a scalar c with ∣c∣=1, since their quotient commutes with π and the scalar-endomorphism argument of step 3.1 applies. Replacing T by cT conjugate-scales the first factor and scales the coefficient by c, so the product is independent of T.

F2F3F8step 2.2step 3.1
5.1

Together with 1∗1=1 from step 2.1, step 4.1 proves the coefficient formula for inequivalent and equivalent irreducible representations. For σ=π, taking T=IV gives (⟨u,z⟩/dim⁡π)fw,vπ. ∎

step 2.1step 4.1

Verification notes

  • Hypotheses used. Continuity, irreducibility, unitarity in a finite dimension and compactness of G enter; the coefficient ⟨u,z⟩ pairs the "input" vector of the first coefficient with the "output" vector of the second, and fw,vπ uses the two remaining vectors, matching the classical matrix-unit rule.
  • Choice cost. [A1] is inherited from the suppliers [F1], [F3] and [F5] and is first used in step 1.1 through [F3], as declared in the fact itself; the eigenvalue theorem [F7], the averaging, the trace computation and the norm estimates add no further selection.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

61 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