Skip to content

Heegner's lemma

A descent lemma stating that a quartic curve with nonsquare leading coefficient has a rational point if it has a point over an odd-degree extension.

Version
v2 · 2026-09-19 · History
Domain-specific #
4847
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Arithmetic Geometry → Mathematics

Core Idea

The base field, characteristic and nonsquare leading coefficient are essential, and the lemma supplies descent of existence rather than an explicit point-construction algorithm in every formulation. An odd-degree point defines algebraic conjugate data whose norm and divisor parity force a degree-one rational class, allowing the solvability of the quartic to descend to the base field. 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.

How would you explain it like I'm…

 

No faithful explanation at this level. At this level the lemma collapses into 'if fancy numbers solve an equation, plain numbers do too, and here is how to find them.' That drops the odd-degree, nonsquare-coefficient and base-field conditions, and it wrongly turns an existence guarantee into a construction recipe.

The Odd-Size Solution Trick

Heegner's lemma is about a special kind of equation with a fourth power in it. Sometimes you can't find a solution using ordinary fractions, but you can find one using a bigger, extended number system. The lemma says that if that bigger system is built in an 'odd-sized' way, and the equation meets certain conditions, then a solution with ordinary numbers must exist too. It tells you a solution is there, though it doesn't always tell you how to build it.

Odd-Degree Descent for Quartics

Heegner's lemma concerns a quartic equation over a base field, with a leading coefficient that is not a square. If the equation has a point whose coordinates lie in an extension field of odd degree, the lemma concludes the equation is already solvable over the base field itself. The odd degree matters: conjugate copies of the point combine, and a parity argument forces a solution class 'of degree one' over the original field. The field, its characteristic and the nonsquare condition are essential, not decoration. In most formulations it proves existence rather than giving a recipe for the point. It is a key step in Heegner's work on the class-number problem.

 

Heegner's lemma is a descent statement in arithmetic geometry. Fix a base field of suitable characteristic and a quartic y² = f(x) whose leading coefficient is a nonsquare. If the curve acquires a point over an extension of odd degree, then the quartic is solvable over the base field. The mechanism takes the Galois conjugates of the odd-degree point and forms norm and divisor data. The odd degree forces the parity of the resulting divisor class to produce a class of degree one that is defined over the base field. That degree-one rational class yields the solvability conclusion. In general this is an existence result obtained by descent, not an explicit point-construction algorithm. The hypotheses on the base field, the characteristic and the nonsquare leading coefficient are essential. Its key role is as a step in Heegner's solution of the class-number problem.

Scope of Application

Heegner's lemma belongs to arithmetic geometry and is useful where the analyst can specify the typed arithmetic geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the base field and characteristic, quartic coefficients, nonsquare leading coefficient, odd-degree extension and point, precise solvability conclusion, descent or divisor argument and role in the class-number proof are explicit. The scope is broad within that domain but bounded by the need for the base field and characteristic, quartic coefficients, nonsquare leading coefficient, odd-degree extension and point, precise solvability conclusion, descent or divisor argument and role in the class-number proof are explicit. 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 the base field and characteristic, quartic coefficients, nonsquare leading coefficient, odd-degree extension and point, precise solvability conclusion, descent or divisor argument and role in the class-number proof are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

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 Heegner's lemma. Heegner's lemma 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

  1. Identify the carrier. State what the elements, states, objects, or observations are: the typed arithmetic geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the base field and characteristic, quartic coefficients, nonsquare leading coefficient, odd-degree extension and point, precise solvability conclusion, descent or divisor argument and role in the class-number proof are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of arithmetic geometry because they reuse the typed arithmetic geometry carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, An odd-degree point defines algebraic conjugate data whose norm and divisor parity force a degree-one rational class, allowing the solvability of the quartic to descend to the base field., and type the carrier, state every parameter and convention in the definition, test that the base field and characteristic, quartic coefficients, nonsquare leading coefficient, odd-degree extension and point, precise solvability conclusion, descent or divisor argument and role in the class-number proof are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Heegner's lemmaParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Heegner's lemmaDOMAINPrime abstraction: Local-to-Global Aggregation — is a kind ofLocal-to-GlobalAggregationPRIME

Current abstraction Heegner's lemma Domain-specific

Parents (1) — outgoing typed relations

  • Heegner's lemma is a kind of Local-to-Global Aggregation Prime

    It remains its own entry because its identity is fixed by the base field and characteristic, quartic coefficients, nonsquare leading coefficient, odd-degree extension and point, precise solvability conclusion, descent or divisor argument and role in the class-number proof.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Heegner's lemma sits in a crowded region of the domain-specific corpus (7th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Arithmetic Geometry & Local Fields (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25