Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Explicit mitoses give functorial integrally acyclic group envelopes

Statement

Assume AC. There is an explicit functor A from groups to groups and a natural transformation ι:id→A such that each ιG:G→A(G) is injective and Hj(A(G);Z)=0(j>0),H0(A(G);Z)=Z. One may take A(G) to be the increasing union of the iterated mitoses G0=G, Gr+1=m(Gr), where m(K)=⟨K,u,t∣[h,ugu−1]=1, tgt−1=gugu−1 (g,h∈K)⟩. For every n≥0 there is a specified partial chain homotopy, in degrees at most n, between the trivial homomorphism and G↪Gn on integral unnormalized bar chains. It is zero in degree zero, has finite values on every basis simplex, and is natural in G. In particular every integral positive-degree bar cycle from any stage bounds after finitely many further mitoses. If G is countable, A(G) is countable.

Facts & Assumptions

Given: AC, arbitrary groups, and homomorphisms. Products, free products and relative group presentations have their usual algebraic meanings. A chain homotopy from a to b has boundary b−a.

[A1]

The Axiom of Choice supplies the coset transversals in the HNN embedding supplier and implies the DC used by the supplied-resolution interpretation of group homology. The finite chain constructions below require no further choices.

[F1]

An HNN extension with its stable letter, The base group embeds in its HNN extension and The universal property of an HNN extension give the relative presentation, base-group injection and extending homomorphisms for each HNN extension with injective associated maps.

[F2]

The homogeneous bar complex has alternating vertex-deletion boundary. Passing to diagonal coinvariants and using consecutive increments identifies it with the free abelian complex Cn(K) on all tuples [g1,…,gn], including identity entries, whose faces drop the first or last entry or replace consecutive entries by their product. Its homology is H∗(K;Z), naturally in K. The augmented unnormalized homogeneous bar complex, Diagonal bar coinvariants compute group homology

Proof

1.1A1F1givenalgebra

Put B=K×K. First adjoin u with u(g,1)u−1=(1,g), an HNN extension between the two injective copies of K in B. Next adjoin t with t(g,1)t−1=(g,g); these associated maps remain injective after the first extension. By [F1], B embeds after both adjunctions. Eliminating (1,g) using the first relation leaves precisely the displayed presentation of m(K): commutation between the two factors gives [h,ugu−1]=1, and the diagonal relation becomes tgt−1=gugu−1. Conversely those relations define the commuting homomorphisms (g,h)↦guhu−1 and satisfy both HNN relations, so the two presentation maps are inverse on generators. Thus kK:K→m(K) is injective.

1.2F2algebraconstruct

We give the chain constructions needed for integral acyclicity, rather than using a field Kunneth splitting. The tuples of [F2] form a simplicial set BK: inserting 1 gives degeneracies and the stated faces satisfy didj=dj−1di for i<j, by associativity, including the two end faces. Hence the alternating boundary squares to zero by pairing these faces. A tuple specifies a simplicial map from the standard simplicial simplex Δn: a face edge from vertex i to vertex j is labelled by the product gi+1⋯gj, with the empty product 1. This uniquely describes all faces and degeneracies. Products obey B(K×L)=BK×BL exactly. We use these unnormalized simplicial chains also for the finite standard simplex models below.

2.1F1step 1.1algebraconstruct

A homomorphism f:K→L extends to m(f) by applying f to the old generators and sending u,t to the respectively named generators. Every defining relation is preserved. Uniqueness on generators gives m(1)=1, m(fg)=m(f)m(g) and m(f)kK=kLf. Iterating gives a functorial sequence of injections Gr→Gr+1. Its colimit may be represented as the disjoint union of the pairs (r,g) modulo equality after transport to a common later stage; multiplication at a common stage is well-defined, and the stage maps are injective. This defines A and the natural injective ι.

2.2step 1.2algebraconstruct

