Golden field

From HandWiki
Short description: Rational numbers with √5 added

In mathematics, Template:Q(√5),[1] sometimes called the golden field,[2] is a number system consisting of the set of all numbers a+b5, where a and b are both rational numbers and 5 is the square root of 5, along with the basic arithmetical operations (addition, subtraction, multiplication, and division). Because its arithmetic behaves, in certain ways, the same as the arithmetic of , the field of rational numbers, Template:Q(√5) is a field. More specifically, it is a real quadratic field, the extension field of generated by combining rational numbers and 5 using arithmetical operations. The name comes from the golden ratio φ, a positive number satisfying the equation φ2=φ+1, which is the fundamental unit of Template:Q(√5).

Calculations in the golden field can be used to study the Fibonacci numbers and other topics related to the golden ratio, notably the geometry of the regular pentagon and higher-dimensional shapes with fivefold symmetry.

Basic arithmetic

Elements of the golden field are those numbers which can be written in the form a+b5 where a and b are uniquely determined[3] rational numbers, or in the form (a+b5)/c where a, b, and c are integers, which can be uniquely reduced to lowest terms, and where 5=2.236 is the square root of 5.[4] It is sometimes more convenient instead to use the form a+bφ where a and b are rational or the form (a+bφ)/c where a, b, and c are integers, and where φ=12(1+5)=1.618 is the golden ratio.[5][6]

Converting between these alternative forms is straight-forward: a+b5=(ab)+(2b)φ or, in the other direction, a+bφ=(a+12b)+(12b)5.[7]

To add or subtract two numbers, simply add or subtract the components separately:[8] (a1+b15)+(a2+b25)=(a1+a2)+(b1+b2)5,(a1+b1φ)+(a2+b2φ)=(a1+a2)+(b1+b2)φ.

To multiply two numbers, distribute:[8] (a1+b15)(a2+b25)=(a1a2+5b1b2)+(a1b2+b1a2)5,(a1+b1φ)(a2+b2φ)=(a1a2+b1b2)+(a1b2+b1a2+b1b2)φ.

To find the reciprocal of a number α, rationalize the denominator: 1/α=α/αα=α/N(α), where α is the algebraic conjugate and N(α) is the field norm, as defined below.[9] Explicitly: 1a+b5=1a+b5ab5ab5=aa25b2ba25b25,1a+bφ=1a+bφa+bbφa+bbφ=a+ba2+abb2ba2+abb2φ.

To divide two numbers, multiply the first by second's reciprocal:[9] a1+b15a2+b25=a1a25b1b2a225b22+a1b2+b1a2a225b225,a1+b1φa2+b2φ=a1a2+a1b2b1b2a22+a2b2b22+a1b2+b1a2a22+a2b2b22φ.

As in any field, addition and multiplication of numbers in Template:Q(√5) is associative and commutative; 0 is the additive identity and 1 is the multiplicative identity; every number α has an additive inverse α and a multiplicative inverse 1/α; and multiplication distributes over addition. Arithmetic between numbers in Template:Q(√5) is consistent with their arithmetic as real numbers; that is, Template:Q(√5) is a subfield of .

Conjugation and norm

The numbers 5 and 5 each solve the equation x2=5. Each number α=a+b5 in Template:Q(√5) has an algebraic conjugate α found by swapping these two square roots of 5, i.e., by changing the sign of b. The conjugate of φ is φ=12(15)=φ1=1φ. A rational number is its own conjugate, a=a. In general, the conjugate is:[10] a+b5=ab5,a+bφ=a+bφ=(a+b)bφ. Conjugation in Template:Q(√5) is an involution, (α)=α, and it preserves the structure of arithmetic: α1+α2=α1+α2; α1α2=α1α2; and α1/α2=α1/α2.[11] Conjugation is the only ring homomorphism (function preserving the structure of addition and multiplication) from Template:Q(√5) to itself, other than the identity function.[12]

