Mazur's rational torsion theorem

6. 06 — Integration and hardening🔗

Theorem6.1
Group: Assemble allowed point orders with height-descent torsion finiteness and finite-abelian shape to prove the full fifteen-group classification, then derive the ncard challenge and audit the release. Stage weight: 50 points. (3)
Group member previews
Preview
Theorem 6.2
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Converge on a shared Mathlib and Tau Ceti pin.

Status: done; readiness: integrated; kind: integration; backend: mixed; risk: high; weight: 20 points.

Summary: The root and Tau Ceti contract workspaces use one exact Lean toolchain and complete resolved package-revision graph.

Canonical artifacts:

  • integration (integrated): MazurTheorem.Release.sharedDependencyGraph Embed the exact root and Tau Ceti toolchains and manifests whose complete resolved package-revision graphs are checked for equality.

  • integration (integrated): MazurTheorem.Release.tauCetiConsumerBuild Record the exact Tau Ceti downstream build and audit commands exercised by the permanent quality and CI gates.

Theorem6.2
Group: Assemble allowed point orders with height-descent torsion finiteness and finite-abelian shape to prove the full fifteen-group classification, then derive the ncard challenge and audit the release. Stage weight: 50 points. (3)
Group member previews
Preview
Theorem 6.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 3
Statement dependency previews
Preview
Theorem 2.8
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Integrate finite and formal-immersion prime APIs.

Status: blocked; readiness: statement_only; kind: integration; backend: mazur; risk: medium; weight: 10 points.

Summary: Expose one unconditional theorem that every rational torsion point has an allowed order, using the formal-immersion theorem for 11 and primes at least 17.

Canonical artifacts:

  • theorem (proposed): MazurTorsion.rationalTorsion_orders_mem_cyclicOrders Combine the exceptional finite endpoints and the formal-immersion prime theorem.

Theorem6.3
Group: Assemble allowed point orders with height-descent torsion finiteness and finite-abelian shape to prove the full fifteen-group classification, then derive the ncard challenge and audit the release. Stage weight: 50 points. (3)
Group member previews
Preview
Theorem 6.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Kernel-check Mazur's full torsion classification.

Status: blocked; readiness: compiled; kind: integration; backend: mazur; risk: medium; weight: 15 points.

Summary: The checked rationalTorsion_finite theorem uses rational Northcott, the approximate parallelogram law, and Mathlib finite-torsion descent without full Mordell–Weil finite generation.

Canonical artifacts:

  • theorem (contract): MazurTorsion.rationalTorsion_hasRankTwoPresentation The compiled cross-module adapter applies the generic theorem to finite rational torsion, conditional on the point-order, h55, and h77 inputs still owned by API integration.

  • theorem (proposed): MazurTorsion.rationalTorsion_hasMazurClassification Classify the rational torsion subgroup up to group isomorphism as one of Mazur's fifteen groups.

  • theorem (proposed): Challenge.Mazur.torsion_ncard_le Derive the immutable Lean Pool ncard-at-most-16 statement from the full classification.

Theorem6.4
Group: Assemble allowed point orders with height-descent torsion finiteness and finite-abelian shape to prove the full fifteen-group classification, then derive the ncard challenge and audit the release. Stage weight: 50 points. (3)
Group member previews
Preview
Theorem 6.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 3
Statement dependency previews
Preview
Theorem 2.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Final challenge, exposition, provenance, and reproducibility audit.

Status: blocked; readiness: statement_only; kind: integration; backend: mixed; risk: low; weight: 5 points.

Summary: Verify every blueprint edge, close every retained Challenge including the now-noncritical X_1(11) and cyclotomic contracts, reproduce the clean build, and publish the final axiom and source audit.

Canonical artifacts:

  • audit (proposed): MazurTheorem.Release.kernelAndProvenanceAudit Record the final axiom report, exact source pins, declaration provenance, and reproducible build evidence.

  • integration (proposed): MazurTheorem.Release.allChallengesClosed Verify that every registered Challenge is a checked bridge with no open contract.

  • integration (proposed): MazurTheorem.Release.versoBlueprint Publish a Verso blueprint exactly matching the formal-immersion dependency graph.