Gauss composition law

In mathematics, in number theory, Gauss composition law is a rule, invented by Carl Friedrich Gauss, for performing a binary operation on integral binary quadratic forms (IBQFs). Gauss presented this rule in his Disquisitiones Arithmeticae,[1] a textbook on number theory published in 1801, in Articles 234 - 244. Gauss composition law is one of the deepest results in the theory of IBQFs and Gauss's formulation of the law and the proofs its properties as given by Gauss are generally considered highly complicated and very difficult.[2] Several later mathematicians have simplified the formulation of the composition law and have presented it in a format suitable for numerical computations. The concept has also found generalisations in several directions.

## Contents

* 1 Integral binary quadratic forms
* 1.1 Equivalence of IBQFs
* 2 Gauss's formulation of the composition law
* 2.1 Historical context
* 2.2 The composition law of IBQFs
* 2.3 Example
* 3 An algorithm to find the composite of two IBQFs
* 3.1 Algorithm
* 4 Properties of the composition law
* 4.1 Existence of the composite
* 4.2 Equivalent forms and the composition law
* 4.3 A binary operation
* 4.4 The group GD
* 5 Modern approach to the composition law
* 5.1 Quadratic algebraic numbers and integers
* 5.2 Ideals in quadratic fields
* 5.3 Some special ideals
* 5.4 An equivalence relation in the set of ideals
* 5.5 Binary quadratic forms and classes of ideals
* 6 Bhargava's approach to the composition law
* 7 References

## Integral binary quadratic forms

An expression of the form Q(x,y)=αx2+βxy+γy2, where α,β,γ,x,y are all integers, is called an integral binary quadratic form (IBQF). The form Q(x,y) is called a primitive IBQF if α,β,γ are relatively prime. The quantity Δ=β2−4αγ is called the discriminant of the IBQF Q(x,y). An integer Δ is the discriminant of some IBQF if and only if Δ≡0,1(mod4). Δ is called a fundamental discriminant if and only if one of the following statements holds

* Δ≡1(mod4) and is square-free,
* Δ=4m where m=2 or 3(mod4) and m is square-free.

If Δ<0 and α>0 then Q(x,y) is said to be positive definite; if Δ<0 and α<0 then Q(x,y) is said to be negative definite; if Δ>0 then Q(x,y) is said to be indefinite.

### Equivalence of IBQFs

Two IBQFs g(x,y) and h(x,y) are said to be equivalent (or, properly equivalent) if there exist integers α, β, γ, δ such that

αδ−βγ=1 and g(αx+βy,γx+δy)=h(x,y).

The notation g(x,y)∼h(x,y) is used to denote the fact that the two forms are equivalent. The relation "∼" is an equivalence relation in the set of all IBQFs. The equivalence class to which the IBQF g(x,y) belongs is denoted by [g(x,y)].

Two IBQFs g(x,y) and h(x,y) are said to be improperly equivalent if

αδ−βγ=−1 and g(αx+βy,γx+δy)=h(x,y).

The relation in the set of IBQFs of being improperly equivalent is also an equivalence relation.

It can be easily seen that equivalent IBQFs (properly or improperly) have the same discriminant.

## Gauss's formulation of the composition law

### Historical context

The following identity, called Brahmagupta identity, was known to the Indian mathematician Brahmagupta (598–668) who used it to calculate successively better fractional approximations to square roots of positive integers:

(x2+Dy2)(u2+Dv2)=(xu+Dyv)2+D(xv−yu)2

Writing f(x,y)=x2+Dy2 this identity can be put in the form

f(x,y)f(u,v)=f(X,Y) where X=xu+Dyv,Y=xv−yu.

Gauss's composition law of IBQFs generalises this identity to an identity of the form g(x,y)h(u,v)=F(X,Y) where g(x,y),h(x,y),F(X,Y) are all IBQFs and X,Y are linear combinations of the products xu,xv,yu,yv.

### The composition law of IBQFs

Consider the following IBQFs:

g(x,y)=ax2+bxy+cy2
h(x,y)=dx2+exy+fy2
F(x,y)=Ax2+Bxy+Cy2

If it is possible to find integers p,q,r,s and p′,q′,r′,s′ such that the following six numbers

pq′−qp′,pr′−rp′,ps′−sp′,qr′−rq′,qs′−sq′,rs′−sr′

have no common divisors other than ±1, and such that if we let

X=pxu+qxv+ryu+syv
Y=p′xu+q′xv+r′yu+s′yv

the following relation is identically satisfied

g(x,y)h(u,v)=F(X,Y),

then the form F(x,y) is said to be a composite of the forms g(x,y) and h(x,y). It may be noted that the composite of two IBQFs, if it exists, is not unique.

### Example

Consider the following binary quadratic forms:

g(x,y)=2x2+3xy−10y2
h(x,y)=5x2+3xy−4y2
F(x,y)=10x2+3xy−2y2

Let

