Indexed text attachment
operads-modules-machine-learning.tex
Source for Operads, Modules, and Differentiation in Machine Learning
View paper · Download original file
Lines 801–900 of 1174. Source text is displayed literally.
801Thus \(B_\bullet(k,A,A)\to k\) is a free resolution, and tensoring802it over \(A\) with \(M\) gives803\[804 H_q(B_\bullet(k,A,M))\cong805 \operatorname{Tor}_q^A(k,M).806\]807The degree-one differential sends a generator808\([g]\otimes m\) to \(m-gm\), giving the ordinary quotient in809degree zero. One can also use normalized chains, since810the degenerate subcomplex of a simplicial \(k\)-module is811contractible.812 813For a permutation module \(M=k[S]\), this complex is the chain814complex of the nerve of the action groupoid \(G\ltimes S\).815For the given face convention, the generator816\((g_1,\ldots,g_q,s)\) corresponds to the string with terminal817object \(s\) and successive arrow labels818\(g_1^{-1},\ldots,g_q^{-1}\), beginning at \(g_1\cdots g_qs\).819Deleting the first object drops \(g_1\). Deleting the last820replaces \(s\) by \(g_qs\). Composing adjacent arrows takes821\(g_i,g_{i+1}\) to \(g_i g_{i+1}\) in the bar coordinates.822These are exactly the three types of faces above. The823groupoid describes how the identification is made, retaining824the automorphisms of a representative of each orbit.825 826\begin{proposition}[Orbit decomposition]827\label{prop:derived-orbits}828For a finite \(G\)-set \(S\), taking a representative \(s\) in829each orbit gives830\[831 \operatorname{Tor}^{k[G]}_q(k,k[S])832 \cong \bigoplus_{[s]\in S/G}833 \operatorname{Tor}^{k[G_s]}_q(k,k).834\]835\end{proposition}836 837\begin{proof}838The map \(g\otimes 1\mapsto gs\) identifies the induced module839\(k[G]\otimes_{k[G_s]} k\) with the span of the orbit of \(s\).840The translates of \(s\) are indexed by left cosets \(gG_s\).841If \(Q_\bullet\to k\) is a projective right \(k[G]\)-module842resolution, it remains a projective resolution over \(k[G_s]\)843because \(k[G]\) is free on the right over \(k[G_s]\). For each844orbit, tensor associativity identifies845\[846 \begin{aligned}847 &Q_\bullet\otimes_{k[G]}848 (k[G]\otimes_{k[G_s]} k)\849 &\qquad \cong Q_\bullet\otimes_{k[G_s]}k .850 \end{aligned}851\]852Taking homology and the sum over orbits proves the formula.853\end{proof}854 855Let \(\operatorname{char}(k)=p\) and \(G=C_p=\langle g\rangle\).856Writing \(u=g-1\), one has \(A=k[u]/(u^p)\), and the augmentation857sends \(u\) to zero. A free resolution of \(k\) alternates858multiplication by \(u\) in odd degrees and by \(u^{p-1}\) in859positive even degrees. The kernels of these two multiplications860are \((u^{p-1})\) and \((u)\), respectively, so the images are861exactly the next kernels. Their composites vanish since \(u^p=0\).862Tensoring with the trivial module \(k\) makes both differentials863zero, whence \(\operatorname{Tor}^{A}_q(k,k)\cong k\) for every864\(q\geq 0\).865 866For the preceding action of \(C_2\) on \(\{a,b,c\}\) over867\(\mathbb F_2\), the swapped orbit is free and the fixed slot868has stabilizer \(C_2\). Proposition~\ref{prop:derived-orbits} gives869two degree-zero classes and one class in each positive degree.870Directly, on the fixed-slot summand the augmented group algebra871has square-zero augmentation ideal \((u)\). In the normalized872bar the endpoint actions and every internal multiplication873vanish, leaving one copy of \(k\) in each bar degree. Thus ordinary874orbit pooling accounts for the same number of coordinate classes875over both fields, and the chain-valued modular quotient carries876additional information about stabilizers. Over \(\mathbb R\),877Proposition~\ref{prop:derived-averaging} reduces the derived878quotient to ordinary balancing.879 880For an explicit invariant feature in this modular setting,881take the dimensions \(h_j\) of the first two homology groups882of the quotient complex. They depend only on the isomorphism883class of the finite \(G\)-set. A single free \(C_2\)-orbit and884a single fixed point both have \(h_0=1\) over \(\mathbb F_2\).885They have \(h_1=0\) and \(h_1=1\), respectively, so a real886linear readout of \((h_0,h_1)\) can distinguish these two887inputs after the homology computation. This example supplies888an exact representation statistic for finite symmetry data.889Its value as a feature in any larger learning problem depends890on whether the target depends on the stabilizers in the input.891\section{Compositional AI and related work}892\label{sec:ai-applications}893 894\subsection{Wiring and differentiable semantics}895 896An operad specifies which interfaces can be substituted into897one another. An algebra specifies what a substitution does to898data. Vagner, Spivak, and Lerman give this separation a concrete899form for open dynamical systems: their wiring diagrams compose900syntactically, and an algebra interprets the diagrams by wiring