= Reduced positive definite binary quadratic form
{title2=$|b|\leq a\leq c$}
An integral <binary quadratic form> $[a,b,c]$ with $a>0$ and negative <discriminant of a binary quadratic form> is reduced when
$$
|b|\leq a\leq c,
$$
with the additional convention $b\geq0$ whenever $|b|=a$ or $a=c$. 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.<Binary Quadratic Forms and the Ideal Class Group by Seth Viren Neel>[§2.2, Definition 1 and Theorem 2.3, printed p. 5: primitive positive definite reduction and uniqueness]{ref}
The sign rule removes actual duplicates. A shear takes $[a,a,c]$ to $[a,-a,c]$, and the determinant-one rotation $(x,y)\mapsto(-y,x)$ takes $[a,b,a]$ to $[a,-b,a]$. Keeping the nonnegative middle <polynomial coefficient> chooses one boundary copy. For example, $[1,2,2]$ is not reduced; the <reduction algorithm for a positive definite binary quadratic form> takes it back to $[1,0,1]$.
Back to article page