Tunnell's theorem¶

Test a square-free integer for the congruent-number property through equalities among counts of representations by four ternary quadratic forms—necessary unconditionally and sufficient conditional on Birch–Swinnerton-Dyer.

Version: v1 · 2026-09-08 · History
Domain-specific #: 7279
Origin domain: number theory
Subdomain: congruent numbers and elliptic curves

Core Idea¶

Tunnell's theorem states parity-dependent count equalities necessary for n to be congruent; assuming the Birch and Swinnerton-Dyer conjecture for the associated elliptic curve, those equalities are also sufficient. Modular-form and elliptic-curve arguments connect the central L-value of the congruent-number curve to coefficients expressed as differences of quadratic-form representation counts. Vanishing of the coefficient yields the finite test. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

Scope of Application¶

Tunnell's theorem belongs to number theory and is useful where the analyst can specify a positive square-free integer n, four explicitly defined ternary quadratic-form representation counts, and the elliptic curve y²=x³−n²x, then evaluate n is square-free, the odd or even branch uses exactly its prescribed forms and multiplicities, and necessity is kept distinct from BSD-conditional sufficiency. The scope is broad within that domain but bounded by the need for n is square-free, the odd or even branch uses exactly its prescribed forms and multiplicities, and necessity is kept distinct from BSD-conditional sufficiency. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making n is square-free, the odd or even branch uses exactly its prescribed forms and multiplicities, and necessity is kept distinct from BSD-conditional sufficiency the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Tunnell's theorem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Tunnell's theorem. Tunnell's theorem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: a positive square-free integer n, four explicitly defined ternary quadratic-form representation counts, and the elliptic curve y²=x³−n²x. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express n is square-free, the odd or even branch uses exactly its prescribed forms and multiplicities, and necessity is kept distinct from BSD-conditional sufficiency independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of number theory because they reuse a positive square-free integer n, four explicitly defined ternary quadratic-form representation counts, and the elliptic curve y²=x³−n²x, Modular-form and elliptic-curve arguments connect the central L-value of the congruent-number curve to coefficients expressed as differences of quadratic-form representation counts. Vanishing of the coefficient yields the finite test., and type the carrier, state every parameter and convention in the definition, test that n is square-free, the odd or even branch uses exactly its prescribed forms and multiplicities, and necessity is kept distinct from BSD-conditional sufficiency, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Tunnell's theorem Domain-specific

Parents (1) — more general patterns this builds on

Tunnell's theorem is a kind of Problem Representation Prime

The proposed strict upward parent is prime:problem_representation.

Hierarchy path (1) — routes to 1 parentless root

Tunnell's theorem → Problem Representation → Representation → Abstraction

Neighborhood in Abstraction Space¶

Tunnell's theorem sits in a moderately populated region (52^nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Elliptic Arithmetic & Zeta Values (7 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08