[p,q,r,s]=[1,0,0,2],[p′,q′,r′,s′]=[0,2,5,3]

We have

pq′−qp′=2,pr′−rp′=5,ps′−sp′=3,qr′−rq′=0,qs′−sq′=4,rs′−sr′=10.

These six numbers have no common divisors other than ±1. Let

X=pxu+qxv+ryu+syv=xu+2yv,
Y=p′xu+q′xv+r′yu+s′yv=2xv+5yu+3yv.

Then it can be verified that

g(x,y)h(u,v)=F(X,Y).

Hence F(x,y) is a composite of g(x,y) and h(x,y).

## An algorithm to find the composite of two IBQFs

The following algorithm can be used to compute the composite of two IBQFs.[3]

### Algorithm

Given the following IBQFs having the same discriminant Δ:

f1(x,y)=a1x2+b1xy+c1y2
f2(x,y)=a2x2+b2xy+c2y2
Δ=b12−4a1c1=b22−4a2c2

1. Compute β=b1+b22
2. Compute n=gcd⁡(a1,a2,β)
3. Compute t,u,v such that a1t+a2u+βv=n
4. Compute A=a1a2n2
5. Compute B=a1b2t+a2b1u+v(b1b2+Δ)/2n
6. Compute C=B2−Δ4A
7. Compute F(x,y)=Ax2+Bxy+Cy2
8. Compute

X=nx1x2+(b2−B)n2a2x1y2+(b1−B)n2a1y1x1+[b1b2+Δ−B(b1+b2)]n4a1a2y1y2
Y=a1nx1y2+a2ny1x1+b1+b22ny1y2

Then F(X,Y)=f1(x1,y1)f2(x2,y2) so that F(x,y) is a composite of f1(x,y) and f2(x,y).

## Properties of the composition law

### Existence of the composite

The composite of two IBQFs exists if and only if they have the same discriminant.

### Equivalent forms and the composition law

Let g(x,y),h(x,y),g′(x,y),h′(x,y) be IBQFs and let there be the following equivalences:

g(x,y)∼g′(x,y)
h(x,y)∼h′(x,y)

If F(x,y) is a composite of g(x,y) and h(x,y), and F′(x,y) is a composite of g′(x,y) and h′(x,y), then

F(x,y)∼F′(x,y).

### A binary operation

Let D be a fixed integer and consider set SD of all possible primitive IBQFs of discriminant D. Let GD be the set of equivalence classes in this set under the equivalence relation "∼". Let [g(x,y)] and [h(x,y)] be two elements of GD. Let F(x,y) be a composite of the IBQFs g(x,y) and h(x,y) in SD. Then the following equation

[g(x,y)]∘[h(x,y)]=[F(x,y)]

defines a well-defined binary operation "∘" in GD.

### The group GD

* The set GD is a finite abelian group under the binary operation ∘.

