Source and verification

This article explains family 321 of the October 6, 2026 OpenAI collection. Research conclusions are attributed to its manuscripts. The review covers statements, introductions, and selected proof mechanisms; it is not an independent verification of the complete proofs.

Wall’s finite problem asks whether a finite complex that looks two-dimensional to suitable homological tests must have a finite two-dimensional homotopy model. This manuscript claims a counterexample with a finite three-dimensional cell structure and infinite fundamental group. Its proof combines an explicit twisted boundary matrix with a geometric obstruction obtained by repeatedly lifting maps through infinite cyclic covers. (OpenAI, 2026)

🏷️ Preliminaries: cells, covers and local coefficients

A finite CW complex is built from finitely many cells by attaching their boundary spheres to earlier stages. Its dimension is the largest cell dimension. A homotopy equivalence can change the cell structure substantially, so the existence of three-cells in one presentation does not itself obstruct a two-dimensional model.

Let and let be the universal cover. Its cellular chains are modules over the group ring , with the action given by deck transformations. A local coefficient system allows coefficients to change by parallel transport around loops. A left -module gives cellular cochains .

The condition asks for

for every finitely generated -module . The finite problem asks whether a finite connected complex satisfying these conditions is homotopy equivalent to a finite complex of dimension at most two. Asphericity is not part of the question.

Manuscript's finite counterexample

There is a finite connected three-dimensional CW complex satisfying the displayed vanishing, with in fact for every coefficient module , but with no finite two-dimensional homotopy model. Its fundamental group is infinite. (OpenAI, 2026)

The finite qualification matters on both sides. The argument below does not establish that every possible infinite two-dimensional model is excluded. It also does not contradict stable realization results obtained after adjoining sufficiently many two-spheres.

🏷️ A rank-one character that detects torsion

A character defines a rank-one complex local system . Operationally, a vector transported around a loop representing is multiplied by . With the right action , its homology is computed by

The central obstruction is the following statement.

Manuscript's two-dimensional character obstruction

If is a finite connected complex of dimension at most two and , then for every finite-order element . (OpenAI, 2026)

The source proves more: if a finite connected simplicial complex has , every map pulls back to a system with trivial monodromy. Here the first rational Betti number is the dimension of .

We first explain why the vanishing hypothesis survives the two operations in its proof.

🏷️ Why twisted second homology survives a cyclic cover

For a subcomplex in dimension at most two, is injective. Both groups are kernels of the second cellular boundary, since there are no three-cells. This needs no injectivity of fundamental groups.

Now take a connected infinite cyclic cover with finite and two-dimensional. Give the pulled-back local system its canonical deck action: a deck transformation changes the point upstairs while leaving its coefficient in the downstairs fiber fixed. With , the cellular chain groups upstairs are finite free -modules. Setting recovers the downstairs twisted cellular complex.

Let be the second boundary matrix and let it have columns. If , then is injective. For it has a nonzero minor. The same minor of is a nonzero Laurent polynomial, so has full column rank over and hence is injective over . Thus

This is ordinary homology with finite-support chains; no completed or square-summable chain complex is involved. (OpenAI, 2026)

🏷️ The tower must grow inside a fixed finite domain

Suppose has nontrivial pullback monodromy and . Replace by a finite simplicial model of dimension at most two and make simplicial after a sufficiently fine initial subdivision of . Fix this triangulation for the remainder of the argument. Let .

Inductively suppose is onto its finite simplicial image, twisted second homology vanishes on , and the pullback monodromy remains nontrivial. Nontrivial rank-one monodromy gives . Euler characteristic therefore yields

Thus , so surjects onto . The map from lifts to the associated infinite cyclic cover: every homomorphism factors through the finite group and is zero.

Let be the image of that lift. The cyclic-cover lemma and subcomplex injection preserve twisted second-homology vanishing; the pullback system on is unchanged. The lift remains simplicial on the same fixed domain triangulation.

Let count nonempty simplices. The covering projection maps onto and maps every simplex isomorphically onto a simplex. Hence . Equality would give exactly one compatible lift of each simplex, hence a section of the connected nontrivial cyclic cover. That would make the covering subgroup all of , a contradiction. Consequently

which is impossible. This proves the tower obstruction.

For a finite-order element of order , a loop representing extends to the Moore complex , whose first rational Betti number is zero. If , this map violates the tower obstruction. The order-two case uses . (OpenAI, 2026)

🏷️ The finite plus construction supplies

Let be a finite two-dimensional complex with fundamental group , and let be the normal closure of elements in . Assume is perfect, meaning , and put . Normal finite generation does not require to be finitely generated as an abstract group.

Attach two-cells to kill those normal generators, obtaining with fundamental group . In the universal cover of , the preimage has fundamental group , so . With , the relative chain group consists of in degree two. The relative homology sequence therefore gives a surjection

Choose preimages of its basis. Since the cover is simply connected, the degree-two Hurewicz theorem represents them by spheres. Attach three-cells along their projections to get . If projects two-chains onto the newly added two-cells, the choices give the exact identity

Thus is injective, proving the universal-cover homology condition. For any module and cochain , the cochain extends it across . Hence the third cochain boundary is onto and for every .

