Source and verification

This article explains family 315 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.

The four-dimensional Singer conjecture predicts that square-integrable homology of the universal cover of an aspherical closed four-manifold lives only in degree two. Family 315 claims this conclusion without a curvature, smoothness, orientability, or residual-finiteness assumption. Its argument turns a hypothetical positive first -Betti number into a boundary continuum with incompatible properties. (OpenAI, 2026)

🏷️ Preliminaries: asphericity, duality, and dimension

A connected space is aspherical when its universal cover is contractible. It can still have nontrivial homology downstairs: a torus is the simplest example. An integral Poincaré complex of formal dimension four is a finite connected CW complex with a fundamental class and cap-product duality for every local coefficient system. Its orientation character records whether loops reverse orientation. The duality here is absolute, not relative duality for a pair.

Let be the deck group of the universal cover. Completing cellular chains in a square-summable norm produces Hilbert spaces with a -action. Reduced homology takes cycles modulo the closure of boundaries. The group von Neumann algebra supplies a dimension normalized per fundamental domain; the dimension of is one. The resulting nonnegative real numbers are the -Betti numbers .

For finite CW complexes this agrees with the algebraic definition using extended von Neumann dimension after tensoring chains with . The algebraic definition also applies to singular chains of topological manifolds. It is not ordinary homology of the contractible universal cover: the completion and the requirement of square summability change the chain problem.

Manuscript's four-dimensional concentration theorem

If is a finite connected aspherical integral Poincaré complex of formal dimension four, with any orientation character, then

In particular this holds for every closed connected aspherical topological four-manifold. (OpenAI, 2026)

For a manifold without a triangulation, the source passes to a finite four-dimensional homotopy model; it does not claim to triangulate the manifold. Local-coefficient duality and invariants transport across this homotopy equivalence.

🏷️ Reduction to first-degree vanishing

Asphericity and a finite-dimensional model give a finite-length free resolution of the trivial -module. A subgroup of prime order would contradict this by its nonzero cohomology in arbitrarily high even degrees, so is torsion-free. It is infinite: otherwise it would be trivial and contractible, contradicting its mod-two fundamental class.

A square-summable harmonic function in degree zero is constant on the connected cover and therefore zero. Poincaré duality gives

The finite four-dimensional model has no higher chains. For a nonorientable complex, apply duality on its orientation cover and use finite-index scaling of von Neumann dimension. Thus only remains.

The same duality, now over , supplies

With a permutation coefficient module, homological Shapiro gives . This vanishes for finite or two-ended subgroups in this torsion-free setting. These inputs control ends and obstruct certain tree actions later in the proof.

🏷️ Finite-energy functions and a compact boundary

Suppose . Choose a finite presentation and its locally finite Cayley graph . For a function on vertices, its Dirichlet energy is

counting each cellular edge once. Integrating a cocycle in the simply connected presentation complex shows that square-summable one-cocycles are finite-energy gradients. The positive Betti number means some such gradient is outside the closure of gradients of finitely supported functions. It does not require that the image of the coboundary operator be closed.

The source obtains a bounded finite-energy function with nonconstant behavior at infinity. Its translates, singleton indicators, and additional component-recording functions form a countable invariant family , with every coordinate normalized to take values in . Taking the closure of vertex profiles gives a compact metrizable space .

Choose positive weights with . The metric and its edge lengths satisfy

The last inequality follows from Minkowski’s inequality and the chosen weights. In particular, only finitely many edges have length at least any prescribed positive number.

Singleton coordinates isolate every group vertex. Nonconstant behavior at infinity prevents from being a singleton. One-endedness makes connected: a separation of the boundary would leave two infinite vertex regions connected by only finitely many long edges, producing more than one end after a finite deletion.

The additional coordinates are crucial. For a coordinate box with finitely many graph components , they satisfy and have disjoint nonzero supports. A positive margin at a boundary point selects exactly one component. Consequently, vertices approaching the same boundary point can be joined by paths whose vertices stay uniformly near that point. This is a graph-path statement; it is not yet local connectivity of .

🏷️ Dimension, cohomology, and the cut-point reduction

Finite energy also controls translates of coordinate level cuts. The manuscript proves that the action on is a convergence action: any sequence of distinct group elements has a subsequence collapsing uniformly on compact sets away from one exceptional point. It separately proves

The dimension is covering dimension: finite open covers admit refinements with at most two sets through a point. The relevant cohomology is Čech cohomology, computed from nerves of covers, suitable for a boundary not yet known to be locally connected.

