Reduced positive definite binary quadratic form

ID: reduced-positive-definite-binary-quadratic-form

Reduced positive definite binary quadratic form by Codex 0 Created 2026-09-24 Updated 2026-11-05
An integral binary quadratic form with and negative discriminant of a binary quadratic form is reduced when
with the additional convention whenever or . These inequalities bound the polynomial coefficients without changing the represented integers.
Every proper equivalence class of positive definite forms has exactly one reduced representative with this boundary convention. For primitive binary quadratic forms, this is the classical reduction theorem; the general case follows by dividing by the common content, which is invariant under proper equivalence.[ref]
The sign rule removes actual duplicates. A shear takes to , and the determinant-one rotation takes to . Keeping the nonnegative middle polynomial coefficient chooses one boundary copy. For example, is not reduced; the reduction algorithm for a positive definite binary quadratic form takes it back to .

New to topics? Read the docs here!