Independent scholarship · Open accessThe monthly digest

Editorially reviewed

Induction and Completion in Group-Algebra Semantics: Finite Quotients, Higher Coherence, and Partial Evaluation

We distinguish bounded enumeration from classification of effective profinite towers. Completed Hopf group algebras recover their groups and have inductive continuous duals. We prove undecidability for computable cyclic towers, finite-stage descent for coherent tests, and quotient-compatible specialization with a checked dihedral interpreter.

Anonymous← All research

Induction, completion, and classification

Klein's Erlangen program studies geometry through invariants of a specified transformation group. This raises a concrete question for semantics. What can a presentation by finite group data determine when the group acts in a model, is linearized, or is used at successive precision levels in an interpreter?

For a fixed positive integer $n$, enumerate the $n^{n^2}$ binary laws on a labeled $n$-element set. Test every associativity triple and check the unit and inverses. Taking the least table in each orbit of the permutation group decides isomorphism and provides canonical representatives. The classification of finite simple groups supplies composition factors. Extension data enter when assembling a finite group from them. For example, $C_4$ and $C_2\times C_2$ have the same simple factors, with a nonsplit and split extension respectively. Axiom Math's 2026 Lean release formalizes exhaustiveness for the stated list of finite simple groups. This is a different result from the table algorithm.

The syntax is the Lawvere theory opposite to the category of finitely generated free groups. A map $n\to m$ is an $m$-tuple of words, and composition is substitution. Its models in a finite-product category are product-preserving functors. Over sets it induces the free-group monad, and group relations generate a normal congruence on the free model. Finite relators allow enumeration of proofs of equations. For arbitrary finite presentations, even triviality is undecidable. Lagrange's theorem imposes divisibility constraints on ambient order. Two commuting elements of coprime orders have product of that order, while the transpositions and three-cycles in $S_3$ give a counterexample when commutation is absent.

Completed group algebras and the inductive dual

For a profinite group $G$ and a finite field $k$, set $k[[G]]=\lim_{U\trianglelefteq_oG} k[G/U]$ with the inverse-limit topology. The ordinary group algebra is a dense embedded subalgebra. Continuous discrete modules are built by filtered colimits of finite-dimensional continuous modules, which individually factor through finite group quotients. Compact modules are built from compatible finite quotient modules by inverse limits.

The completed tensor coproduct $\Delta[g]=[g]\otimes[g]$ and counit $\varepsilon[g]=1$ recover $G$. At a finite stage, off-diagonal coefficients of the group-like equation force distinct basis coefficients to have zero product. The field hypothesis and the counit leave one basis element with coefficient 1. Compatible group-like elements at all stages are exactly elements of $G$. This makes completed Hopf linearization fully faithful. Bare associative linearization can lose group structure. Over $\mathbb F_5$, both $C_4$ and $C_2\times C_2$ have split group algebra $k^4$. Products with $\mathbb Z_5$ give nonisomorphic profinite groups with the same completed associative algebra $k[[T]]^4$.

The continuous linear dual is the filtered colimit of function Hopf algebras $k^{G/U}$ and consists of locally constant functions on $G$. Each such function factors at a finite stage by compactness. Its coproduct pulls back along multiplication on $G$. Compatible characters recover $G$, with pointwise evaluation giving the topology. This identifies a precise inductive construction on the dual side.

An effective tower can still have undecidable isomorphism type

Fix distinct primes $p,q$. Given a machine $E$, define $e_n$ to be 1 if $E$ halts within $n$ steps and 0 otherwise. Output cyclic groups of orders $p^nq^{e_n}$ with residue quotient maps. Every stage and every map is explicit and computable. Their infinite limit is $\mathbb Z_p$ if $E$ runs forever and $\mathbb Z_p\times C_q$ if it halts. The second case has a continuous $C_q$ quotient. Thus recognizing the fixed limit $\mathbb Z_p$ in this input class would decide halting.