The field trace is the sum of a number and its conjugates (so-called because multiplication by an element in the field can be seen as a kind of linear transformation, the trace of whose matrix is the field trace).[13] The trace of α in Template:Q(√5) is tr(α)=α+α: tr(a+b5)=(a+b5)+(ab5)=2a,tr(a+bφ)=(a+bφ)+(a+bbφ)=2a+b. This is always an (ordinary) rational number.[11]

The field norm is a measure of a number's magnitude, the product of the number and its conjugates.[14] The norm of α in Template:Q(√5) is N(α)=αα:[11] N(a+b5)=a25b2,N(a+bφ)=a2+abb2. This is also always a rational number.[11]

The norm preserves the structure of multiplication, as expected for a concept of magnitude. The norm of a product is the product of norms, N(α1α2)=N(α1)N(α2); and the norm of a quotient is the quotient of the norms, N(α1/α2)=N(α1)/N(α2). A number and its conjugate have the same norm, N(α)=N(α);[11]

A number α in Template:Q(√5) and its conjugate α are the solutions of the quadratic equation[11] (xα)(xα)=x2tr(α)x+N(α)=0.

In Galois theory, the golden field can be considered more abstractly as the set of all numbers a+bu, where a and b are both rational, and all that is known of u is that it satisfies the equation u2=5. There are two ways to embed this set in the real numbers: by mapping u to the positive square root 5 or alternatively by mapping u to the negative square root 5. Conjugation exchanges these two embeddings. The Galois group of the golden field is thus the group with two elements, namely the identity and an element which is its own inverse.[14]

Golden integers

One convenient way to plot Z[φ] is as a lattice in the real coordinate plane. The so-called canonical embedding represents the number α by the point with coordinates Template:Pars. Numbers with the same norm lie on hyperbolas (orange and green lines).
The logarithmic embedding into the plane represents the (non-zero) number α by the point with coordinates Template:Pars – See Log–log plot. Multiplication in the golden field corresponds to vector addition in the embedding. Numbers whose norm has the same absolute value lie on diagonal lines.

The ring of integers of the golden field, [φ], sometimes called the golden integers,[15] is the set of all algebraic integers in the field, meaning those elements whose minimal polynomial over has integer coefficients. These are the set of numbers in Template:Q(√5) whose norm and trace are integers. The numbers 1 and φ form an integral basis for the ring, meaning every number in the ring can be written in the form a+bφ where a and b are ordinary integers.({{{1}}}, {{{2}}}) Alternately, elements of [φ] can be written in the form 12a+12b5, where a and b have the same parity.[16] Like any ring, [φ] is closed under addition and multiplication. Template:Q(√5) is the smallest field containing [φ], its field of fractions.

Norms

The set of all norms of golden integers includes every number a2+abb2=N(a+bφ) for ordinary integers a and b.[17] These are precisely the ordinary integers whose ordinary prime factors which are congruent to ±2 modulo 5 occur with even exponents (see § Primes and prime factorization below).[18] The first several non-negative integer norms are:[19]

0, 1, 4, 5, 9, 11, 16, 19, 20, 25, 29, . . ..

The golden integer 0=0+0φ is called zero, and is the only element of [φ] with norm 0.[20]

Divisibility

If α and β are golden integers and there is some golden integer γ such that αγ=β, we say that α divides β, denoted αβ. In many respects, divisibility works similarly as among the ordinary integers, but with some important differences, as will be described in the following subsections.

Because, like the integers, [φ] is an integral domain, the product of two non-zero elements is always non-zero. Thus [φ] has no nontrivial zero divisors, and αβ=0 implies that either α=0 or β=0.

Units

A unit is an algebraic integer which divides 1, i.e. whose multiplicative inverse is also an algebraic integer, which happens when its norm is ±1. Among the ordinary integers, the units are the pair of numbers ±1, but among the golden integers there are infinitely many units: all numbers of the form a+bφ whose integer coefficients a and b solve the Diophantine equation a2+abb2=±1. If a unit is instead written in the form 12a+12b5, its coefficients solve a related Diophantine equation, the generalized Pell's equation a25b2=±4. The fundamental unit – the smallest unit greater than 1 – is the golden ratio φ=12+125 and the other units consist of its positive and negative powers, ±φn, for any integer n.[3] Some powers of φ are:

