Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

The Poincaré sphere is a nontrivial integral homology sphere

Statement

Assume the Axiom of Choice. Let I∗ be the binary icosahedral group, the group of 120 unit quaternions acting on the unit sphere S3 by left multiplication, and put P=S3/I∗. The quotient is a closed connected oriented 3-manifold with universal cover S3 and deck group I∗. Then H∗(P;Z)≅H∗(S3;Z) and π1(P)≅I∗ is nontrivial.

Facts & Assumptions

Given: AC, the binary icosahedral group presentation I∗=⟨s,t∣(st)2=s3=t5⟩ of order 120, its free orientation-preserving action on S3, and the quotient P=S3/I∗.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. The local Poincaré-duality supplier below assumes this axiom.

[F1]
[F2]

Universal covering spaces: a universal cover is a covering map with simply connected total space.

[F3]

For a path-connected locally path-connected semilocally simply connected base, the deck group of a universal cover is isomorphic to the fundamental group: for a universal cover, its deck group is isomorphic to the fundamental group of its path-connected, locally path-connected, semilocally simply connected base.

[F4]

The first Hurewicz map is abelianization: for a path-connected space, H1(−;Z) is the abelianization of π1.

[F5]

Poincaré duality for oriented topological manifolds: under AC, compact oriented boundaryless P has cap-duality isomorphisms Hi(P;Z)≅H3−i(P;Z) in every degree.

[F6]

The universal coefficient theorem for cohomology over a PID: under AC, the free integral singular chain complex of P gives 0→Ext⁡1(H0(P),Z)→H1(P;Z)→Hom⁡(H1(P),Z)→0.

[F7]

Debray, Group Actions on S3, §§1–2, pp.1–2: I∗ is the order-120 preimage of the icosahedral rotation group in SU(2), has presentation ⟨s,t∣(st)2=s3=t5⟩, and acts freely by left multiplication; the finite-group quotient is a smooth covering S3→S3/I∗.

Proof

1.1F1F2F3F7given

By [F7], the order-120 subgroup of unit quaternions acts freely by left multiplication, so S3→P is a covering with deck group I∗. Each left multiplication is isotopic to the identity because S3 is path-connected; hence the action preserves orientation and the quotient is oriented. Since S3 is simply connected by [F1], this cover is universal by [F2]. Then [F3] gives π1(P)≅I∗, which is nontrivial because its order is 120.

1.2givenF4F7algebra

In the abelianization, write the images of s,t additively. The presentation in [F7] gives the relation (st)2=s3=t5, hence 2s+2t=3s=5t. The first equality yields s=2t; substituting into 3s=5t gives 6t=5t, hence t=0 and s=0. Thus (I∗)ab=0, and [F4] gives H1(P;Z)=0.

2.1givenA1F6step 1.2algebra

The quotient is connected, compact, and oriented, so H0(P;Z)=H0(P;Z)=Z. By [F6], H1(P;Z) is an extension of Hom⁡(0,Z)=0 by Ext⁡1(Z,Z)=0, so H1(P;Z)=0. The AC assumption is the one in [A1], needed for [F6].

3.1A1F5givenstep 1.1step 1.2step 2.1∎

By [F5] and step 2.1, H2(P;Z)=0 and H3(P;Z)≅H0(P;Z)=Z. For i>3, [F5] identifies Hi(P;Z) with negative-degree cohomology, which is zero. Together with steps 1.2 and 2.1, this is exactly the integral homology of S3. Step 1.1 shows that P is not simply connected, so it is not S3. The use of [F5] requires [A1].

Depends on

Used by

Dependency tree · two levels

39 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