Alphabeta Math
LemmaStatement: AI-adaptedProof: Literature-sourcedPipeline-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.

Continuous finite-dimensional representations of a product of finite groups factor through a finite subproduct

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (Gi)i∈I be finite discrete groups, let K:=∏i∈IGi carry the product topology, and for a finite F⊆I let pF:K→KF:=∏i∈FGi be the coordinate projection. Then K is a profinite group (it is the inverse limit of the finite groups KF over the directed set of finite subsets F⊆I), and for every continuous finite-dimensional unitary representation ρ of K there is a finite F⊆I and a representation ρF of the finite group KF with ρ=ρF∘pF. Moreover the open normal subgroup ker⁡pF (the subgroup of tuples trivial in the F-coordinates, canonically isomorphic to ∏i∉FGi) can be chosen inside any prescribed identity neighbourhood, and every matrix coefficient of ρ depends on the coordinates in F only.

Facts & Assumptions

[F1]

The concrete inverse limit of the finite discrete groups KF over the directed set of finite subsets F⊆I is the group of compatible tuples, equipped with the inverse limit topology, and it satisfies the universal property of the inverse limit; the coordinate projections are the maps pF. (The inverse limit is the set of compatible tuples in the Cartesian product, The inverse limit of finite groups carries the subspace topology from the product of discrete factors, The compatible-tuple construction satisfies the inverse-limit universal property in groups)

[F2]

A topological group topologically isomorphic to an inverse limit of finite discrete groups is profinite, and for such a presentation the kernels of the coordinate projections form an open normal neighbourhood basis at the identity. (A profinite group is a topological group isomorphic to an inverse limit of finite discrete groups, The kernels of the finite coordinate projections form an open normal neighbourhood basis at the identity)

[F3]

A continuous finite-dimensional unitary representation ρ of a profinite group factors through a finite quotient: for the presentation K=lim←⁡KF there is a finite F with ker⁡pF⊆ker⁡ρ, so ρ=ρF∘pF for a representation ρF of KF, and every matrix coefficient of ρ factors through that finite quotient. (Continuous finite-dimensional representations of profinite groups factor through finite quotients)

[F4]

In the product topology on ∏i∈IGi the basic identity neighbourhoods fix finitely many coordinates, each pF is continuous and surjective, and ker⁡pF is the closed subgroup of tuples trivial in the coordinates of F, canonically isomorphic to ∏i∉FGi. (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space)

[F5]

Matrix coefficients are cv,wρ(k)=⟨ρ(k)v,w⟩ for vectors v,w, and strong continuity of a finite-dimensional representation makes k↦ρ(k) norm-continuous. (Matrix coefficient of a unitary representation, Strongly continuous unitary representations, invariant linear subspaces and intertwiners)

[F6]

The first isomorphism theorem gives K/ker⁡pF≅pF(K)=KF. (First isomorphism theorem for groups: G/ker⁡f≅im⁡f)

Proof

Given: AC, Finite discrete groups (Gi)i∈I, the product K=∏iGi with product topology, coordinate projections pF for finite F⊆I, and a continuous finite-dimensional unitary representation ρ of K.

1.1F1F2F4F6

The map x↦(pF(x))F from K to the set of compatible tuples is a topological group isomorphism onto lim←⁡FKF, with inverse given by the compatible tuple's coordinates: it is a group homomorphism because each pF is, it is injective because the coordinates determine x, it is surjective because the coordinates of a compatible tuple define an element of K whose projections are the given ones, and both directions are continuous for the product and inverse-limit topologies by [F1]; hence K is profinite by [F2], and the kernels ker⁡pF form an open normal neighbourhood basis at the identity. By [F4] each ker⁡pF is the closed subgroup of tuples trivial in the coordinates of F and is canonically isomorphic to ∏i∉FGi; moreover pF is surjective with K/ker⁡pF≅KF by [F6].

2.1F3F5step 1.1∎

Apply the profinite factorisation lemma [F3] to the profinite presentation of K as lim←⁡FKF: there is a finite F⊆I with ker⁡pF⊆ker⁡ρ, and ρ factors as ρ=ρF∘pF for a representation ρF of the finite group KF; since the ker⁡pF form an identity neighbourhood basis by step 1.1, the finite set F may be chosen so that ker⁡pF lies inside any prescribed identity neighbourhood of K. Every matrix coefficient cv,wρ(k)=⟨ρF(pF(k))v,w⟩ by [F5] depends only on pF(k), hence only on the coordinates in F, and is constant on the cosets of ker⁡pF; this proves the lemma.

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