Mazur's rational torsion theorem

2. 02 — Finite-level endpoints🔗

Theorem2.1
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.2
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

The five-coset bound on X_1(11). Every rational point on y^2+y=x^3-x^2 differs from one of the five multiples of (0,0) by five times a rational point.

Status: open; scope: exact compiled challenge contract. The target declaration is MazurTorsion.XOneEleven.fiveCosetBound, with challenge bridge MazurTheorem.Challenge.xOneEleven_fiveCosetBound; the existing consumer is MazurTorsion.XOneEleven.five_point_classification_of_cosetBound.

Theorem2.2
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Exclude exact rational order 11. Feed the five-coset classification through the existing X_1(11) reduction.

Status: blocked.

Canonical deliverables — these names are authoritative for this node:

  • theorem (proposed): MazurTorsion.XOneEleven.rationalPoint_addOrderOf_ne_eleven Consume the five-coset contract and the existing X_1(11) reduction to exclude exact rational order 11.

Theorem2.3
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Classify the noncuspidal rational points on X_1(13). If rational x,y satisfy the explicit order-13 sextic equation, then x=0 or x=-1.

Status: research_open; scope: exact compiled challenge contract. The destination is MazurTorsion.XOneThirteenDescent.no_noncuspidal_point; the challenge name is MazurTheorem.Challenge.xOneThirteen_no_noncuspidal_point. The prepared nouns are the Kubert sextic, Pell certificate, and genus-two descent data in MazurTorsion.NumberTheory.XOneThirteenDescent.

Theorem2.4
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Classify the noncuspidal rational points on the order-18 curve. If rational x,y satisfy the explicit order-18 sextic equation, then x=0 or x=1.

Status: research_open; scope: exact compiled challenge contract. The destination is MazurTorsion.XOneEighteenDescent.no_noncuspidal_point; the challenge name is MazurTheorem.Challenge.xOneEighteen_no_noncuspidal_point. The proposed proof finishes the Eisenstein-integer descent already exposed by the module.

Theorem2.5
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Exclude exact rational order 25. No rational point on an elliptic curve over \mathbb{Q} has exact additive order 25.

Status: research_open; scope: exact compiled challenge contract. The destination theorem is MazurTorsion.Kubert.rationalPoint_addOrderOf_ne_twentyFive, bridged by MazurTheorem.Challenge.no_rational_point_of_order_twentyFive.

Theorem2.6
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Exclude exact rational order 35. No rational point on an elliptic curve over \mathbb{Q} has exact additive order 35.

Status: research_open; scope: exact compiled challenge contract. The destination theorem is MazurTorsion.Kubert.rationalPoint_addOrderOf_ne_thirtyFive, bridged by MazurTheorem.Challenge.no_rational_point_of_order_thirtyFive.

Theorem2.7
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 1used by 1XL∃∀N

Bridge exact order 49 to the X_0(49) correspondence. An exact rational order-49 point produces a noncuspidal point of the already classified level-seven correspondence, a contradiction.

Status: open; scope: exact compiled challenge contract. The destination is MazurTorsion.XZeroFortyNine.rationalPoint_addOrderOf_ne_fortyNine, bridged by MazurTheorem.Challenge.no_rational_point_of_order_fortyNine. The public APIs orderSevenG7F, exists_orderSevenHauptmodul_of_exactOrder, orderSevenQuotient, and orderSevenPointMap now compile. The missing step is additivity (or compatibility with multiplication by seven) followed by the nonbacktracking tower branch; the rank-zero endpoint already lives under MazurTorsion.NumberTheory.

Theorem2.8
Group: Close orders 18, 25, 35, and 49 and the separate prime levels 11 and 13. Stage weight: 100 points. (7)
Group member previews
Preview
Theorem 2.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
Statement uses 6
Statement dependency previews
Preview
Theorem 2.2
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Assemble all finite-level exclusions. Remove the four composite callbacks and the separate 11- and 13-level callbacks from the point-order theorem.

Status: blocked.

Canonical deliverables — these names are authoritative for this node:

  • theorem (proposed): MazurTorsion.rationalTorsion_orders_mem_cyclicOrders_of_finite_endpoints Combine the exact order 11, 13, 18, 25, 35, and 49 exclusions into the finite- endpoint point-order API.