Moreover, the relative complex in degrees three and two is , which is contractible. The absolute-relative sequence is degreewise split. Tensoring with any right -module preserves its exactness and this contraction, so preserves all homology with coefficients pulled back from . In particular, it preserves the character test needed above. (OpenAI, 2026)

🏷️ An explicit presentation and perfect kernel

The source takes five generators with four relations

Let be the presentation complex, let , , and let be their normal closure. In the quotient , the map sending to and the other generators to zero is onto, so is infinite.

Perfectness is an exact calculation. With , the relations give

In the abelianization , let . Conjugation factors through , giving

The element fixes , and acts trivially on all of . Multiplying the first relation by gives . Similarly, fixes and its fifteenth power acts trivially, so , hence and . Since and are coprime, ; then invertibility of gives . Their conjugates generate the abelianization, so is perfect.

The finite plus construction now adds two two-cells and two three-cells. Thus has one vertex, five edges, six two-cells and two three-cells, and satisfies . The remaining task is to exclude a finite two-dimensional model. (OpenAI, 2026)

🏷️ The twisted matrix and the final contradiction

Choose a primitive cube root of unity . Define a character by

These values satisfy the four relations and kill , so the character descends to . In particular, has order exactly two in : its square is one, but its character value is .

The twisted second boundary on maps to . The four boundary vectors, written as rows with columns , are

One can compute each row by following the attaching word, weighting a traversed edge by the character of the path already traversed. Equivalently, use the Fox product rule , with and , and evaluate at . For example, the relation contributes in its coordinate and in its coordinate.

The minor on columns is

Thus the rows are independent, the second boundary is injective, and . The plus construction preserves this homology, so as well.

A finite two-dimensional model would inherit both this vanishing and the character taking value on an element of order two. That contradicts the tower obstruction. Equivalently, the corresponding loop would extend to with nontrivial pulled-back monodromy, the precise configuration the tower excludes. (OpenAI, 2026)

All four source sections were read for this exposition, and the displayed minor was independently checked symbolically. This checks the matrix and explains the proof architecture; it does not constitute a formal verification of the manuscript or its imported topological results.

Cyclic covers and Borel rigidity also turns properties of covers into an obstruction to geometric realization. Its proper height-translation argument differs from the fixed-domain simplex count used here.

🏷️ Key steps and proof outlines

The construction separates a chain-level cancellation from a geometric realization problem. The following diagram shows where the distinction enters.

flowchart TD
  B["Finite presentation complex B"] --> P["Kill the perfect normal subgroup with two 2-cells"]
  P --> X["Add two 3-cells with split boundary"]
  X --> D["D(2) holds for every coefficient module"]
  B --> T["Injective twisted second boundary"]
  T --> H["Twisted H2 of X vanishes"]
  H --> Y["Suppose a finite 2-dimensional model Y exists"]
  Y --> F["Order-two loop gives a map from RP2"]
  F --> C["Cyclic lifts strictly increase image size"]
  C --> N["Contradiction with the fixed finite domain"]

A split boundary is not a geometric cell cancellation

In the plus construction, says that each new three-cell has coefficient one on its designated new two-cell after projection. It proves injectivity of and gives an explicit extension of every third cochain. It also contracts the relative chain complex, even after arbitrary changes of coefficients.

This does not assert that the three-cells can be removed by geometric elementary collapses. An elementary collapse requires an actual free face in the attaching geometry. The matrix identity records the projected cellular incidence, while the attaching spheres can also involve the old cells. The point of the example is that these strong homological cancellations coexist with the obstruction to every finite two-dimensional homotopy model. (OpenAI, 2026)

The tower consumes a resource that cannot be replenished

The tower proof uses a particularly concrete finite resource: the simplices in one fixed triangulation of the source . Each stage maps this same onto its image . Lifting to a cyclic cover does not subdivide , so the number of simplices of is bounded by the number in at every stage.

Why is growth strict? The projection is onto, with each simplex mapped isomorphically to a simplex. If both image complexes had the same total number of nonempty simplices, every target simplex would have exactly one lift in the image. Face compatibility would make these lifts a simplicial section of the cyclic cover over all of . On fundamental groups, a section would make the image of the covering subgroup equal to the whole group. That is impossible for the connected cover defined by an epimorphism to .

Thus every lift spends at least one additional simplex while the supply stays fixed. This explains both why the source is triangulated once and why allowing a new subdivision at every stage would break the contradiction.

The twisted matrix can be checked without numerical roots

The nonzero minor can be verified symbolically using . Restrict the displayed matrix to columns . Its last column has only one nonzero entry, , in the last row. The remaining determinant is

Hence the full minor is , nonzero because a primitive cube root does not have square one. No numerical approximation of is needed. The same exact character makes nontrivial while the quotient relation makes . These two uses of the character are complementary: one supplies homological vanishing, the other supplies the forbidden torsion monodromy.

🏷️ Manuscripts and verification scope

No family scope page was present at lean/docs/321.md in the pinned snapshot. This does not establish that all related formalization code is absent. No Lean build, axiom audit, or manuscript-to-formal-statement equivalence check was performed for these notes.

OpenAI collection provides prerequisites and the reading sequence; coverage register records completed and pending families.

🐻  OpenAI 2026. A Counterexample to Wall’s D(2) Problem.