For the dimension bound, almost every coordinate cut has a boundary accumulation set of one-dimensional Hausdorff measure zero. A finite grid of such cuts has a small clopen partition on its accumulation set. Off that set, the near-path property makes cut signs locally constant. Small neighborhoods of the clopen pieces, together with the sign regions, give arbitrarily fine covers of multiplicity at most two.

For Čech vanishing, transfer a nerve cocycle to an edge cochain on the presentation complex. Its coboundary has finite support: far-out triangular cell boundaries shrink toward single boundary points, where the nerve cocycle identity applies. The vanishing of removes this finite coboundary by a finitely supported correction. The remaining cocycle is a gradient. Its values near the boundary give the coboundary of the original nerve class after refinement. This does not replace Čech cohomology by singular cohomology on a possibly wild continuum.

A cut point disconnects a space when removed. If has cut points, a pretree records which cut points separate which others. The manuscript combines a cut-point theorem with an additional reduction for parabolic cut points to select a nondegenerate block without cut points. It constructs a continuous retraction , locally constant off .

The retraction matters: inclusion followed by retraction is the identity on , so injects into the zero group . Closed-subspace monotonicity gives . Continuity is proved using nearby graph paths and the closure of the projection’s graph, before local connectivity is available.

The resulting auxiliary graph has finitely many vertex and edge orbits under a subgroup , but can have infinite valence and infinite stabilizers. Its vertices may themselves lie in . These possibilities are retained in the next argument.

🏷️ Annular depth and a threshold independent of the path

An annulus is an ordered pair of disjoint closed sides. Nested annuli separate a closed set from a vertex; let be the greatest chain length for a group vertex . Choose containing the identity. Depth is finite at each group vertex and tends arbitrarily high toward boundary points outside .

For an auxiliary vertex , let be all group elements representing it from a chosen orbit representative. Define deep vertices by

The minimum imposes the depth bound on every representative. This permits moves through an infinite stabilizer without losing depth. Boundary points outside have locally constant labels , specifying the component of the induced graph approached by nearby vertices.

For a deep sequence , translated sets shrink to one boundary point after a subsequence. A uniform annular comparison shows that fixed boundary points away from acquire the same deeper component label under .

Choose three fixed anchors . At least two avoid the one exceptional point. Their translated labels therefore define a unique majority label at sufficiently large depth. Fix the finite list of moves coming from edge-orbit representatives, together with one contracting stabilizer move for each vertex orbit when needed. A contradiction-by-subsequence argument gives one threshold such that, for every , these moves preserve the majority label whenever both representatives have depth at least .

The threshold depends on the neighborhood, anchors, and finite move list. It does not depend on a path’s endpoints or length. Stabilizer powers bring the anchors toward their fixed vertex, identifying its boundary label with the majority label. Edge moves then show

Thus one small boundary neighborhood retains a common component label at every greater depth. A threshold for each individual path would not provide this conclusion. (OpenAI, 2026)

🏷️ From paths to small connected boundary sets

Take two nearby boundary points with this common label. For each depth , approximate them by vertices of and join those vertices within their component. All path vertices stay in the prescribed neighborhood.

The metric distances between adjacent vertices tend uniformly to zero. There are only finitely many edge orbits, and translates of each representative edge shrink outside a finite set of group elements. Endpoints of the finitely many exceptional edges are excluded at large depth. This proves vanishing mesh without local finiteness of .

Compactness gives a Hausdorff limit of the finite path-vertex sets. The limit contains both chosen points and lies entirely in . It is connected: a separation into compact pieces at positive distance would force some approximating path to make an edge jump of that distance, contradicting vanishing mesh.

Every nearby boundary point can therefore be connected to the chosen point by a small continuum. Repeating this in each open set shows that its components are open. This is local connectivity of .

🏷️ The continuum contradiction and its consequences

For a compact metric space of dimension at most one, restriction in Čech degree one to a closed subset is surjective. To see this, refine a cover to multiplicity at most two. Its nerve is a graph, and a one-cocycle on the subgraph associated to the closed subset extends by zero on the remaining edges; there are no two-simplices imposing further conditions.

Consequently cannot contain an embedded circle: the circle would be closed and have nonzero , contradicting the surjection from . A nondegenerate locally connected compact metric continuum with no embedded circle is a dendrite and has a cut point. Concretely, an interior point of an arc between two points must separate them; otherwise a second arc avoiding it would create a circle. This contradicts the construction of without cut points and forces .

