Map of Hilbert–Smith proof

Map of Hilbert–Smith proof

from an effective ℤₚ-action§8–11n localizationboundariesThm 4.3:T is freeProp 12.4Lemma 5.2,(11.6)naturality(12.2)same integerstrace (3.1)contradiction
Left column: equivariant classes, controlled over the free -space . Right column: their images after forgetting the group and , controlled over only. Naturality (12.2) makes the square commute, and forgetting the group does not change ordinary signatures (3.1).

The proof compares two computations of one invariant. From a hypothetical effective -action the paper constructs a class in controlled -theory over , where is a fixed free -space.

Taking localization boundaries removes the sphere factor and leaves a class over . Over a free space every class has ordinary signatures divisible by (left column). Forgetting the group and turns into the manifold controlled by a degree-one map, whose boundary is (right column).

Both columns end in the same integers, so divides .

Proof graph

  • divisibility by p
  • signature one
  • shared machinery
  • cited result
  • theorem
  • needed by selection
  • uses selection
Algebra§2–5Boundaries, carriers§6–7, 12Construction§8–11, 13 Input · CP95 Thm 4.2: Karoubi localizationCP95 Thm 4.2KaroubilocalizationInput · Ran89 Thm 5.2: Witt groups of ℚ[G]Ran89 Thm 5.2Witt groups ofℚ[G]Input · Weibel III.4: Negative K vanishesWeibel III.4Negative KvanishesInput · Ran92, Ran89: Completion invarianceRan92, Ran89CompletioninvarianceInput · BS01 Thm 2.8: Idempotent completionBS01 Thm 2.8IdempotentcompletionInput · Hatcher 2C.1: Simplicial approximationHatcher 2C.1SimplicialapproximationInput · Hatcher 4.25: Degree classifies spheresHatcher 4.25DegreeclassifiesspheresInput · Roberts 1975: Finite orbits, finite imageRoberts 1975Finite orbits,finite imageInput · Pa19, Gle52, Yam53: Fifth-problem reductionPa19, Gle52, Yam53Fifth-problemreductionDefinition 2.1: Asymptotic categoryDefinition 2.1AsymptoticcategoryLemma 2.2: Support calculusLemma 2.2Support calculus§3 · (3.1)–(3.2): Signature representation§3 · (3.1)–(3.2)SignaturerepresentationLemma 3.1: Cyclic arithmeticLemma 3.1CyclicarithmeticProposition 3.2: Tail extractionProposition 3.2Tail extractionLemma 4.1: Local trivialityLemma 4.1Local trivialityLemma 4.2: NilpotenceLemma 4.2NilpotenceTheorem 4.3: Integer tail divisibilityTheorem 4.3Integer taildivisibility§5.1 · (5.1)–(5.2): Rational structures§5.1 · (5.1)–(5.2)Rationalstructures§5.2 · (5.3)–(5.5): Graph idempotent§5.2 · (5.3)–(5.5)Graph idempotentLemma 5.1: Compatible splittingLemma 5.1CompatiblesplittingLemma 5.2: Scalar normalizationLemma 5.2ScalarnormalizationProposition 6.1: Exterior boundaryProposition 6.1ExteriorboundaryLemma 6.2: Boundary of a unionLemma 6.2Boundary of aunionLemma 7.1 · Cor 7.2: Acyclic carriersLemma 7.1 · Cor 7.2Acyclic carriersLemma 7.3: Fixed-triangulation fillingLemma 7.3Fixed-triangulationfillingLemma 7.4: Relative dual blocksLemma 7.4Relative dualblocksLemma 7.5: Cap–block comparisonLemma 7.5Cap–blockcomparisonCorollary 7.6: Common simplicial diagonalCorollary 7.6CommonsimplicialdiagonalLemma 8.1: A free pointLemma 8.1A free point§8 · (8.1)–(8.6): Invariant degree-one control§8 · (8.1)–(8.6)Invariantdegree-onecontrol§8 · (8.7): Detector map to T§8 · (8.7)Detector map toT§8 · (8.8)–(8.9): Radii, finite quotients§8 · (8.8)–(8.9)Radii, finitequotientsLemma 9.1: Chain models of WLemma 9.1Chain models ofW§9 · (9.2)–(9.5): Approximate action§9 · (9.2)–(9.5)ApproximateactionLemma 9.2: Product homotopiesLemma 9.2Producthomotopies§9 · (9.7)–(9.8): Adjoint homotopies§9 · (9.7)–(9.8)AdjointhomotopiesLemma 10.1: Exterior bandLemma 10.1Exterior bandProposition 10.2: Compressed realizationProposition 10.2Compressedrealization§11 · (11.1)–(11.3): Controlled averaging§11 · (11.1)–(11.3)Controlledaveraging§11 · (11.4)–(11.5): Corner class§11 · (11.4)–(11.5)Corner class§11 · (11.6): Scalar image§11 · (11.6)Scalar image§12 · (12.1)–(12.2): Iterated boundary§12 · (12.1)–(12.2)IteratedboundaryLemma 12.1: Controlled relative dualityLemma 12.1Controlledrelative dualityLemma 12.2: Controlled unionsLemma 12.2ControlledunionsLemma 12.3: Scalar control homotopiesLemma 12.3Scalar controlhomotopiesProposition 12.4: Boundary evaluationProposition 12.4BoundaryevaluationProposition 13.1: Signature-one realizationProposition 13.1Signature-onerealizationTheorem 1.1: p-adic exclusionTheorem 1.1p-adic exclusionCorollary 1.2: Hilbert–SmithCorollary 1.2Hilbert–Smith

