Discriminant quadratic modules are finite quadratic structures derived from the dual quotient of an integral lattice associated with binary quadratic forms.
They feature explicit quadratic and bilinear forms that enable unique orthogonal decompositions and link discriminants to class groups via Gauss composition.
Research covers lattice realizations, arithmetic applications, and cryptographic methods that exploit module properties to bridge forms of different discriminants.
A discriminant quadratic module is the finite quadratic object attached to an integral quadratic form or lattice through its dual quotient. For a binary quadratic form
q(x,y)=ax2+bxy+cy2,
with discriminant
disc(q)=D:=b2−4ac,
one associates the lattice Lq=Z2 equipped with the bilinear form determined by a,b,c, its dual lattice Lq∗, and the finite abelian group
Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.
This group carries a quadratic form and an associated bilinear form, yielding what the literature also calls a finite quadratic module. In the abstract setting, a finite quadratic module is a finite abelian group M together with a nondegenerate quadratic form Q:M→Q/Z. These constructions organize the passage between forms of discriminant D and Df2, the class groups of quadratic orders, and explicit realizations by even lattices (Arnault, 2014, Zhu, 2021).
1. Binary quadratic forms, discriminants, and the module disc(q)=D:=b2−4ac,0
A binary quadratic form is a homogeneous polynomial
disc(q)=D:=b2−4ac,1
with disc(q)=D:=b2−4ac,2. Its discriminant is
disc(q)=D:=b2−4ac,3
and the standing assumptions in the arithmetic setting are that disc(q)=D:=b2−4ac,4 is non-square and congruent to disc(q)=D:=b2−4ac,5 or disc(q)=D:=b2−4ac,6. The form is primitive if disc(q)=D:=b2−4ac,7 (Arnault, 2014).
From such a form one defines the integral lattice disc(q)=D:=b2−4ac,8 with bilinear form
disc(q)=D:=b2−4ac,9
Its dual lattice is
Lq=Z20
and the discriminant module is the finite abelian group
Lq=Z21
The module carries a quadratic form
Lq=Z22
and an associated bilinear form
Lq=Z23
This realizes the discriminant as a finite quadratic datum rather than only an integer invariant. When Lq=Z24 varies through proper equivalence classes with fixed discriminant Lq=Z25, the resulting arithmetic structure is compatible with Gauss composition; in the same framework, proper equivalence classes of primitive forms of discriminant Lq=Z26 correspond to the ideal class group Lq=Z27 of the quadratic order Lq=Z28 (Arnault, 2014).
2. Finite quadratic modules in the abstract sense
Let Lq=Z29 be a finite abelian group written additively. A quadratic form on a,b,c0 is a map
a,b,c1
satisfying two conditions:
a,b,c2 in a,b,c3 for all integers a,b,c4 and all a,b,c5.
The associated map
a,b,c6
is a,b,c7-bilinear and symmetric.
The pair a,b,c8 is a finite quadratic module if, in addition, a,b,c9 is nondegenerate in the strong sense that the map
Lq∗0
is an isomorphism of finite Lq∗1-modules (Zhu, 2021).
Several basic consequences are stated explicitly. Nondegeneracy implies in particular that Lq∗2 and that Lq∗3. The literature also uses the bilinear notation Lq∗4, but the quadratic datum Lq∗5 is finer and is forced by even lattices. This is relevant when comparing the lattice-theoretic convention Lq∗6 with the abstract convention Lq∗7: both encode a finite quadratic structure, but the precise target depends on the normalization adopted in the source (Zhu, 2021).
3. Orthogonal decomposition and indecomposable building blocks
The main structure theorem states that every finite quadratic module Lq∗8 decomposes uniquely, up to isometry, as an orthogonal sum of indecomposable Lq∗9-primary modules. Moreover, each Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.0-primary summand decomposes uniquely into orthogonal indecomposables of standard types (Zhu, 2021).
For odd primes Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.1, the indecomposable modules are cyclic:
Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.2
where Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.3 and Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.4. These have order Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.5, and varying Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.6 modulo squares in Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.7 gives two isometry classes for each Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.8.
For Aq=Lq∗/Lq,∣Aq∣=∣disc(q)∣.9, four families are required. The cyclic case is
M0
with M1 odd. In addition there are two non-cyclic indecomposable families:
M2
and
M3
The decomposition proof proceeds through primary decomposition, splitting off cyclic summands for M4, and a more delicate cyclic-or-binary splitting for M5 via explicit congruence arguments.
A notable nuance is that the exposition also states that uniqueness of decomposition fails in general, citing Wall’s relations and giving M6 with M7 as an example of two non-equivalent splittings into copies of M8. This indicates that canonical orthogonal decompositions and arbitrary splittings should not be conflated (Zhu, 2021).
4. Embedded discriminants, semi-equivalence, and the map M9
Fix an integer Q:M→Q/Z0. Given a primitive form
Q:M→Q/Z1
of discriminant Q:M→Q/Z2 with Q:M→Q/Z3, define
Q:M→Q/Z4
In matrix notation, with
Q:M→Q/Z5
this is written Q:M→Q/Z6, and
Q:M→Q/Z7
More generally, if Q:M→Q/Z8, then
Q:M→Q/Z9
Thus the discriminant changes by a square under integral change of variables with determinant different from D0 (Arnault, 2014).
For D1, define
D2
and
D3
If D4, then
D5
with
D6
Exactly
D7
distinct primitive lifts occur, where D8 is the Kronecker symbol.
The paper introduces semi-equivalence for primitive forms D9 of discriminant Df20: they are semi-equivalent if there exist primitive forms Df21 of discriminant Df22 with Df23 under Df24-equivalence, integers Df25, and matrices Df26 such that
Df27
A central result is Theorem 2.11 of Arnault: if Df28 is a discriminant and Df29 an odd prime, then the map
disc(q)=D:=b2−4ac,00
sending the class of disc(q)=D:=b2−4ac,01 to the class of any disc(q)=D:=b2−4ac,02 with disc(q)=D:=b2−4ac,03, is well-defined and surjective. Under the standard bijection between proper equivalence classes of primitive forms and ideal classes, this recovers the natural surjection
disc(q)=D:=b2−4ac,04
At the discriminant-module level, the same lift produces a chain of lattices
disc(q)=D:=b2−4ac,05
and an exact sequence
disc(q)=D:=b2−4ac,06
compatible with the quadratic forms. This exhibits disc(q)=D:=b2−4ac,07 as a quotient of disc(q)=D:=b2−4ac,08 (Arnault, 2014).
5. Realization by even lattices of minimal rank
For any indecomposable finite quadratic module disc(q)=D:=b2−4ac,09, one can construct an even lattice disc(q)=D:=b2−4ac,10, and also a positive-definite lattice, of the least rank whose discriminant module is disc(q)=D:=b2−4ac,11. The constructions are explicit: the lattices are given by Gram matrices over disc(q)=D:=b2−4ac,12 (Zhu, 2021).
For the odd-primary cyclic modules disc(q)=D:=b2−4ac,13, the minimal rank depends on disc(q)=D:=b2−4ac,14, on the parity of disc(q)=D:=b2−4ac,15, and on the congruence class of disc(q)=D:=b2−4ac,16. If disc(q)=D:=b2−4ac,17, rank disc(q)=D:=b2−4ac,18 suffices. If disc(q)=D:=b2−4ac,19 and disc(q)=D:=b2−4ac,20 is even, rank disc(q)=D:=b2−4ac,21 still suffices. If disc(q)=D:=b2−4ac,22, disc(q)=D:=b2−4ac,23 is odd, and disc(q)=D:=b2−4ac,24, rank disc(q)=D:=b2−4ac,25 again suffices. If disc(q)=D:=b2−4ac,26, disc(q)=D:=b2−4ac,27 is odd, and disc(q)=D:=b2−4ac,28, no rank disc(q)=D:=b2−4ac,29 lattice can realize the module, and rank disc(q)=D:=b2−4ac,30 is used.
For the disc(q)=D:=b2−4ac,31-primary cyclic modules disc(q)=D:=b2−4ac,32, the rank depends on disc(q)=D:=b2−4ac,33. If disc(q)=D:=b2−4ac,34, rank disc(q)=D:=b2−4ac,35 suffices, with Gram matrix disc(q)=D:=b2−4ac,36. If disc(q)=D:=b2−4ac,37 and disc(q)=D:=b2−4ac,38 is odd, a rank disc(q)=D:=b2−4ac,39 model is constructed. If disc(q)=D:=b2−4ac,40 and disc(q)=D:=b2−4ac,41 is even, a rank disc(q)=D:=b2−4ac,42 model is constructed. For the non-cyclic modules disc(q)=D:=b2−4ac,43 and disc(q)=D:=b2−4ac,44, rank disc(q)=D:=b2−4ac,45 lattices are exhibited explicitly.
To pass to positive-definite models, the construction uses Milgram’s formula
disc(q)=D:=b2−4ac,46
From the resulting signature congruence, the minimal positive dimension is determined, and explicit positive-definite Gram matrices are then written down for the indecomposables. The stated ranks include disc(q)=D:=b2−4ac,47-dimensional models for certain disc(q)=D:=b2−4ac,48, rank disc(q)=D:=b2−4ac,49 or disc(q)=D:=b2−4ac,50 in odd-disc(q)=D:=b2−4ac,51 cases, and rank disc(q)=D:=b2−4ac,52, or disc(q)=D:=b2−4ac,53 for disc(q)=D:=b2−4ac,54, disc(q)=D:=b2−4ac,55, and disc(q)=D:=b2−4ac,56.
Small examples illustrate the general theory. The module disc(q)=D:=b2−4ac,57 is realized by the rank disc(q)=D:=b2−4ac,58 lattice with Gram matrix disc(q)=D:=b2−4ac,59. The module disc(q)=D:=b2−4ac,60, with disc(q)=D:=b2−4ac,61, is realized by the positive-definite rank disc(q)=D:=b2−4ac,62 lattice
disc(q)=D:=b2−4ac,63
The binary disc(q)=D:=b2−4ac,64-groups disc(q)=D:=b2−4ac,65 and disc(q)=D:=b2−4ac,66 are likewise realized by explicit root-lattice-type constructions (Zhu, 2021).
6. Arithmetic applications, worked example, and terminological distinction
A concrete embedded-discriminant example takes
disc(q)=D:=b2−4ac,67
for which
disc(q)=D:=b2−4ac,68
With disc(q)=D:=b2−4ac,69,
disc(q)=D:=b2−4ac,70
and
disc(q)=D:=b2−4ac,71
Since disc(q)=D:=b2−4ac,72, the lifted form disc(q)=D:=b2−4ac,73 is primitive, and under Gauss composition the class of disc(q)=D:=b2−4ac,74 maps to that of disc(q)=D:=b2−4ac,75 (Arnault, 2014).
The same framework is used in cryptography and computational number theory. Systems such as NICE use forms of discriminant disc(q)=D:=b2−4ac,76 and disc(q)=D:=b2−4ac,77. The lift from disc(q)=D:=b2−4ac,78 to disc(q)=D:=b2−4ac,79 with disc(q)=D:=b2−4ac,80 allows key-generation and encryption in the larger group disc(q)=D:=b2−4ac,81, while decryption recovers classes in disc(q)=D:=b2−4ac,82. The cited attacks exploit semi-equivalence classes and the explicit description of the kernel of
disc(q)=D:=b2−4ac,83
Several factorization algorithms, including those of Shanks, Schnorr–Lenstra, and Buchmann–Jakobi, are described as moving between forms of smaller and larger discriminant through the disc(q)=D:=b2−4ac,84-lifts and tracking the kernel size disc(q)=D:=b2−4ac,85. In lattice theory, discriminant modules encode the glue between primitive sublattices in the classification of even integral lattices, and the explicit constructions are used to produce concrete examples of Jacobi forms of lattice index via their Weil representations (Zhu, 2021).
A recurring terminological confusion is with Quadratic Discriminant Analysis. In statistical learning, Quadratic Discriminant Analysis assumes class-conditional Gaussian distributions and uses discriminant functions of the form
disc(q)=D:=b2−4ac,86
with quadratic decision boundaries when the class covariances differ (Ghojogh et al., 2019). This terminology should be distinguished from the arithmetic and lattice-theoretic discriminant quadratic module: the former concerns probabilistic classification, whereas the latter concerns finite quadratic structures attached to lattices, quadratic forms, and discriminants.