KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesSub-exponential Class Group Computation for Quadratic FieldsEngineering · Engineering MathematicsLesson 809/883← PrevNext →
GuidePublished 7 Aug 2026Updated 13 Aug 20268 min readBy Kevin Joginsub-exponentialquadratic fieldclass grouprelation collection
On this page

Ask about this page

KEVOS AISub-exponential Class Group Computation for Quadratic Fields

KEVOS knowledge first · trusted web sources when needed

Quadratic Fields

Sub-exponential Class Group Computation for Quadratic Fields

Sub-exponential class group and regulator computation for quadratic fields by relation collection over a factor base.

Engineering / MathematicsQuadratic Fields8 min readKV-MATH-0608

Enumeration and cycle traversal both cost roughly the square root of the discriminant. The sub-exponential method collects relations over a factor base instead, reducing the exponent from one half to the sub-exponential range.

The method

Factor base→Collect smooth relations→Linear algebra→Class group and regulator

Sub-exponential class group computation

  1. Build the factor basePrime ideals of norm below a bound, equivalently forms with small first coefficient.
  2. Generate random formsCompose random products of factor base elements and reduce.
  3. Test smoothnessA reduced form whose first coefficient factors over the base gives a relation.
  4. Assemble the matrixRows are relations, columns are factor base primes.
  5. ReduceStructured elimination then Smith normal form.
  6. Read the resultsInvariant factors give the class group; the kernel gives the regulator.
Running time ~ L_D(1/2, c)Conditional on GRH; D the discriminant.

Why reduction produces smooth forms

Key point

Reduction bounds the first coefficient by roughly the square root of the discriminant. A random integer of that size is smooth with respect to a well-chosen base with useful probability, which is exactly the mechanism that makes the method work — see smoothness.

The real quadratic complication

Caution

For real fields, relations carry a real-valued component recording the distance travelled along the cycle. That component is what produces the regulator, and it must be tracked numerically with sufficient precision throughout — a considerable practical complication absent from the imaginary case.

Comparison

Quadratic class group methods compared
MethodCostRange
Form enumerationSquare root of the discriminantUp to about 12 digits
Cycle traversalSquare root of the discriminantReal fields, modest size
Analytic formulaGrows with required precisionVerification, small cases
Sub-exponential relationsL(1/2), conditional on GRHLarge discriminants

Relation to factoring

Key point

The structure of this algorithm is identical to that of the quadratic sieve: collect smooth relations over a factor base, then do sparse linear algebra. The kinship is not coincidental — see the class group factoring method, which runs the connection in the other direction.

The general case

The same approach extends to arbitrary number fields as Buchmann's algorithm, with ideals in place of forms and a more elaborate reduction step.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 5.3.4-5.4.3. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • Relation Matrix Construction
  • The Sub-exponential Algorithm in Practice
  • Quadratic Sieve Factor Base Selection
  • The Fundamental Unit of a Real Quadratic Field
  • Computing the Structure of Residue Rings

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Sub-exponential Class Group Computation for Quadratic Fields. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Sub-exponential Class Group Computation for Quadratic Fields as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—quadratic, sub-exponential, class, group, relation—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Sub-exponential Class Group Computation for Quadratic Fields?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about quadratic would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
  • MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.

Implementation record: minimum fields

Create a compact record alongside the work. Include the purpose, context, responsible owner, stakeholders or affected users, inputs and sources, assumptions, method, acceptance or decision criteria, result, limitations, approval status, version and next review trigger. A reader should be able to understand not only what was concluded but why it was reasonable at the time.

Use plain language for decisions and reserve technical notation for places where it improves precision. Link every conclusion to the evidence that supports it. Where a source is secondary, old, proprietary or outside the applicable jurisdiction, note that limitation. Never silently turn a typical value, worked example, recommendation or software default into a mandatory requirement.

Handover and continual improvement

Before closing the work, identify what remains uncertain and who owns it. Transfer calculations, source records, models, approvals, test evidence, open actions and operating limits together. Agree how future users will recognise that the context has changed. Typical triggers include a new requirement, changed load or population, supplier or software revision, incident, repeated exception, capability shift, audit finding or adverse trend.

At the next review, compare the original assumptions with actual outcomes. Retain decisions that remain supported, correct weak controls and retire content that no longer reflects current practice. This feedback step converts a static article or template into a learning system and prevents old examples from becoming accidental policy.

Continue learning

The Fundamental Unit of a Real Quadratic FieldGuide · Engineering MathematicsNEXT LESSON →Computing the Structure of Residue RingsGuide · Engineering MathematicsReduction of Indefinite Forms and the Cycle StructureGuide · Engineering MathematicsThe Maximal Order ProblemGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®