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

A compact group with no faithful continuous finite-dimensional representation

Example

Write C2={0,1} for the two-element group whose operation is given by the table 0+0=0, 0+1=1, 1+0=1, 1+1=0, so that 0 is the identity and every element equals its own inverse. Let

K:=∏n∈NC2

carry the coordinatewise operation and the product topology (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), each factor carrying the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then:

  1. K is a compact Hausdorff topological group; and
  2. every continuous finite-dimensional complex representation of K has a nontrivial kernel: for every finite-dimensional complex vector space V and every group homomorphism ρ:K→GL⁡(V) (A finite-dimensional representation ρ:G→GL⁡(V) over a field, and its degree) that is continuous for the topology on GL⁡(V)⊆L(V,V) induced by a norm on L(V,V), there is g≠e in K with ρ(g)=id⁡V; equivalently (Intertwiners, the spaces Hom⁡G(V,W) and End⁡G(V), equivalent representations, and faithful representations) no continuous finite-dimensional complex representation of K is faithful.

Both arguments are choice free: no form of Tychonoff's theorem is used. The topology in (2) is independent of the choices, because all norms on the finite-dimensional complex space L(V,V) are equivalent (All norms on a finite-dimensional complex normed space are equivalent, dim⁡FMm×n(F)=mn and dim⁡FL(V,W)=(dim⁡FV)(dim⁡FW) for finite-dimensional V,W).

Facts & Assumptions

Given: the two-element group C2={0,1} with the displayed operation; the product K=∏n∈NC2 with the product topology and coordinatewise operation, its projections written πn, its identity written e; a finite-dimensional complex vector space V; a norm ∥⋅∥ on V; the operator norm on L(V,V); and a group homomorphism ρ:K→GL⁡(V) that is continuous for the subspace topology on GL⁡(V).

[F1]

A group has an associative operation, an identity e with ex=xe=x, and inverses; a group homomorphism satisfies ρ(xy)=ρ(x)ρ(y) (Group and abelian group, Monoid homomorphism and group homomorphism).

[F2]

In the discrete topology every subset is open, so every map out of a discrete space is continuous; a space listed as {x0,…,xn}, in particular C2 and C2×C2, is compact whatever its topology; and distinct points of a discrete space are separated by the disjoint open sets {x} and {y} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Continuity of a map of topological spaces at a point and globally, Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).

[F5]