n 2 1 0 1 2 3 4 n
φn 2φ 1+φ 1 φ 1+φ 1+2φ 2+3φ Fn1+Fnφ

In general φn=Fn1+Fnφ, where Fn is the nth Fibonacci number.[21] The units form the group [φ]× under multiplication, which can be decomposed as the direct product of a cyclic group of order 2 generated by 1 and an infinite cyclic group generated by φ.

Associates

Two golden integers α1 and α2 are associates if each divides the other, α1α2 and α2α1. Equivalently, their quotient in (φ) is a unit, α2=±φnα1 for some integer n. Associateness is an equivalence relation. If α1 divides some golden integer β, then so does its associate α2: if α1β then α2β.

Associates have the same norm, up to sign: |N(α1)|=|N(α2)|. However, not all elements whose norm has the same absolute value are associates; in particular, any golden-integer prime and its conjugate have the same norm, but are associates if and only if they are associated either with 5 or with an ordinary prime.[18]

More generally, two numbers in Template:Q(√5) are associates if their quotient is a unit. The set of associates of any number in Template:Q(√5) is the orbit of any of them under the multiplicative action of the group of units.

Primes and prime factorization

Golden integer units (hollow circles) and primes (filled circles), along with zero (+) and composite numbers (×)[22]

A prime element of a ring, analogous to a prime number among the integers, is an element γ such that whenever γαβ, then either γα or γβ. In [φ] the primes are of three types: 5=1+2φ, integer primes of the form p=5n±2[23] where n is an integer, and the factors of integer primes of the form p=5n±1[24] (a pair of conjugates).[25] For example, 2, 3, and 7 are primes, but 11=(3+φ)(4φ) is composite. Any of these is an associate of additional primes; for example 2φ is also prime, an associate of 2.[22]

The ring [φ] is a Euclidean domain with the absolute value of the norm as its Euclidean function, meaning a version of the Euclidean algorithm can be used to find the greatest common divisor of two numbers.[26] This makes Template:Q(√5) one of the 21 quadratic fields that are norm-Euclidean.[27] A form of the fundamental theorem of arithmetic applies in [φ]: every golden integer can be written as a product of prime elements multiplied by a unit, and this factorization is unique up to the order of the factors and the replacement of any prime factor by one of its associates (which changes the unit factor accordingly).

Ideals

An ideal of [φ] is any subset which "absorbs multiplication", containing every golden-integer multiple of each of its elements. If α is any golden integer, the set of all golden-integer multiples of α, denoted α[φ] or (α), is the ideal generated by α. Every associated element generates the same ideal, but a non-associated element generates a different ideal: that is, (α)=(β) precisely when α=±βφn. Because [φ] is a principal ideal domain, each ideal of [φ] can be generated by a single element. The zero ideal (0) is the single-element set {0}. The ideal (1) is all of [φ].

Various operations can be defined among ideals. If 𝔞 and 𝔟 are ideals of [φ], then 𝔞+𝔟 is the set of all sums of one element in 𝔞 plus one element in 𝔟, and 𝔞𝔟 is the set of all sums of any number of terms, each of which is the product of one element in 𝔞 times one element in 𝔟. 𝔞+𝔟={α+βα𝔞,β𝔟},𝔞𝔟={i=1nαiβi|n,ai𝔞,bi𝔟}. The sum or product of two ideals is itself an ideal. Multiplication of ideals is distributive over addition.