For $k=\mathbb F_p$, the completed algebra in the first case is $k[[T]]$, where stage $n$ imposes $T^{p^n}=0$. In the second case the algebra is $k[[T]]\otimes_k k[C_q]$ and has the nontrivial averaging idempotent $q^{-1}\sum_{g\in C_q}[g]$. Localness distinguishes the cases, making recognition of the fixed completed algebra undecidable as well.

Coherent finite observations

A higher group in an infinity-topos can be presented as a reduced groupoid object, with delooping given by its realization. Postnikov layer groups do not specify the attaching invariants. The manuscript gives two inequivalent connected 2-types with the same fundamental and second homotopy groups and action, distinguished by their $H^3(C_2;\mathbb F_2)$ classes.

Finite coskeletal Kan tables nevertheless give an effective classification of $\pi$-finite spaces as finite inputs. Kan conditions need only be checked through a finite dimension. Maps to a coskeletal target and simplicial homotopies between them are determined by finite tables. Minimal Kan models ensure exhaustiveness. This result concerns individual homotopy types as finite presentations.

For a pro-object $P=\{X_i\}$, maps to a constant target $Y$ are computed by a filtered colimit of mapping spaces $\operatorname{Map}(X_i,Y)$. Filtered colimits of spaces commute with finite limits, so finitely shaped families of maps and coherence cells descend together after refinement. An unbounded family can require unbounded precision. In the tower $K(\mathbb F_2^n,2)$ with coordinate projections, every individual coordinate observation descends, while the identity of the pro-object factors through no finite stage. Spectral linearization connects higher groups to local systems through $\operatorname{Mod}_{R[G]}\simeq\operatorname{Fun}(BG,\operatorname{Mod}_R)$.

Application to partial evaluation

Let an interpreter at level $i$ send a static argument, a dynamic input, and a state to an output, a state, and an ordered trace. Use transition maps on each of these objects and monoid homomorphisms on the traces. If evaluating and projecting gives the same triple as projecting and evaluating, then specialization at coherent static inputs inherits that identity. The property is stable under composition because the next layer receives the corresponding projected value and state, and multiplying observations commutes with projection. A continuous observation can need higher input precision than its output precision. For example, the second bit of a $2$-adic integer distinguishes 0 and 2, even though their classes modulo two agree.

The reference implementation uses the dihedral tower $(\mathbb Z/2^n)\rtimes C_2$ and stage algebras over $\mathbb F_3$. It fuses static convolution and translation operations into affine residual blocks, while preserving ordered group tags and dynamic augmentation signals. Algebraic identities prove exact commutation for this residual syntax. The tests check 129 source/residual inputs, 402 strict-transition inputs and 20,032 basis products, alongside checks for observation loss and stage-specific state dependence. The implementation uses only the Python standard library. Its scope is semantic correctness for the specified interpreter and operations.

Relation to physics and scope

Commutation with a finite group action constrains an invariant Hamiltonian to blocks on representation multiplicity spaces. The Hamiltonian inside each multiplicity space remains dynamical data. For a fixed finite gauge group, distinct classes in $H^3(BG;U(1))$ can also specify different topological actions. The manuscript gives the explicit nontrivial cocycle $(-1)^{abc}$ on $C_2$.

The full proofs, references, and executable checks accompany this entry. The anonymous byline is used for editorial review. AI assistance was used in literature retrieval, drafting, and the reference implementation.

Selected references

Reproducibility artifacts

group-algebra-semantics.pdf · 481,316 bytes · Download
SHA-256 6ef87e6aa855b1a62d5191a1c9a79d58f43f65574bc2d3112d316e06c7115307

group-algebra-semantics-source.zip · 68,846 bytes · Read in browser · Download
SHA-256 af98014b5d580e53657deb9ed99dffc9e9ea769f611bdb4e8b6b32d306fb6da0

Discussion

Open a careful, constructive conversation about this note.

Comments appear after editorial approval.