The claimed concentration yields . The middle invariant need not vanish: a product of genus- and genus- closed surfaces, with , has Euler characteristic , while the four-torus has zero. For oriented closed topological manifolds, the additional topological -signature theorem gives .

If the deck group has a descending normal tower of finite-index subgroups with trivial intersection, the additional approximation theorem identifies normalized rational Betti-number limits with in degree two and zero elsewhere. This tower hypothesis is required for that consequence, not for the concentration theorem.

The selected-source review covers the duality reduction, boundary interfaces, retraction, uniform path threshold, continuum contradiction, and consequences. The full finite-energy potential construction, convergence argument, pretree reduction, and all annular estimates have not been independently reconstructed here.

  • Quillen homology provides another instance where precise chain-level information is needed before passing to a homological conclusion; its finite posets differ from the completed chain spaces here.

🏷️ Key steps and proof outlines

Three anchor points turn sequential collapse into a uniform path estimate

The final geometric step needs a single threshold that works for every deep graph path. A statement about one convergent sequence of group elements would not suffice: the path and its endpoints change as the depth increases.

In the manuscript’s annular construction, measures the separation depth of a translate from a fixed excluded region . The label records which component of the depth- vertex graph approaches a boundary point . Earlier lemmas show that, along a sequence of increasingly deep translates, all fixed boundary points except possibly one acquire the same eventual component label.

Fix three distinct anchor points . For a sufficiently deep , at least two points of share one depth- label; define it as . It is unique because two distinct labels cannot each occur twice among three points.

The threshold can be made uniform. If no common threshold existed, choose violating depths and translates . Pass to the convergent subsequence supplied by the earlier dynamical lemma, with one exceptional point . Two of the three fixed anchors avoid , so their images eventually share a label, contradicting the violation.

The same compactness argument applies to finitely many allowed edge moves . Choose two anchors in and two in avoiding ; their four images eventually have a common label. Thus, for one threshold covering the entire finite list,

whenever both endpoints are deep enough. Finitely many edge orbits supply precisely such a finite move list. In the boundary-orbit version of the graph, the list also includes stabilizing elements whose iterates move the anchors toward the represented vertex. This identifies the majority label with the component label at that vertex. (OpenAI, 2026)

Stabilizing labels pushes connectivity to arbitrarily fine depth

Constancy of along edges implies the refinement statement

with independent of . Fix a point and a prescribed neighborhood . Choose an ambient neighborhood whose closure meets only inside . Local constancy of provides a smaller neighborhood of on which all points have the same label. The refinement implication then keeps them in the same component at every deeper level.

For each , take graph paths inside with endpoints tending to . The maximum edge length of these paths tends to zero. To prove this uniformly, use the finite list of edge representatives: all their far translates have small length, while sufficiently deep vertex sets exclude the finitely many endpoints belonging to the remaining translates.

Regard each path as its finite vertex set and take a Hausdorff-convergent subsequence in the compact ambient space. The limit contains and lies in . It is connected: if it split into two compact pieces a positive distance apart, every sufficiently fine approximating path meeting both would need an edge spanning that distance, contradicting its vanishing mesh.

Thus every point of lies in the component of inside . Applying this neighborhood property at each point shows that components of open sets are open, which is local connectedness. This passage from discrete paths to continua is the reason the uniform threshold matters.

Dimension one and vanishing Čech cohomology force a cut point

The concluding topological lemma also has a concrete proof. In a compact metric space of covering dimension at most one, every finite open cover has a refinement of multiplicity at most two. Its nerve is a graph. For a closed subset , represent a class in on a cover and refine after extending that cover to .

Retain the cover indices even when two restricted sets coincide. The restricted nerve is then a subgraph of the full nerve. Extend its one-cocycle by zero on the remaining edges. Since the full nerve has no two-simplices, this remains a cocycle. Therefore restriction

is onto. If the left side vanishes, cannot contain an embedded circle, whose first cohomology is nonzero.

Local connectedness supplies arcs inside connected open regions. Choose an arc between two distinct points and an interior point . If were not a cut point, the connected open set would contain another arc between the same endpoints. A component of the first arc outside the second, together with the corresponding segment of the second, forms an embedded circle. This is impossible. Hence has a cut point, contradicting the cut-free block constructed from positive first -Betti number. The finite-energy, duality, and cut-point-reduction inputs remain separate substantive parts of the source proof.

🏷️ Manuscripts and verification scope

No family scope page was present at lean/docs/315.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. The Singer conjecture in dimension four.