More generally, a fractional ideal of Template:Q(√5) is a subset of Template:Q(√5) with the property that multiplication of each element by some golden integer, the "denominator", results in an ideal of [φ]. If α is any number in Template:Q(√5), the set of golden-integer multiples of α, also denoted α[φ] or (α), is the fractional ideal generated by α. As with integral ideals of [φ], numbers in Template:Q(√5) generate the same fractional ideal if and only if they are associated, and every fractional ideal can be generated by a single element. Multiplication of fractional ideals is consistent with multiplication of their generators. Let (5))× be the multiplicative group of the nonzero elements of (5), and U be the group of the units. The function that maps each element of (5))× to the generated fractional ideal, α(α), induces a group isomorphism between (5))×/U and the group of fractional ideals.

Table of integers

In the table below, positive golden integers have been arranged into rows, with one representative chosen for each class of associates (here the representative is the positive element α in the class for which α+|α| is a minimum).[22]

Matrix representation

Template:Q(√5) is a two-dimensional vector space over , and multiplication by any element of Template:Q(√5) is a linear transformation of that vector space. Given an ordered basis of Template:Q(√5), each number in Template:Q(√5) can be associated to the corresponding transformation matrix in that basis. This defines a field isomorphism (a structure-preserving bijective map) from Template:Q(√5) to the space of 2×2 square matrices with rational entries spanned by the identity matrix 𝐈, the image of the number 1, and a matrix Φ, the image of φ.[28] Thus arithmetic of numbers in Template:Q(√5) can be alternately represented by the arithmetic of such matrices.[29] In this context, the number α=a+bφ is represented by the matrix 𝐀=a𝐈+bΦ.[30] A convenient choice of basis for Template:Q(√5) is (1,φ), in terms of which Φ is a symmetric matrix:[31] 𝐈=[1001],Φ=[0111],𝐀=a𝐈+bΦ=[abba+b].

The adjugate matrix Φ=𝐈Φ represents the algebraic conjugate φ=1φ, the matrix 𝐑=𝐈+2Φ (satisfying 𝐑2=5𝐈) represents 5,[32] and the adjugate of an arbitrary element 𝐀, which we will denote 𝐀=a𝐈+bΦ, represents the number α=a+bφ: 𝐑=[1221],Φ=[1110],𝐀=a𝐈+bΦ=[a+bbba].

Every matrix 𝐀=a𝐈+bΦ, except for the zero matrix, is invertible, and its inverse 𝐀1=(1/det(𝐀))𝐀 represents the multiplicative inverse α1=α/N(α) in Template:Q(√5).[33]

If α=a+bφ is an element of Template:Q(√5), with conjugate α=a+bφ, then the matrix 𝐀=a𝐈+bΦ has the numbers α and α as its eigenvalues. Its trace is tr(𝐀)=2a+b=tr(α).[34] Its determinant is det(𝐀)=a2+abb2=N(α). The characteristic polynomial of 𝐀 is (xα)(xα), which is the minimal polynomial of α and α whenever b is not zero. These properties are shared by the adjugate matrix 𝐀. Their product is 𝐀𝐀=det(𝐀)𝐈.[29][28]

These matrices have especially been studied in the context of the Fibonacci numbers Fn and Lucas numbers Ln, which appear as the entries of Φn and Φn𝐑, respectively: Φn=Fn1𝐈+FnΦ=[Fn1FnFnFn+1],tr(Φn)=Ln,Φn𝐑=Ln1𝐈+LnΦ=[Ln1LnLnLn+1],tr(Φn𝐑)=5Fn. Powers of Φ are sometimes called Fibonacci matrices.[35]

Every matrix of the form a𝐈+bΦ has eigenvectors which point along the directions [1φ] and [1φ].[36] When numbers in Template:Q(√5) are plotted, as above, in a coordinate system where their values as real numbers are the horizontal axis and the values of their conjugates are the vertical axis, the eigenvectors point along those two axes. (Zero is the only number Template:Q(√5) directly on either axis.) The matrices Φ2n for integer n, representing units, and more generally any matrices with a+bφ>0 and determinant 1, are squeeze mappings, which stretch the plane along one axis and squish it along the other, fixing hyperbolas of constant norm. The matrices Φ2n+1 and more generally matrices with a+bφ>0 and determinant 1, are the composition of a squeeze mapping and a vertical reflection. The negative identity matrix 𝐈 is a point reflection across the origin. In general any other matrix a𝐈+bΦ can be decomposed as the product of a squeeze mapping, possibly a reflection, and a uniform scaling by the square root of the absolute value of its determinant.