A norm satisfies ∥v∥=0  ⟺  v=0, ∥λv∥=∣λ∣ ∥v∥ and ∥v+w∥≤∥v∥+∥w∥, and its balls B(x,r)={y:∥y−x∥<r} are open (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Normed vector space over an absolutely valued field, read over C by Real and complex scalar conventions for normed spaces; for the triangle inequality see also The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[F7]

For linear T:V→W the kernel and image are linear subspaces, and T is injective exactly when ker⁡T={0} (Linear map between vector spaces over the same field, The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial); for linear T:V→V with V finite dimensional, dim⁡V=dim⁡ker⁡T+dim⁡im⁡T (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T); and a subspace U⊆V with dim⁡U=dim⁡V satisfies U=V (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V, claim 2).

[F8]

For every set X, element x0∈X and function Φ:X→X there is h:N→X with h(0)=x0 and h(n+1)=Φ(h(n)) for all n (The recursion theorem, The natural numbers N (von Neumann)); and a property holding at 0 and inherited by successors holds at every natural number (The principle of mathematical induction).

[F9]

A subset S⊆N is finite if and only if it is bounded above, and countably infinite if and only if it is unbounded (Every subset of an at most countable set is at most countable); in particular every finite F⊆N satisfies F⊆k for some k∈N.

[F10]

A topological space is compact when every family of open sets with union the whole space has a finite subfamily that already covers it, and a family is finite when it is empty or listed as {V0,…,Vn} (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

[F12]

ρ is continuous at e in the sense that for every neighbourhood N of ρ(e) there is a neighbourhood U of e with ρ[U]⊆N, and GL⁡(V) carries the subspace topology of L(V,V) (Continuity of a map of topological spaces at a point and globally, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

[F14]

Modulus laws in C: ∣z∣≥0, ∣z∣=0  ⟺  z=0, ∣zw∣=∣z∣∣w∣ and ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); and finite sums are defined and additive on lists (Finite sums and finite products, by recursion).

Verification

technique · direct
1.1F1algebra

The displayed table makes C2 a group: 0 is an identity by the first and third entries, 0+0=0 and 1+1=0 make every element its own inverse, the table is symmetric in its two arguments, and associativity holds because both (x+y)+z and x+(y+z) equal the sum of the three bits modulo 2, as the eight triples of bits show. It follows that K is a group under the coordinatewise operation: associativity is inherited coordinatewise from C2, the constant function e=0 is an identity, and x−1=x because xn+xn=0 in every coordinate; moreover the function z with z(0)=1 and z(n)=0 for n≥1 is not e, so K≠{e}.

1.2F2

Every subset of C2 is open in the discrete topology, so every map with domain C2, and every map with domain C2×C2, is continuous; C2 is compact as a finite space, and it is Hausdorff because {0} and {1} are disjoint open sets.

1.3F3algebra

For a finite set F⊆N and a function w:F→C2 put UF,w:={y∈K:yi=wi for all i∈F}. Each UF,w is ⋂i∈Fπi−1[{wi}], a finite intersection of preimages of open sets, hence a basic product-open set and in particular open; conversely, if W is open and x∈W, then by [F3] there is a basic product-open box B=∏nVn with x∈B⊆W and Vn=C2 for all n outside a finite set F, and then x∈UF,x∣F⊆B⊆W, because a point of UF,x∣F has i-th coordinate xi∈Vi for i∈F and an arbitrary coordinate of C2=Vn for n∉F. Also U∅,∅=K.

1.4F5F6F14

Since V is finite dimensional it admits an ordered basis e:n→V of finite length, and then every x∈V has exactly one coordinate list λ:n→C with x=∑i<nλiei. The assignment ∥x∥:=∑i<n∣λi∣ is a norm on V: definiteness is uniqueness of the coordinates, homogeneity is ∣αλi∣=∣α∣ ∣λi∣ applied termwise, and the triangle inequality follows from ∣λi+μi∣≤∣λi∣+∣μi∣ and additivity of finite sums applied termwise. Since every linear map V→V is bounded for this norm, the operator norm makes L(V,V) a normed space with ∥Tx∥≤∥T∥ ∥x∥; and because all norms on this finite-dimensional complex space are equivalent, the topology induced on the subset GL⁡(V) is the same for every choice of norm or of basis.

1.5F7algebra

Let T:V→V be linear with T2=id⁡V and T≠id⁡V. If T+id⁡V were injective, then it would be surjective, since an injective linear endomorphism of the finite-dimensional space V is surjective; then T−id⁡V=(T−id⁡V)(T+id⁡V)(T+id⁡V)−1=0 by T2=id⁡V, that is T=id⁡V, contrary to hypothesis. Hence T+id⁡V is not injective, so there is v≠0 with (T+id⁡V)v=0, that is Tv=−v.

1.6F1

Since ρ is a group homomorphism, ρ(e)=ρ(e⋅e)=ρ(e)2, and multiplying by the inverse of the group element ρ(e) gives ρ(e)=id⁡V; and ρ(g2)=ρ(g)2 for every g∈K.

2.1F11step 1.3

K is Hausdorff: if x≠y in K, there is n with xn≠yn, and then F={n} gives two points w=x∣F, w′=y∣F of C2F with UF,w∩UF,w′=∅, while x∈UF,w and y∈UF,w′ by step 1.3; these are disjoint open neighbourhoods.

2.2F3F4step 1.1step 1.2

K is a topological group. For multiplication m(x,y):=xy it suffices by [F3] to show that each component πn∘m is continuous, and (πn∘m)(x,y)=xn+yn. The map K×K→C2×C2, (x,y)↦(xn,yn), is continuous because its components are πn∘pr1 and πn∘pr2, composites of continuous projections; the operation C2×C2→C2 is continuous by step 1.2; so πn∘m is a composite of continuous maps, hence continuous. Inversion is the identity map of K by step 1.1 and therefore continuous.

2.3F5F9F12step 1.3step 1.4step 1.6

The set B:={T∈L(V,V):∥T−id⁡V∥<1} is open in L(V,V) and contains id⁡V, hence B∩GL⁡(V) is a neighbourhood of ρ(e)=id⁡V in the subspace topology; by continuity of ρ at e there is an open neighbourhood W of e in K with ρ[W]⊆B, and by step 1.3 applied to W∋e there is a finite F⊆N with UF,0⊆W, where 0 here denotes the zero function on F. By [F9] there is k∈N with F⊆k, and Uk,0⊆UF,0 because a cylinder constrains more coordinates; hence ∥ρ(g)−id⁡V∥<1 for every g∈Uk,0.

2.4step 1.1step 1.5step 1.6

Every g∈K satisfies g2=e because each coordinate satisfies x+x=0 by step 1.1, and therefore ρ(g)2=ρ(g2)=ρ(e)=id⁡V by step 1.6; consequently, whenever ρ(g)≠id⁡V, step 1.5 applied to T=ρ(g) provides v≠0 with ρ(g)v=−v.

2.5F10step 1.3

Let U be an open cover of K and call a pair (F,w), with F⊆N finite and w:F→C2, bad when no finite subfamily of U covers UF,w. If w:k→C2 is bad, then at least one of the two extensions w0,w1:k+1→C2, defined by wj∣k=w and wj(k)=j, is bad: indeed every y∈Uk,w has y(k)=0 or y(k)=1, so Uk,w=Uk+1,w0∪Uk+1,w1; if both cylinders on the right were covered by finite subfamilies of U, their union, listed after one another, would be a finite subfamily covering Uk,w, contradicting badness.

3.1F8step 1.3step 2.5

Assume for contradiction that U is an open cover of K with no finite subcover, so that the empty cylinder U0,∅=K is bad. Let X be the set of all functions w:D→C2 whose domain D⊆N is finite, and define Φ:X→X by: if dom(w)=k∈N, let w0,w1 be the two extensions of w to k+1, and put Φ(w):=w0 if (k+1,w0) is bad and Φ(w):=w1 otherwise; if dom(w) is not a natural number, put Φ(w):=w. By [F8] there is h:N→X with h(0)=∅ and h(n+1)=Φ(h(n)). Induction on n shows that h(n) has domain n and is bad: this holds at n=0 by the assumption, and if it holds at n then step 2.5 produces a bad extension of h(n) with domain n+1, which is exactly Φ(h(n))=h(n+1). Since each Φ(w) extends w, the functions h(n) are coherent, and x(i):=h(i+1)(i) defines a function x:N→C2, that is, a point x∈K, with x∣n=h(n) for every n.

3.2step 1.4step 2.3step 2.4

Every g∈Uk,0, for the k of step 2.3, satisfies ρ(g)=id⁡V. Suppose ρ(g)≠id⁡V; by step 2.4 there is v≠0 with ρ(g)v=−v, and then 2∥v∥=∥ρ(g)v−v∥=∥(ρ(g)−id⁡V)v∥≤∥ρ(g)−id⁡V∥ ∥v∥<∥v∥, using ∥Tx∥≤∥T∥ ∥x∥ of step 1.4 and ∥ρ(g)−id⁡V∥<1 of step 2.3; but 2∥v∥<∥v∥ is impossible because ∥v∥>0 by the norm axioms of step 1.4. Hence ρ(g)=id⁡V for every g∈Uk,0.

4.1F9F10step 1.3step 3.1

K is compact. Let U be an open cover of K and suppose it has no finite subcover. Steps 2.5 and 3.1 then produce a point x∈K with Un,x∣n bad for every n∈N. Since U covers K there is U∈U with x∈U, and since U is open step 1.3 gives a finite F⊆N with UF,x∣F⊆U; by [F9] there is m∈N with F⊆m, so Um,x∣m⊆UF,x∣F⊆U, that is, the one-member finite subfamily {U} of U covers the bad cylinder Um,x∣m — a contradiction. Therefore every open cover of K has a finite subcover, so K is compact.

4.2F13step 1.1step 3.2

Every continuous finite-dimensional complex representation of K has a nontrivial kernel. With V,ρ,k as above, step 3.2 gives ρ(g)=id⁡V for all g∈Uk,0. The function z:N→C2 with z(k)=1 and z(i)=0 for i≠k lies in Uk,0 because it vanishes on all i<k, and z≠e since z(k)=1; thus ρ(z)=id⁡V with z≠e, and ρ is not faithful, so the kernel of ρ is nontrivial.

5.1step 2.1step 2.2step 4.1step 4.2∎

By steps 2.1, 2.2 and 4.1 the space K=∏n∈NC2 is a compact Hausdorff topological group, and by step 4.2 every continuous finite-dimensional complex representation of K has a nontrivial kernel, so no such representation is faithful. The entire argument uses only the two-element table, the definitions involved and recursion and induction on N: no choice principle and in particular no Tychonoff theorem enters, so both claims are choice free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

130 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