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.

Cheeger–Gromov uniform bound for rho invariants

Statement

Assume full AC. For every closed oriented 3-manifold M there exists a finite constant C_M such that for every discrete group Γ and every homomorphism φ:π₁(M)→Γ for which the rho invariant is defined, |ρ(M,φ)|≤C_M. The constant may depend on M but not on Γ or φ.

Statement references

Facts & Assumptions

Given: Full AC as in the coefficient Definition and a fixed closed oriented three-manifold M. First give M a specified smooth structure and interpret rho by its independent smooth bounding defect.

[A1]
[F1]

A rho invariant is called such only after bounding-defect independence is proved. Integral half-solutions, Strebel classes, and L²-signatures

[F2]

The smooth group-signature theorem constructs one fixed smooth bound WM over an acyclic envelope of π1M and proves smooth defect independence for all representations and injective target enlargements. It also constructs a fixed finite-projective chain model and an idempotent presentation E2=eRN for that bound. Smooth group signature defects are independent and uniformly bounded

[F3]

External TOP input under CLAUDE.md §12: every closed oriented TOP three-manifold admits a compatible smooth structure, and comparison of its collared TOP bounds with smooth bounds uses the closed TOP signature equality. The first input is Freedman–Quinn, Topology of4-Manifolds,8.3A–B, printed118–119, used only for the three-dimensional boundary; the second is Lück–Schick, Theorem0.2 and §3. The supplied-data defect comparison is proved in Bordism independence of the L²-signature defect. These external inputs are not described as locally reconstructed smoothing or index proofs.

Proof

1.1A1F1F2givenconstructalgebra

For smooth M, choose the one WM and degree-two presentation in [F2] before choosing a target or representation. For each ϕ:π1M→Γ, functoriality of the acyclic envelope extends the representation over this same bound after the injective enlargement Γ↪A(Γ). The actual coefficient chain-homotopy identities extend under the resulting ring homomorphism, so they still model its singular complex; no flatness of that homomorphism is needed. The extended degree-two term is the range of the same size-N idempotent, of von Neumann dimension at most N. Its reduced homology and the positive and negative spectral subspaces have dimension at most N, hence ∣sign⁡A(Γ)(2)WM∣≤N. Ordinary augmentation gives ∣sign⁡WM∣≤N too. Independence in [F2] therefore yields ∣ρsm(M,ϕ)∣≤2N, uniformly over every target cardinality and every homomorphism, including nononto maps. For finitely many components sum these constants; the empty manifold has constant zero.

2.1A1F1F2F3step 1.1constructalgebra∎

For the literal TOP reading choose one compatible smooth structure on M by [F3], once before choosing Γ or ϕ. Step1.1 supplies its finite constant 2N. Any rho defined by a collared TOP bound agrees with the smooth bounding-defect value by [F3] and the bordism-independence lemma; thus the same constant bounds it. Finitely many connected components use the sum of their constants. This proves the full stated signature-defect convention with an explicitly external TOP comparison. It does not claim a new analytic eta-to-defect theorem for an unrelated definition of rho.

Depends on

Used by

Dependency tree · two levels

28 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