Other properties

The golden field is the real quadratic field with the smallest discriminant, Δ(5)=5.[37] It has class number 1, which means that the ring of its algebraic integers is a principal ideal domain and a unique factorization domain.[38]

Any positive element of the golden field can be written as a generalized type of continued fraction, in which the partial quotients are sums of non-negative powers of φ.[39]

Fibonacci numbers

The Lucas and Fibonacci numbers are components of φn when written in terms of 1/2 and 1/2√5.[40]

Template:Q(√5) is a natural choice of number system for studying the Fibonacci numbers Fn and the Lucas numbers Ln. These number sequences are usually defined by recurrence relations similar to the one satisfied by the powers of φ and φ: F0=0,F1=1,Fn+1=Fn+Fn1,L0=2,L1=1,Ln+1=Ln+Ln1,φ0=1,φ1=φ,φn+1=φn+φn1,φ0=1,φ1=φ,φn+1=φn+φn1.

The sequences Fn and Ln respectively begin:[41]

n 00 01 02 03 04 05 06 07 08 09 10 11 12
Fn 0 1 1 2 3 5 8 13 21 34 55 89 144
Ln 2 1 3 4 7 11 18 29 47 76 123 199 322

Both sequences can be consistently extended to negative integer indices by following the same recurrence in the negative direction. They satisfy the identities[42] Fn=(1)n+1Fn,Ln=(1)nLn.

The Fibonacci and Lucas numbers can alternately be expressed as the components b and a when a power of the golden ratio or its conjugate is written in the form 12a+12b5:[43] φn=12Ln+12Fn5,φn=12Ln12Fn5.

Binet's formula for Fibonacci numbers plotted in the lattice of golden integers

The expression of the Fibonacci numbers in terms of φ is called Binet's formula:[44]

Fn=φnφnφφ=φnφn5=tr(φn5)5,Ln=φn+φnφ+φ=φn+φn=tr(φn).

The powers of φ or φ, when written in the form a+bφ, can be expressed in terms of just Fibonacci numbers,[45] φn=Fn1+Fnφ,φn=Fn1+Fnφ=Fn+1Fnφ. Powers of φ or φ times 5 can be expressed in terms of just Lucas numbers, φn5=Ln1+Lnφ,φn5=Ln1Lnφ=Ln+1+Lnφ. Statements about golden integers can be recast as statements about the Fibonacci or Lucas numbers; for example, that every power of φ is a unit of [φ], N(φn)=N(φ)n=(1)n, when expanded, becomes Cassini's identity, and likewise N(φn5)=N(φ)nN(5)=(1)n5 becomes the analogous identity about Lucas numbers, (Fn1+Fnφ)(Fn+1Fnφ)=Fn1Fn+1Fn2=(1)n,(Ln1+Lnφ)(Ln+1+Lnφ)=Ln2Ln1Ln+1=(1)n5.

The numbers φn and φn are the roots of the quadratic polynomial x2Lnx+(1)n. This is the minimal polynomial for φn for any non-zero integer n.[46] The quadratic polynomial x25Fnx+(1)n+15 is the minimal polynomial for φn5.[47]

In the limit, consecutive Fibonacci or Lucas numbers approach a ratio of φ, and the ratio of Lucas to Fibonacci numbers approaches 5:[4] limnFn+1Fn=limnLn+1Ln=φ,limnLnFn=5.

Theorems about the Fibonacci numbers – for example, divisibility properties such as if n divides m then Fn divides Fm – can be conveniently proven using Template:Q(√5).[48]

