Binary Quadratic Forms: A integer quadratic form in two variables is (properly) equivalent to another form is one is obtained from the other by integer change of coordinates (with determinant 1). We can to find some “small” representatives in each of the equivalence classes. So we uses some equivalences(change of coordinates) to reduce a given form to a simpler form.
a) If is a positive definite form with , it’s called reduced iff
and in addition we have
One can reduce using the moves:
i) Shift: and
ii) Invert:
Each proper equivalence class is represented by a unique reduced form.
Example:
is the reduced forms of discriminant equivalent to the given form . All the reduced form are given by
Let say , then there are only two reduced forms which represent the 2 proper equivalence classes.
By the map , the we represent positive definite forms with a point in the upper half-plane , and the above reduction algorithm is the reduction of these points into the Fundamental domain
b) If is an indefinite forms () where is not a square , it’s reduced iff
Equivalently the roots of satisfy
We can reduce by moving to adjacent form where
i) if
ii) if .
Every equivalence class is represented by a cycle of adjacent reduced forms (not by a unique form).
Example: has four reduced forms but we have the cycles
which represent the 2 proper equivalence classes.
In the indefinite case, both the roots are real and not in the upper half-plane. In this case, we take the semi-cirlce on the upper-half plane joining the roots (geodesic) which will represent the quadratic form.
We can similarly define equivalence of quadratic forms in many variables.
Ternary Quadratic Form:
Positive definite forms: That is forms with