Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 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.

Primitive Alexander annihilators for compact manifolds with first homology Z

Statement

Let M be a compact connected Hausdorff manifold, with boundary allowed, with a specified based loop μ whose integral homology class freely generates H1(M;Z)≅Z. Let ϕ:π1(M)→Z be the abelianization taking μ to 1, put Λ=Z[t,t−1], and use its associated normal-cover right coefficient system, whose transport around a loop a is left multiplication by t−ϕ(a) in the based fiber.

There is a finite Laurent matrix A(t) such that H1(M;Λ)≅coker⁡A(t), naturally on changing the constant coefficient ring from Z to any commutative unital ring k. More precisely the actual coefficient map gives H1(M;Λ)⊗Zk≅H1(M;k[t,t−1]). There is a polynomial Δ(t)∈Z[t] with Δ(0)≠0 and Δ(1)=1 annihilating H1(M;Λ); its coefficient image annihilates H1(M;k[t,t−1]) for every k. In particular Δ is primitive and its reduction modulo any prime is nonzero. No choice principle, finite CW type, triangulation, smoothness or Seifert presentation for M is assumed.

Facts & Assumptions

Given: The compact manifold, marked homology generator and coefficient convention.

[F1]

There is a finite one-vertex presentation two-complex K and a based map K→M inducing a fundamental-group isomorphism, with a marked one-cell mapping exactly by μ. Its underlying space is a finite polyhedron. Compact manifolds have finite fundamental-group presentation complexes without choice

[F2]

Normal-cover local first homology is naturally the covering subgroup's abelianization tensored with the constant coefficient ring. This applies to both spaces of [F1] and their actual map. Normal-cover local homology detects mixed-derived kernels without choice

[F3]

For a finite CW complex with supplied cell lifts the cellular local chains, with their transported signed incidence matrices, compute singular local homology. Here the coefficient rings are commutative, so the left/right distinction is just the corresponding identical scalar action. Cellular chains compute local homology

Proof

1.1F1F2F3givenconstructalgebra

Apply [F1], and pull the given coefficient system to K. The induced fundamental-group map is an isomorphism and matches μ, so [F2] identifies the actual H1 of K with that of M for Λ and every k[t,t−1]. Use [F3] on this actual finite two-complex. Its chain groups are finite free, with C0=Λ, a basis of one-cells including eμ, and a finite basis of two-cells. Cell lifts and orientations require only finitely many choices. Their incidence coefficients reduce under every constant-ring map, so coefficient change on these finite cellular chains is literally coefficientwise change in their Laurent matrices. In particular augmentation t=1 gives exactly the ordinary integral cellular complex of K.

2.1F3step 1.1constructalgebra

If the other oriented one-cells have images nj∈Z, their degree-one boundaries are t−nj−1, while d1eμ=t−1−1. Set z=−teμ, so d1z=t−1. Write qj=(t−nj−1)/(t−1)∈Λ, an explicit finite geometric sum also for negative exponents, and replace ej by fj=ej−zqj. This is an invertible triangular basis change with C1=Λz⊕Λr⟨fj⟩ and d1fj=0. Multiplication by t−1 is injective in k[t,t−1] for every commutative k: the top nonzero coefficient of a nonzero finite Laurent list remains a nonzero top coefficient after multiplication by this monic polynomial. Thus ker⁡d1 is exactly the fj summand, both integrally and after every constant-ring change. Since d1d2=0, the z row of d2 is zero. Let A(t) be its remaining r×s matrix, giving H1(K;Λ)=coker⁡A(t) and H1(K;k[t,t−1])=coker⁡Ak(t).

3.1F1F2givenstep 1.1step 2.1constructalgebra

At t=1, d1=0 and the integral first homology is therefore Z[z]⊕coker⁡A(1). The marked class z maps to −[μ], a free generator of H1(M;Z) by hypothesis and [F1]–[F2]. Hence coker⁡A(1)=0 and A(1):Zs→Zr is onto. For each of the finitely many coordinate vectors choose one preimage, giving an integer s×r matrix S with A(1)S=Ir. Put D(t)=A(t)S and Δ0(t)=det⁡D(t). Then Δ0(1)=1. The adjugate identity D adj⁡D=Δ0Ir, proved by finite signed minor expansion, gives Δ0Λr⊆im⁡D⊆im⁡A. Thus Δ0 annihilates the presented first homology. The same identity is an identity of integer Laurent matrices, so holds after every coefficient change as well. For r=0, use the empty determinant one; the corresponding first homology is zero.

4.1F1F2F3step 1.1step 2.1step 3.1constructalgebra∎

Normalize Δ0 by a power of t so its smallest exponent is zero, obtaining the asserted polynomial Δ with nonzero constant term. This multiplies it by a Laurent unit and retains Δ(1)=1 and every annihilation assertion. The coefficients sum to one, so their greatest common divisor is one; reduction modulo any prime still evaluates to one at t=1 and is therefore nonzero. Finally finite presentation cokernels commute with the change Z→k here directly: tensoring the presentation generators imposes exactly the same finite-column relations with their coefficients in k, so coker⁡A⊗Zk=coker⁡Ak by the tensor generators-and-relations construction. Via the natural identifications in steps 1.1–2.1 this is the actual coefficient map on local H1, not just an abstract isomorphism of modules. All selections in step 3.1 were finite preimages of a finite standard basis, and the remaining operations were finite integer or Laurent-matrix calculations. This proves the full scope without a choice axiom or a finite CW claim about M.

Depends on

Used by

Dependency tree · two levels

9 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