Key steps

1Small subgroups give exact invariance with degree one

The input unavailable for finite groups is (8.1)–(8.6): an open subgroup with displacement , Haar-averaged into an -invariant map of degree one. Everything downstream uses three properties of this data: is invariant, so the action is trivial in the sphere coordinate; has degree one, so the final boundary is one ; and acts freely on , which gives the detector. For a genuine finite cyclic action with small displacement the same machinery proves a local Newman theorem, which is true. The new part is the treatment of the errors of the approximate action: Lemma 9.2, (9.7)–(9.8), Lemma 10.1 and §11.

2First-order coherence suffices over

No higher coherences of the homotopy action are ever built. Splitting needs only , which is an idempotent in , split by Balmer–Schlichting. Symmetric structures need only a strictly self-dual , because has no rational group homology. With rational coefficients, mod- information is recovered from integrality of signatures, through Lemma 3.1.

3Control of the idempotent via free sheets

is not a morphism over : it rotates detector values by . Tensoring with and labeling sheet by cancels the rotation exactly, so lives in the controlled equivariant category. The same compensation is needed for every exterior witness of Lemma 10.1, separately on prefix and suffix. This is the step most specific to this proof.

4Uniform control while

averages terms, and its homotopies terms. This is legitimate because , coefficients are unrestricted, and has propagation zero. So every bound has to be uniform in and in . The carrier method supplies this: bounds come from carrier diameters through a width recursion with steps, independent of rank, valence and subdivision.

5Order of categories and the exterior quotient

exists only on absolute categories, while the corner exists only in an exterior quotient, where the approximate action and the detector make sense. The two are connected by the exterior boundary (Prop. 6.1), which needs and ; here supplies it. Order: corner in , boundaries into , signatures last.

6Computation through the scalar image

is not computed directly. The proof computes in the non-equivariant setting, where homotopy invariance and explicit cut-and-paste are available, and uses that ordinary signatures do not see the difference. has to hold as an identity of -classes in the exterior quotient, where signatures are not defined. It rests on the explicit homotopy isometry of Lemma 5.2.

Consistency checks

Non-effective actions

If the action has a kernel, the small subgroup may fix the chart center. Then , no exists, and the construction stops at (8.4). Effectiveness is used in Lemma 8.1.

Actions through a finite quotient

For acting by rotations, a displacement bound on forces into the kernel, since a nontrivial rotation moves points far. Newman's theorem forces the same in general. So again .

Finite cyclic actions

With and a cyclic -group acting with small displacement and a non-fixed point, the construction applies with and proves a local Newman theorem, which is true. The approximate action is the only new ingredient that requires.

Classical analogue: transfer

If acts freely and orientation-preservingly on a closed oriented -manifold and is invariant, then factors through and . The paper adapts this argument with three changes: degree becomes the signature of the local fibre (the factor makes it a signature), freeness becomes control over , and the action becomes an approximate one with errors tending to zero.

Notation

SymbolMeaningWhere
, small open subgroup: on (8.1)
, index- subgroup and the quotient that acts freely on §8
, , finite quotients, , ; (8.9)
, Haar average of chart coordinates; , avoiding (8.2), (8.4)
, pinch map; the -invariant degree-one control map to (8.5)
; ; cut, exterior, compression and detector radii around (8.8)
, , exteriors ; sublevels (8.8)
, , with free -action; ; the detector (8.7)
, , asymptotic category; support subcategory; exterior quotient§2
, , ; finite support; (3.3)
signature tail in , on absolute categories only(3.5)
, with orthonormal form; (4.1)
, , the compactified chart times ; §9
, , , triangulations of , their rational chains, mesh, fundamental cycles§9
, , completed maps ; coset representatives; (9.2)–(9.4)
, , , chain approximations; product, isometry and adjoint homotopies§9
, , , , far subcomplex; compression; projection; based section; (10.1)
, , compressed action , duality , inverse (10.3)
, , , free sheets ; ; graph idempotent; sheet translation(11.2)
, , , the corner, its splitting maps, normalized duality (11.4)
, corner class; scalar class of labeled by (11.5), §10
forget and , keep sphere control§11
, -fold localization boundary, with and without and the group(12.1)

Overloaded letters