* The identity element in the group GD = {[x2−(D/4)y2] if D≡0(mod4)[x2+xy+((1−D)/4)y2] if D≡1(mod4)

* The inverse of [ax2+bxy+cy2] in GD is [ax2−bxy+cy2].

## Modern approach to the composition law

The following sketch of the modern approach to the composition law of IBQFs is based on a monograph by Duncan A. Buell.[4] The book may be consulted for further details and for proofs of all the statements made hereunder.

### Quadratic algebraic numbers and integers

Let ℤ be the set of integers. Hereafter, in this section, elements of ℤ will be referred as rational integers to distinguish them from algebraic integers to be defined below.

A complex number α is called a quadratic algebraic number if it satisfies an equation of the form

ax2+bx+c=0 where a,b,c∈ℤ.

α is called a quadratic algebraic integer if it satisfies an equation of the form

x2+bx+c=0 where b,c∈ℤ

The quadratic algebraic numbers are numbers of the form

α=−b+ed2a where a,b,d,e∈ℤ and d has no square factors other than 1.

The integer d is called the radicand of the algebraic integer α. The norm of the quadratic algebraic number α is defined as

N(α)=(b2+e2d)/4a2.

Let ℚ be the field of rational numbers. The smallest field containing ℚ and a quadratic algebraic number α is the quadratic field containing α and is denoted by ℚ(α). This field can be shown to be

ℚ(α)=ℚ(d)={t+ud|t,u∈ℚ}

The discriminant Δ of the field ℚ(d) is defined by

Δ={4d if d≡2 or 3(mod4)d if d≡1(mod4)

Let d≠1 be a rational integer without square factors (except 1). The set of quadratic algebraic integers of radicand d is denoted by O(d). This set is given by

O(d)={{a+bd|a,b∈ℤ} if d≡2 or 3(mod4){(a+bd)/2|a,b∈ℤ,a≡bmod2)} if d≡1(mod4)}

O(d) is a ring under ordinary addition and multiplication. If we let

δ={−d if δ is even(1−d)/2 if δ is odd

then

O(d)={a+bδ,|,a,b∈ℤ}.

### Ideals in quadratic fields

Let 𝐚 be an ideal in the ring of integers O(d); that is, let 𝐚 be a nonempty subset of O(d) such that for any α,β∈𝐚 and any λ,μ∈O(d), λα+μβ∈𝐚. (An ideal 𝐚 as defined here is sometimes referred to as an integral ideal to distinguish from fractional ideal to be defined below.) If 𝐚 is an ideal in O(d) then one can find α1,α2∈O(d) such any element in 𝐚 can be uniquely represented in the form α1x+α2y with x,y∈ℤ. Such a pair of elements in O(d) is called a basis of the ideal 𝐚. This is indicated by writing 𝐚=⟨α1,α2⟩. The norm of 𝐚=⟨α1,α2⟩ is defined as

N(𝐚)=|α1α2‾−α1‾α2|/Δ.

The norm is independent of the choice of the basis.

### Some special ideals

* The product of two ideals 𝐚=⟨α1,α2⟩ and 𝐛=⟨β1,β2⟩, denoted by 𝐚𝐛, is the ideal generated by the ℤ-linear combinations of α1β1,α1β2,α2β1,α2β2.

* A fractional ideal is a subset I of the quadratic field ℚ(Δ) for which the following two properties hold:

1. For any α,β∈I and for any λ,μ∈O(d), λα+μβ∈I.
2. There exists a fixed algebraic integer ν such that for every α∈I, να∈O(d).

* An ideal 𝐚 is called a principal ideal if there exists an algebraic integer α such that 𝐚={λα|λ∈O(d)}. This principal ideal is denoted by (α).

There is this important result: "Given any ideal (integral or fractional) 𝐚, there exists an integral ideal 𝐛 such that the product ideal 𝐚𝐛 is a principal ideal."

### An equivalence relation in the set of ideals

Two (integral or fractional) ideals 𝐚 and 𝐛 ares said to be equivalent, dented 𝐚∼𝐛, if there is a principal ideal (α) such that 𝐚=(α)𝐛. These ideals are narrowly equivalent if the norm of α is positive. The relation, in the set of ideals, of being equivalent or narrowly equivalent as defined here is indeed an equivalence relation.

The equivalence classes (respectively, narrow equivalence classes) of fractional ideals of a ring of quadratic algebraic integers O(d) form an abelian group under multiplication of ideals. The identity of the group is the class of all principal ideals (respectively, the class of all principal ideals (α) with N(α)>0). The groups of classes of ideals and of narrow classes of ideals are called the class group and the narrow class group of the ℚ(d).

### Binary quadratic forms and classes of ideals

The main result that connects the IBQFs and classes of ideals can now be stated as follows:

"The group of classes of binary quadratic forms of discriminant Δ is isomorphic to the narrow class group of the quadratic number field ℚ(Δ)."

## Bhargava's approach to the composition law

Bhargava cube with the integers a, b, c, d, e, f, g, h at the corners

Manjul Bhargava, a Canadian-American Fields Medal winning mathematician introduced a configuration, called a Bhargava cube, of eight integers a,b,c,d,e,f (see figure) to study the composition laws of binary quadratic forms and other such forms. Defining matrices associated with the opposite faces of this cube as given below

M1=[abcd],N1=[efgh],M2=[aceg],N2=[bdfh],M3=[aebf],N3=[cgdh],

Bhargava constructed three IBQFs as follows:

Q1=−det⁡(M1x+N1y),Q2=−det⁡(M2x+N2y)Q3=−det⁡(M3x+N3y)

Bhargava established the following result connecting a Bhargava cube with the Gauss composition law:[5]

"If a cube A gives rise to three primitive binary quadratic forms Q1, Q2, Q3, then Q1, Q2, Q3 have the same discriminant, and the product of these three forms is the identity in the group defined by Gauss composition. Conversely, if Q1, Q2, Q3 are any three primitive binary quadratic forms of the same discriminant whose product is the identity under Gauss composition, then there exists a cube A yielding Q1, Q2, Q3."

## References

1. ↑ Carl Friedrich Gauss (English translation by Arthur A. Clarke) (1965). Disquisitiones Arithmeticae. Yale University Press. ISBN 978-0300094732.
2. ↑ D. Shanks (1989). Number theory and applications, volume 265 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci.. Dordrecht: Kluwer Acad. Publ.. pp. 163 - 178, 179 - 204.
3. ↑ Duncan A. Buell (1989). Binary Quadratic Forms: Classical Theory and Modern Computations. New York: Springer-Verlag. pp. 62–63. ISBN 978-1-4612-8870-1.
4. ↑ Duncan A. Buell (1989). Binary Quadratic Forms: Classical Theory and Modern Computations. New York: Springer-Verlag. ISBN 978-1-4612-8870-1.
5. ↑ Manjul Bhargava (2006). Higher composition laws and applications, in Proceedings of the International Congress of Mathematicians, Madrid, Spain, 2006. European Mathematical Society.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Gauss composition law. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Gauss_composition_law&oldid=2590358"