For simplices x,y of common dimension n, define the Alexander-Whitney map by D(x,y)=∑i=0nx[0,…,i]⊗y[i,…,n]. Define the shuffle E(x⊗y), for dimensions p,q, as the sum over the monotone lattice paths from (0,0) to (p,q) of their product simplices, with sign (−1)v, where v counts pairs consisting of a vertical step before a horizontal step. The coordinate simplex maps interpret a path vertex (a,b) by the corresponding vertices of x,y, allowing repeated vertices. These formulas are natural. For D, the tensor boundary terms inside each front or back face reproduce the corresponding faces of (x,y); the extra terms cutting at i and i+1 cancel with opposite signs. Thus dD=Dd. For E, a face deleting the junction of steps of different types occurs in exactly the two paths interchanging those steps, with opposite signs. The remaining faces delete a vertex between two horizontal steps or between two vertical steps, or a first or last path vertex. These are exactly the shuffles of dx⊗y+(−1)px⊗dy, with the displayed signs, including paths with a zero-length coordinate. Consequently dE=Ed. Both maps agree with inverse identification of vertices in degree zero.

2.3step 1.2algebraconstruct

For v∈L, write μv(h)=vhv−1. The homomorphism μv is chain homotopic to the identity on C(L) by the finite formula Sv[h1,…,hj]=∑i=0j(−1)i[h1,…,hi,v−1,μv(hi+1),…,μv(hj)]. Indeed faces wholly before the inserted entry cancel with Svd, as do those wholly after it with the shifted sign. The two faces crossing the inserted entry in adjacent summands cancel because hiv−1=v−1μv(hi). The only unpaired end faces are μv[h1,…,hj] and −[h1,…,hj]. Hence dSv+Svd=μv−1, also in degree zero where both sides vanish. These formulas commute with any homomorphism taking v to its specified image.

3.1step 1.2step 2.2algebraconstruct

There is a specified natural homotopy P with dP+Pd=1−ED and P0=0. Here are its model fillings. A simplex of Δn×Δn is a weakly increasing sequence of pairs in {0,…,n}2. Prepending (0,0) defines a cone c; direct deletion gives dc+cd=1−vϵ, with vϵ the augmentation projection onto that vertex, zero in positive degrees. Having defined P below degree n, take the universal diagonal simplex an in this product, set z=(1−ED)an−Pdan, and define Pan=cz. For n>0, dz=0 by the lower identity and step 2.2; for n=0 set Pa0=0 since z=0. Thus dPan=z. For arbitrary (x,y) push this fixed model chain forward by their uniquely specified simplex maps and extend linearly. The same rule defines its values on faces, so the identity holds on every generator. Composition of the simplex maps proves naturality. This construction does not require simplices to be nondegenerate, and every output is finite.

3.2step 2.2givenalgebra

Suppose ϕ:Π→K has a specified partial chain homotopy Q with dQ+Qd=ϕ−e through degree n−1, where n≥1, e is the trivial homomorphism and Q0=0. On C(BΠ×BΠ) put L1(x,y)=x⊗[ ], L2(x,y)=[ ]⊗y and L=D−L1−L2. Each is a chain map: the endpoint maps drop the other coordinate and tensor with the zero-cycle [ ]. For positive degree j, L has only tensor bidegrees (i,j−i) with 1≤i≤j−1. In degree zero L=−[ ]⊗[ ], which is killed by Q⊗ϕ because Q0=0. Therefore on degrees at most n the signed tensor differential gives d((Q⊗ϕ)L)+(Q⊗ϕ)Ld=((ϕ−e)⊗ϕ)L. The terms involving the differential of the second factor cancel; the first factor only uses the stipulated identity below n.

4.1step 2.2step 3.1step 3.2algebraconstruct