Relation to fivefold symmetry

The golden ratio φ=12(1+5) is the ratio between the lengths of a diagonal and a side of a regular pentagon, so the golden field and golden integers feature prominently in the metrical geometry of the regular pentagon and its symmetry system, as well as higher-dimensional objects and symmetries involving five-fold symmetry.

Euclidean plane

The golden ratio is related to the fifth roots of unity.

Let ζ=exp(2πi/5) be the 5th root of unity, a complex number of unit absolute value spaced 15 of a full turn from 1 around the unit circle, satisfying ζ5=1. Then the fifth cyclotomic field (ζ) is the field extension of the rational numbers formed by adjoining ζ (or equivalently, adjoining any of ζ2, ζ3 or ζ4). Elements of (ζ) are numbers of the form a0+a1ζ+a2ζ2+a3ζ3+a4ζ4, with rational coefficients. (ζ) is of degree four over the rational numbers: any four of the five roots are linearly independent over , but all five sum to zero. However, (ζ) is only of degree two over Template:Q(√5), x51=(x1)(x4+x3+x2+x+1)=(x1)(x2+φx+1)(x2+φx+1)=(x1)(xζ)(xζ4)(xζ2)(xζ3), where the conjugate φ=1φ. The elements of (ζ) can alternately be represented as α+βζ, where α and β are elements of Template:Q(√5): a0+a1ζ+a2ζ2+a3ζ3+a4ζ4=(a0a2+φa3φa4)+(a1φa2+φa3a4)ζ.

Conversely, Template:Q(√5) is a subfield of (ζ). For any primitive root of unity ζn, the maximal real subfield of the cyclotomic field (ζn) is the field (ζn+ζn1); see Minimal polynomial of 2cos(2π/n). In our case n=5, (ζ+ζ1)2+(ζ+ζ1)1=0, so ζ+ζ1 is the positive root of the quadratic polynomial x2+x1, namely φ1, and the maximal real subfield of (ζ) is Template:Q(√5).[49]

Diagonals of a unit-circumradius regular decagon are square roots of golden integers.

The squared absolute value of any element of (ζ) is an element of Template:Q(√5): |α+βζ|2=(α+βζ)(α+βζ1)=α2+β2+αβφ1. In particular, the squared length of the side of a regular pentagon of unit circumradius is |ζ1|2=2+φ=φ15 and the squared length of its diagonal is |ζ21|2=2+φ=φ5; these two numbers are conjugates, associates of 5. In a regular decagon with unit circumradius, the squared length of a side is |ζ2+1|2=φ2 and the squared length of a diagonal between vertices three apart is |ζ+1|2=φ2.

Golden integers are involved in the trigonometric study of fivefold symmetries. By the quadratic formula, ζ=12(φ+φ24)=12φ+122φ,ζ2=12(φ+φ24)=12φ+122φ.

Angles of 25π and 45π thus have golden rational cosines but their sines are the square roots of golden rational numbers.[50] cos25π=12φ,sin25π=122+φ,cos45π=12φ,sin45π=122+φ.

Three-dimensional space

A regular icosahedron with edge length 2 can be oriented so that the Cartesian coordinates of its vertices are[51] (0,±1,±φ),(±1,±φ,0),(±φ,0,±1).

Four-dimensional space

The 600-cell is a regular 4-polytope with 120 vertices, 720 edges, 1200 triangular faces, and 600 tetrahedral cells. It has kaleidoscopic symmetry [5,3,3] generated by four mirrors which can be conveniently oriented as 5x1=x2+x3+x4, x1=x2, x2=x3, and x3=x4. Then the 120 vertices have golden-integer coordinates: arbitrary permutations of (φ,φ,φ,φ2) and (φ1,φ1,φ1,φ2) with an even number of minus signs, (1,1,1,5) with an odd number of minus signs, and (±2,±2,0,0).[52]

Higher dimensions

