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.

L²-dimension flatness for amenable groups

Statement

Assume the Axiom of Choice. Let G be a countable discrete amenable group. For every right CG-module M and every integer q>0, the N G-von Neumann dimension of Tor_q^{CG}(M,N G) is zero. This dimension-flatness statement does not say that the Tor module itself is zero.

Facts & Assumptions

Given: The Axiom of Choice, a countable discrete amenable group G, a right CG-module M, and q>0.

[F1]

The group von Neumann algebra, its canonical trace and the extended projective-submodule dimension have the stated meanings. The defining page fixes full AC as its foundational convention. Integral half-solutions, Strebel classes, and L²-signatures

[F2]

In a finite von Neumann projection module, Hilbert-dense submodules have dimension-zero quotient; zero-dimensional modules are closed under submodules, quotients, extensions and filtered colimits. Finite von Neumann modules, Hilbert closures, and dimension-zero quotients

[F3]

For a finite matrix over CG, its algebraic kernel is Hilbert-dense in its full Hilbert kernel, and the quotient of its NG-kernel by the right NG-span of that algebraic kernel has dimension zero. Følner sets approximate algebraic kernels in von Neumann dimension

[F4]

Tensor products consist of finite sums of elementary tensors and preserve cokernels over arbitrary rings. Apply the stated left-module version to the opposite ring and flip elementary tensors to obtain the right-module version used here. The functor M⊗A− is additive, right exact, and preserves direct sums over an arbitrary unital ring

[F5]

Tor is homology after tensoring a projective resolution of the right module. Canonical free covers iterated on kernels give a free resolution; apply the left-module construction to the opposite ring for right modules. Under the standing AC convention it is projective. Any two projective resolutions are homotopy equivalent over the resolved module, under DC, which follows from this standing AC convention. Tor from a projective resolution of the right module, The iterated free-module resolution is canonical in ZF, Projective resolutions of the same object are homotopy equivalent over that object

[A1]

Full AC supplies the projective-resolution comparison in [F5] and the Hilbert-space and von Neumann dimension arguments in [F1]–[F3]. The Axiom of Choice

Proof

Given: The data and standing foundational convention above. Put R=CG and A=NG.

1.1F2F3F4givenalgebra

First let K⊆Rn be generated by finitely many columns, and let B:Rs→Rn be the corresponding matrix map onto K. Right exactness of tensor products identifies K⊗RA with As/im⁡((ker⁡RB)⊗RA). The kernel of its natural map to An is therefore ker⁡AB/im⁡((ker⁡RB)⊗RA). This quotient has dimension zero by [F3]. The tensor-product identifications follow directly from the presentation ker⁡RB→Rs→K→0: relations among the chosen generators are exactly the elements of ker⁡RB.

2.1F2F4step 1.1constructalgebra

For an arbitrary submodule K⊆Rn, take its directed union of finitely generated submodules Kj. A tensor is a finite sum, so every element of K⊗RA comes from some Kj⊗RA. If its image in An is zero, its representative already lies in the kernel of the natural map Kj⊗RA→An. Thus the kernel for K is the directed union of images of the zero-dimensional kernels from step 1.1; it has dimension zero by [F2]. This also proves the assertion if relations identify different representatives, since images are quotients of those kernels.

3.1F2F4step 2.1construct

Let F=⨁i∈IR be any free module and K⊆F. Every finite tensor in K⊗RA involves finitely many vectors of K, each of finite coordinate support in F. Their supports lie in one finite free summand Rn⊆F. A kernel element is therefore the image of a kernel for a submodule of that finite free summand, handled by step 2.1. Taking the directed union over those submodules and finite supports, and applying [F2], proves that ker⁡(K⊗RA→F⊗RA) has dimension zero for every free F.

4.1A1F1F2F4F5step 3.1constructalgebra∎

Choose a free presentation 0→K→F→M→0. In the resolution-dependent definition of Tor, first use a free resolution beginning with this presentation. For any other chosen projective resolution, [F5] gives chain maps inverse up to chain homotopy; this use of projective-resolution comparison relies on [A1]. Additive tensoring preserves the homotopy equation f−g=dh+hd, since tensoring respects sums and composition. Thus the tensor complexes are homotopy equivalent and their homology modules are isomorphic; the calculation below therefore applies to every retained resolution datum. A free resolution beginning with this presentation computes Tor⁡1R(M,A) as ker⁡(K⊗RA→F⊗RA): resolving K and splicing onto F→M gives this equality by right exactness at the last differential. Thus step 3.1 proves the assertion for degree one. For q>1, successively apply the same construction to the kernels in a free resolution of M; the positive-degree homology after splicing shifts by one, giving Tor⁡qR(M,A)≅Tor⁡1R(Kq−1,A) for the appropriate syzygy Kq−1. The degree-one argument applies to every such module, so every asserted higher Tor group has dimension zero. No claim that these algebraic quotient modules are zero is used or obtained.

Depends on

Used by

Dependency tree · two levels

30 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