In step 3.2 let U=ϕ×ϕ and V=e×ϕ, as maps from Π×Π to K×K. Set T=P(U−V)+E(Q⊗ϕ)L. By naturality of D and step 3.1, the boundary of the first summand is (1−ED)(U−V). By step 3.2 the second boundary is E((ϕ−e)⊗ϕ)L. Subtracting the L contributions leaves the two endpoint terms: E((ϕ−e)⊗ϕ)L1=ϕ×e−e×e and E((ϕ−e)⊗ϕ)L2=0, since ϕ and e agree on the vertex. Thus dT+Td=ϕ×ϕ−ϕ×e−e×ϕ+e×e through degree n. Also T0=0, using P0=Q0=0. All identities concern actual unnormalized chains; a trivial homomorphism is not replaced by the zero chain map.

5.1step 1.1step 2.3step 4.1algebraconstruct

Let k=kK, and let F:K×K→m(K) be F(g,h)=k(g)uk(h)u−1, a homomorphism since its two factor images commute. On Π let i(g)=(g,1), j(g)=(1,g), and δ(g)=(g,g). Put a=F(ϕ×ϕ)i=kϕ, b=F(ϕ×ϕ)j=μua, and c=F(ϕ×ϕ)δ=μta. The last two equalities are precisely the mitosis relations. Composing step 4.1 with F and δ gives d(FTδ)+(FTδ)d=c−a−b+e. Step 2.3 gives boundaries c−a for Sta and b−a for Sua. Consequently the explicit formula R=−FTδ+Sta−Sua satisfies dR+Rd=a−e=kϕ−e through degree n. In degree zero, the two conjugation terms are [t−1]−[u−1], independent of the single input vertex, while FTδ is zero there. To arrange zero degree-zero homotopy, replace Sta−Sua in this formula by its difference from (St−Su)e. Its boundary is unchanged, since μte=μue=e. Thus the required normalized formula is R=−FTδ+(St−Su)(a−e),R0=0. This supplies a full explicit one-degree improvement, with its sign checked by the three displayed boundary identities.

6.1step 2.1step 3.1step 2.3step 5.1induction

For n=0 the identity and trivial homomorphisms G→G agree on C0(G)=Z, so Q0=0 is a partial homotopy through degree zero. Given Qn−1 between the trivial map and G→Gn−1, apply step 5.1 with Π=G, K=Gn−1, and ϕ that inclusion, obtaining Qn. Each Q0n=0, so the induction applies at every stage. All constructions use finite sums, fixed simplex cones, named stable letters, and composition of natural maps. The formulas for P,S,T,R therefore commute with a homomorphism on the original group; no choices of null-homology primitives are made in this induction.

7.1F2step 6.1algebra

If z∈Cj(Gr) is a cycle with j>0, apply step 6.1 to Gr with n=j. Its image in Cj(Gr+j) differs from e(z) by dQjz. The latter trivial-image cycle lies in the image of C∗(1). This unnormalized point complex has one generator el in each degree, with del=el−1 for positive even l and zero for odd l. Its positive-degree contraction is bel=el+1 for odd l and zero for positive even l, with be0=0; it satisfies db+bd=1 in positive degrees. Thus e(z) bounds and so does the transported z. This handles identity entries without discarding degenerate simplices.

8.1A1F2step 2.1step 7.1∎

Every bar chain in A(G) is a finite sum of tuples involving finitely many group elements. All those elements belong to a common stage, and injectivity of the stage maps means that an equation dz=0 in the union is already the identical equation in that stage's free bar complex. Step 7.1 then fills it at a later stage. Hence the positive integral bar homology of A(G) vanishes; the unique vertex makes H0=Z. The identification [F2] yields the stated group homology. Countability follows because a group generated by a countable set has countably many finite words, each mitosis adds just two generators, and a countable union of countable explicitly generated groups is countable under [A1]. The trivial group, finite groups, arbitrary cardinalities and degree zero are all covered by the same constructions.

Remarks

This group-theoretic result supplies no manifold bordism realization, topological bordism homology axiom, signature index theorem or rho independence. Those are separate prerequisites for applications to signature defects. The normalized homotopy in the proof fixes both its boundary sign and its degree-zero value explicitly.

Depends on

Used by

Dependency tree · two levels

21 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