The icosians are a special set of quaternions that are used in a construction of the E8 lattice. Each component of an icosian always belongs to the golden field.({{{1}}}, {{{2}}}) The icosians of unit norm are the vertices of a 600-cell.[53]

Quasiperiodicity

The Fibonacci chain, a one-dimensional quasicrystal, constructed by the cut-and-project method

Golden integers are used in studying quasicrystals.[54]

Other applications

The quintic case of Fermat's Last Theorem, that there are no nontrivial integer solutions to the equation a5+b5=c5, was proved using Template:Q(√5) by Gustav Lejeune Dirichlet and Adrien-Marie Legendre in 1825–1830.[55]

In enumerative geometry, it is proven that every non-singular cubic surface contains exactly 27 lines. The Clebsch surface is unusual in that all 27 lines can be defined over the real numbers.[56] They can, in fact, be defined over the golden field.({{{1}}}, {{{2}}})

In quantum information theory, an abelian extension of the golden field is used in a construction of a SIC-POVM in four-dimensional complex vector space.({{{1}}}, {{{2}}})

Notes

  1. The expression (5) is pronounced "the rational numbers adjoin the square root of five", or, more concisely, "Q adjoin root five". See Trifković 2013, p. 6.
  2. The name golden field was apparently introduced in 1988 by John Conway and Neil Sloane in the 1st edition of their book Sphere Packings, Lattices and Groups (§ 8.2.1, Template:Pgs). See Conway & Sloane 1999 for the 3rd edition. The name is relatively uncommon; most sources use symbolic names such as (5) or (φ).
  3. 3.0 3.1 Lind 1968.
  4. 4.0 4.1 Sloane, "Decimal expansion of square root of 5", OEIS A002163.
  5. Sloane, "Decimal expansion of golden ratio φ (or τ) =(1+5)/2", OEIS A001622.
  6. Dickson 1923, pp. 129–130, 139.
  7. Dodd 1983, p. 8.
  8. 8.0 8.1 Dimitrov, Cosklev & Bonevsky 1995.
  9. 9.0 9.1 Dodd 1983, pp. 9–10.
  10. Dodd 1983, pp. 8–9.
  11. 11.0 11.1 11.2 11.3 11.4 11.5 Dodd 1983, p. 9.
  12. This is true for conjugation in quadratic fields in general. See Trifković 2013, p. 62.
  13. Rotman 2017.
  14. 14.0 14.1 Appleby et al. 2022.
  15. For instance by Rokhsar, Mermin & Wright 1987; Lehrer & Taylor 2009, p. 253.
  16. Dodd 1983, p. 11.
  17. Dodd 1983, pp. 28–29.
  18. 18.0 18.1 Dodd 1983, pp. 26–28.
  19. Sloane, "Positive numbers of the form x2+xyy2", OEIS A031363.
  20. Dodd 1983, p. 3.
  21. Wasteels 1902; Dodd 1983, p. 22; Dimitrov, Cosklev & Bonevsky 1995.
  22. 22.0 22.1 22.2 A list of primes can be found in Dodd 1983, Appendix B, "A List of Primes", Template:Pgs.
  23. Sloane, "Primes congruent to 2 or 3 modulo 5", OEIS A003631.
  24. Sloane, "Primes congruent to {1,4} mod 5", OEIS A045468.
  25. Hardy & Wright 1954, pp. 221–222.
  26. Dodd 1983, Ch. 2, "Elementary Divisibility Properties of Z(ω)", Template:Pgs.
  27. LeVeque 1956, Template:Pgs; Sloane, "Squarefree values of n for which the quadratic field 𝐐[n] is norm-Euclidean", OEIS A048981.
  28. 28.0 28.1 Liba & Ilany 2023, p. 15; Yang 1997; Fontaine & Hurley 2011 also mention the isomorphism between the real subfield of the cyclotomic field (ζ) and the arithmetic of matrices spanned by 𝐈 and Φ, which they call the silver matrices S[5,1] and S[5,2].
    Méndez-Delgadillo, Lam-Estrada & Maldonado-Ramírez 2015 work with the basis (5,1), relative to which the matrix 𝐑 represents 5:
    𝐑=[0510],  a𝐈+b𝐑=[a5bba].
    In this basis, the golden ratio φ is represented by a matrix Φ=12𝐈+12𝐑:
    Φ=[12521212],  a𝐈+bΦ=[a+12b52b12ba+12b].
    This is the same idea as using the matrices 𝐑 and Φ: arithmetic of these matrices is likewise isomorphic to arithmetic in (5), and the eigenvalues, characteristic polynomial, trace, and determinant are the same in any basis. However, the eigenvectors are [51] and [51] rather than [1φ] and [1φ].
  29. 29.0 29.1 Rotman 2017, p. 456 ff. describes this for finite-dimensional field extensions in general.
  30. Boukas, Feinsilver & Fellouris 2016.
  31. Our matrix Φ, or the mirrored variant [1110], is commonly denoted 𝐐 or 𝒬 in work about the Fibonacci numbers. See Gould 1981 for a survey in that context. Here we use the symbol Φ for consistency with the symbol φ and to avoid confusion with the rational numbers , which are also often denoted 𝐐. Liba & Ilany 2023, p. 15 also use the symbol Φ, and call this the "golden matrix".
  32. Hoggatt & Ruggles 1963; Liba & Ilany 2023, p. 16
  33. Liba & Ilany 2023, p. 14.
  34. Here tr(𝐀) means the matrix trace of 𝐀 and tr(α) means the field trace of α in (5).
  35. Bicknell & Hoggatt 1973, pp. 18–26; Gould 1981.
  36. Here the symbol indicates the transpose of a matrix, so [1φ] is a column vector.
  37. Dembélé 2005.
  38. Sloane, "𝐐(n) is a unique factorization domain", OEIS A003172
  39. Bernat 2006.
  40. Vajda 1989, p. 31 plots these points and hyperbolas rotated and scaled so that 12 and 125 coordinates make a square grid aligned with the page.
  41. Sloane, "Fibonacci numbers", OEIS A000045; Sloane, "Lucas numbers beginning at 2", OEIS A000032.
  42. Vajda 1989, p. 10; Sloane, "[...] Fibonacci numbers extended to negative indices", OEIS A039834.
  43. Lind 1968; Vajda 1989, p. 52
  44. Dodd 1983, p. 5.
    The formula was developed by Abraham de Moivre (1718) and then independently by Jacques Philippe Marie Binet (1843) and Gabriel Lamé (1844); see Vajda 1989, p. 52.
  45. Dodd 1983, p. 22.
  46. For φ0=1, which is its own conjugate, the polynomial x22x+1=(x1)2 is not minimal.
  47. Because, as described in § Conjugation and norm, (xα)(xα)=x2tr(α)x+N(α) for any α in (5). In this case, tr(φn)=Ln, N(φn)=(1)n, tr(φn5)=5Fn, and N(φn5)=(1)n(5).
  48. Dodd 1983, § 9.4 "Divisibility Properties of the Fibonacci Numbers", Template:Pgs proves this and various related results. See also Carlitz 1964.
  49. Shurman 1997, p. 77.
    More generally, for any odd prime p, the field ((1)(p1)/2p) is a subfield of (ζp). Moreover, by the Kronecker–Weber theorem, every abelian extension of the rationals is contained in some cyclotomic field. See Ireland & Rosen 1990, pp. 199–200.
  50. Bradie 2002; Huntley 1970, pp. 39–41.
  51. Steeb, Hardy & Tanski 2012, p. 211.
  52. Coxeter 1985; Denney et al. 2020.
  53. Denney et al. 2020.
  54. Sporn 2021.
  55. Ribenboim 1999; Dirichlet 1828; Legendre 1830; Dodd 1983, § 9.3 "The Equation x5+y5+z5=0", Template:Pgs.
  56. Baez 2016.

References