Golden field

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Cs1 config Template:Use dmy dates

In mathematics, Template:Q(√5),[1] sometimes called the golden field,[2] is a number system consisting of the set of all numbers Template:Tmath, where Template:Tmath and Template:Tmath are both rational numbers and Template:Tmath is the square root of 5, along with the basic arithmetical operations (addition, subtraction, multiplication, and division). This arithmetic shares certain structural properties with the arithmetic of Template:Tmath, the field of rational numbers, making Template:Q(√5) also a type of field. More specifically, it is a real quadratic field, the extension field of Template:Tmath generated by combining rational numbers and Template:Tmath using arithmetical operations. The name comes from the golden ratio Template:Tmath, a positive number satisfying the equation Template:Tmath, 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 Template:Tmath where Template:Tmath and Template:Tmath are uniquely determinedTemplate:Sfn rational numbers, or in the form Template:Tmath where Template:Tmath, Template:Tmath, and Template:Tmath are integers, which can be uniquely reduced to lowest terms, and where Template:Tmath is the square root of 5.[3] It is sometimes more convenient instead to use the form Template:Tmath where Template:Tmath and Template:Tmath are rational or the form Template:Tmath where Template:Tmath, Template:Tmath, and Template:Tmath are integers, and where φ=12(1+5)=1.618… is the golden ratio.[4]Template:Sfn

Converting between these alternative forms is straight-forward: Template:Tmath or, in the other direction, Template:Tmath.Template:Sfn

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

To multiply two numbers, distribute:Template:Sfn (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/α=α‾/αα‾=Template:Nobr where Template:Tmath is the algebraic conjugate and Template:Tmath is the field norm, as defined below.Template:Sfn Explicitly: 1a+b5=1a+b5⋅a−b5a−b5=aa2−5b2−ba2−5b25,1a+bφ=1a+bφ⋅a+b−bφa+b−bφ=a+ba2+ab−b2−ba2+ab−b2φ.

To divide two numbers, multiply the first by second's reciprocal:Template:Sfn a1+b15a2+b25=a1a2−5b1b2a22−5b22+−a1b2+b1a2a22−5b225,a1+b1φa2+b2φ=a1a2+a1b2−b1b2a22+a2b2−b22+−a1b2+b1a2a22+a2b2−b22φ.

As in any field, addition and multiplication of numbers in Template:Q(√5) is associative and commutative; Template:Tmath is the additive identity and Template:Tmath is the multiplicative identity; every number Template:Tmath has an additive inverse Template:Tmath and a multiplicative inverse Template:Tmath; 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 Template:Tmath.

Conjugation and norm

The numbers Template:Tmath and Template:Tmath each solve the equation Template:Tmath. Each number Template:Tmath in Template:Q(√5) has an algebraic conjugate Template:Tmath found by swapping these two square roots of 5, i.e., by changing the sign of Template:Tmath. The conjugate of Template:Tmath is φ‾=12(1−5)=−φ−1=Template:Nobr. A rational number is its own conjugate, Template:Tmath. In general, the conjugate is:Template:Sfn a+b5‾=a−b5,a+bφ‾=a+bφ‾=(a+b)−bφ. Conjugation in Template:Q(√5) is an involution, Template:Tmath, and it preserves the structure of arithmetic: Template:Tmath; Template:Tmath; and Template:Tmath.Template:Sfn 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.[5]

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).Template:Sfn The trace of Template:Tmath in Template:Q(√5) is Template:Tmath: tr(a+b5)=(a+b5)+(a−b5)=2a,tr(a+bφ)=(a+bφ)+(a+b−bφ)=2a+b. This is always an (ordinary) rational number.Template:Sfn

The field norm is a measure of a number's magnitude, the product of the number and its conjugates.Template:Sfn The norm of Template:Tmath in Template:Q(√5) is Template:Tmath:Template:Sfn N(a+b5)=a2−5b2,N(a+bφ)=a2+ab−b2. This is also always a rational number.Template:Sfn

The norm preserves the structure of multiplication, as expected for a concept of magnitude. The norm of a product is the product of norms, Template:Tmath; and the norm of a quotient is the quotient of the norms, Template:Tmath. A number and its conjugate have the same norm, Template:Tmath.Template:Sfn

A number Template:Tmath in Template:Q(√5) and its conjugate Template:Tmath are the solutions of the quadratic equationTemplate:Sfn (x−α)(x−α‾)=x2−tr(α)x+N(α)=0.

In Galois theory, the golden field can be considered more abstractly as the set of all numbers Template:Tmath, where Template:Tmath and Template:Tmath are both rational, and all that is known of Template:Tmath is that it satisfies the equation Template:Tmath. There are two ways to embed this set in the real numbers: by mapping Template:Tmath to the positive square root Template:Tmath or alternatively by mapping Template:Tmath to the negative square root Template:Tmath. 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.Template:Sfn

Golden integers

One convenient way to plot Template:Math is as a lattice in the real coordinate plane. The so-called canonical embedding represents the number Template:Math by the point with coordinates Template:Math. Numbers with the same norm lie on hyperbolas (orange and green lines).
The logarithmic embedding into the plane represents the (non-zero) number Template:Math by the point with coordinates Template:Math – 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, Template:Tmath, sometimes called the golden integers,[6] is the set of all algebraic integers in the field, meaning those elements whose minimal polynomial over Template:Tmath has integer coefficients. These are the set of numbers in Template:Q(√5) whose norm and trace are integers. The numbers Template:Tmath and Template:Tmath 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.Template:Sfnm Alternately, elements of Template:Tmath can be written in the form Template:Tmath, where Template:Tmath and Template:Tmath have the same parity.Template:Sfn Like any ring, Template:Tmath is closed under addition and multiplication. Template:Q(√5) is the smallest field containing Template:Tmath, its field of fractions.

Norms

The set of all norms of golden integers includes every number a2+ab−b2=N(a+bφ) for ordinary integers Template:Tmath and Template:Tmath.Template:Sfn These are precisely the ordinary integers whose ordinary prime factors which are congruent to Template:Tmath modulo Template:Tmath occur with even exponents (see Template:Slink below).Template:Sfn The first several non-negative integer norms are:[7]

Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath, Template:Tmath,Template:Nobr

The golden integer Template:Tmath is called zero, and is the only element of Template:Tmath with norm Template:Tmath.Template:Sfn

Divisibility

If Template:Tmath and Template:Tmath are golden integers and there is some golden integer Template:Tmath such that Template:Tmath, we say that Template:Tmath divides Template:Tmath, denoted Template:Tmath. 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, Template:Tmath is an integral domain, the product of two non-zero elements is always non-zero. Thus Template:Tmath has no nontrivial zero divisors, and Template:Tmath implies that either Template:Tmath or Template:Tmath.

Units

A unit is an algebraic integer which divides Template:Tmath, i.e. whose multiplicative inverse is also an algebraic integer, which happens when its norm is Template:Tmath. Among the ordinary integers, the units are the pair of numbers Template:Tmath, but among the golden integers there are infinitely many units: all numbers of the form Template:Tmath whose integer coefficients Template:Tmath and Template:Tmath solve the Diophantine equation Template:Tmath. If a unit is instead written in the form Template:Tmath, its coefficients solve a related Diophantine equation, the generalized Pell's equation Template:Tmath. The fundamental unit – the smallest unit greater than Template:Tmath – is the golden ratio Template:Tmath and the other units consist of its positive and negative powers, Template:Tmath, for any integer Template:Tmath.Template:Sfn Some [[Golden ratio#Golden ratio conjugate and powers|powers of Template:Tmath]] are:

Template:Table alignment

Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath
Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath

In general Template:Tmath, where Template:Tmath is the Template:Tmathth Fibonacci number.[8] The units form the group Template:Tmath under multiplication, which can be decomposed as the direct product of a cyclic group of order 2 generated by Template:Tmath and an infinite cyclic group generated by Template:Tmath.

Associates

Two golden integers Template:Tmath and Template:Tmath are associates if each divides the other, Template:Tmath and Template:Tmath. Equivalently, their quotient in Template:Tmath is a unit, Template:Tmath for some integer Template:Tmath. Associateness is an equivalence relation. If Template:Tmath divides some golden integer Template:Tmath, then so does its associate Template:Tmath: if Template:Tmath then Template:Tmath.

Associates have the same norm, up to sign: Template:Nobr 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 Template:Tmath or with an ordinary prime.Template:Sfn

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 (×)[9]

A prime element of a ring, analogous to a prime number among the integers, is an element Template:Tmath such that whenever Template:Tmath, then either Template:Tmath or Template:Tmath. In Template:Tmath the primes are of three types: Template:Tmath, integer primes of the form Template:Tmath[10] where Template:Tmath is an integer, and the factors of integer primes of the form Template:Tmath[11] (a pair of conjugates).Template:Sfn For example, Template:Tmath, Template:Tmath, and Template:Tmath are primes, but Template:Tmath is composite. Any of these is an associate of additional primes; for example Template:Tmath is also prime, an associate of Template:Tmath.Template:R

The ring Template:Tmath 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.Template:Sfn This makes Template:Q(√5) one of the 21 quadratic fields that are norm-Euclidean.[12] A form of the fundamental theorem of arithmetic applies in Template:Tmath: 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 Template:Tmath is any subset which "absorbs multiplication", containing every golden-integer multiple of each of its elements. If Template:Tmath is any golden integer, the set of all golden-integer multiples of Template:Tmath, denoted Template:Tmath or Template:Tmath, is the ideal generated by Template:Tmath. Every associated element generates the same ideal, but a non-associated element generates a different ideal: that is, Template:Tmath precisely when Template:Tmath. Because Template:Tmath is a principal ideal domain, each ideal of Template:Tmath can be generated by a single element. The zero ideal Template:Tmath is the single-element set Template:Tmath. The ideal Template:Tmath is all of Template:Tmath.

Various operations can be defined among ideals. If Template:Tmath and Template:Tmath are ideals of Template:Tmath, then Template:Tmath is the set of all sums of one element in Template:Tmath plus one element in Template:Tmath, and Template:Tmath is the set of all sums of any number of terms, each of which is the product of one element in Template:Tmath times one element in Template:Tmath. 𝔞+𝔟={α+β∣α∈𝔞,β∈𝔟},𝔞𝔟={∑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 Template:Tmath. If Template:Tmath is any number in Template:Q(√5), the set of golden-integer multiples of Template:Tmath, also denoted Template:Tmath or Template:Tmath, is the fractional ideal generated by Template:Tmath. As with integral ideals of Template:Tmath, 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 Template:Tmath be the multiplicative group of the nonzero elements of Template:Q(√5), and Template:Tmath be the group of the units. The function that maps each element of Template:Tmath to the generated fractional ideal, Template:Tmath, induces a group isomorphism between Template:Tmath 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 Template:Tmath in the class for which α+|α‾| is a minimum).Template:R

Template:Table alignmentTemplate:Sticky header

Matrix representation

Template:Q(√5) is a two-dimensional vector space over Template:Tmath, 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 Template:Tmath square matrices with rational entries spanned by the identity matrix Template:Tmath, the image of the number Template:Tmath, and a matrix Template:Tmath, the image of Template:Tmath.Template:R Thus arithmetic of numbers in Template:Q(√5) can be alternately represented by the arithmetic of such matrices.[13] In this context, the number Template:Tmath is represented by the matrix Template:Tmath.Template:Sfn A convenient choice of basis for Template:Q(√5) is Template:Tmath, in terms of which Template:Tmath is a symmetric matrix:[14] 𝐈=[1001],𝜱=[0111],𝐀=a𝐈+b𝜱=[abba+b].

The adjugate matrix Template:Tmath represents the algebraic conjugate Template:Tmath, the matrix Template:Tmath (satisfying Template:Tmath) represents Template:Tmath,[15] and the adjugate of an arbitrary element Template:Tmath, which we will denote Template:Tmath, represents the number Template:Tmath: 𝐑=[−1221],𝜱‾=[1−1−10],𝐀‾=a𝐈+b𝜱‾=[a+b−b−ba].

Every matrix Template:Tmath, except for the zero matrix, is invertible, and its inverse Template:Tmath represents the multiplicative inverse Template:Tmath in Template:Q(√5).Template:Sfn

If Template:Tmath is an element of Template:Q(√5), with conjugate Template:Tmath, then the matrix Template:Tmath has the numbers Template:Tmath and Template:Tmath as its eigenvalues. Its trace is tr(𝐀)=2a+b=Template:Nobr Its determinant is det(𝐀)=a2+ab−b2=Template:Nobr The characteristic polynomial of Template:Tmath is Template:Tmath, which is the minimal polynomial of Template:Tmath and Template:Tmath whenever Template:Tmath is not zero. These properties are shared by the adjugate matrix Template:Tmath. Their product is Template:Tmath.Template:R[16]

These matrices have especially been studied in the context of the Fibonacci numbers Template:Tmath and Lucas numbers Template:Tmath, which appear as the entries of Template:Tmath and Template:Tmath, respectively: 𝜱n=Fn−1𝐈+Fn𝜱=[Fn−1FnFnFn+1],tr(𝜱n)=Ln,𝜱n𝐑=Ln−1𝐈+Ln𝜱=[Ln−1LnLnLn+1],tr(𝜱n𝐑)=5Fn. Powers of Template:Tmath are sometimes called Fibonacci matrices.[17]

Every matrix of the form Template:Tmath has eigenvectors which point along the directions Template:Tmath and Template:Tmath.[18] 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 Template:Tmath for integer Template:Tmath, representing units, and more generally any matrices with Template:Tmath and determinant Template:Tmath, are squeeze mappings, which stretch the plane along one axis and squish it along the other, fixing hyperbolas of constant norm. The matrices Template:Tmath and more generally matrices with Template:Tmath and determinant Template:Tmath, are the composition of a squeeze mapping and a vertical reflection. The negative identity matrix Template:Tmath is a point reflection across the origin. In general any other matrix Template:Tmath 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, Template:Tmath.Template:Sfn It has class number 1, which means that the ring of its algebraic integers is a principal ideal domain and a unique factorization domain.[19]

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 φ.Template:Sfn

Fibonacci numbers

The Lucas and Fibonacci numbers are components of Template:Math when written in terms of Template:Math and Template:Math.[20]

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

The sequences Template:Tmath and Template:Tmath respectively begin:[21]

Template:Table alignment

Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath
Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath
Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath Template:Tmath

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

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

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

The expression of the Fibonacci numbers in terms of Template:Tmath is called Binet's formula:[24]

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

The powers of Template:Tmath or Template:Tmath, when written in the form Template:Tmath, can be expressed in terms of just Fibonacci numbers,Template:Sfn φn=Fn−1+Fnφ,φ‾n=Fn−1+Fnφ‾=Fn+1−Fnφ. Powers of Template:Tmath or Template:Tmath times Template:Tmath can be expressed in terms of just Lucas numbers, φn5=Ln−1+Lnφ,φ‾n5=−Ln−1−Lnφ‾=−Ln+1+Lnφ. Statements about golden integers can be recast as statements about the Fibonacci or Lucas numbers; for example, that every power of Template:Tmath is a unit of Template:Tmath, Template:Tmath, when expanded, becomes Cassini's identity, and likewise Template:Tmath becomes the analogous identity about Lucas numbers, (Fn−1+Fnφ)(Fn+1−Fnφ)=Fn−1Fn+1−Fn2=(−1)n,(Ln−1+Lnφ)(−Ln+1+Lnφ)=Ln2−Ln−1Ln+1=(−1)n5.

The numbers Template:Tmath and Template:Tmath are the roots of the quadratic polynomial Template:Tmath. This is the minimal polynomial for Template:Tmath for any non-zero integer Template:Tmath.[25] The quadratic polynomial Template:Tmath is the minimal polynomial for Template:Tmath.[26]

In the limit, consecutive Fibonacci or Lucas numbers approach a ratio of Template:Tmath, and the ratio of Lucas to Fibonacci numbers approaches Template:Tmath:Template:R limn→∞Fn+1Fn=limn→∞Ln+1Ln=φ,limn→∞LnFn=5.

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

Relation to fivefold symmetry

The golden ratio Template:Tmath 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 Template:Tmath be the 5th root of unity, a complex number of unit absolute value spaced Template:Tmath of a full turn from Template:Tmath around the unit circle, satisfying Template:Tmath. Then the fifth cyclotomic field Template:Tmath is the field extension of the rational numbers formed by adjoining Template:Tmath (or equivalently, adjoining any of Template:Tmath, Template:Tmath or Template:Tmath). Elements of Template:Tmath are numbers of the form a0+a1ζ+a2ζ2+Template:Nobr, with rational coefficients. Template:Tmath is of degree four over the rational numbers: any four of the five roots are linearly independent over Template:Tmath, but all five sum to zero. However, Template:Tmath is only of degree two over Template:Q(√5), x5−1=(x−1)(x4+x3+x2+x+1)=(x−1)(x2+φ‾x+1)(x2+φx+1)=(x−1)(x−ζ)(x−ζ4)(x−ζ2)(x−ζ3), where the conjugate Template:Tmath. The elements of Template:Tmath can alternately be represented as Template:Tmath, where Template:Tmath and Template:Tmath are elements of Template:Q(√5): a0+a1ζ+a2ζ2+a3ζ3+a4ζ4=(a0−a2+φ‾a3−φ‾a4)+(a1−φ‾a2+φ‾a3−a4)ζ.

Conversely, Template:Q(√5) is a subfield of Template:Tmath. For any primitive root of unity Template:Tmath, the maximal real subfield of the cyclotomic field Template:Tmath is the field Template:Tmath; see [[Minimal polynomial of 2cos(2pi/n)|Minimal polynomial of Template:Tmath]]. In our case Template:Tmath, (ζ+ζ−1)2+Template:Nobr so Template:Tmath is the positive root of the quadratic polynomial Template:Tmath, namely Template:Tmath, and the maximal real subfield of Template:Tmath is Template:Q(√5).[28]

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

The squared absolute value of any element of Template:Tmath 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 |ζ2−1|2=2+φ=Template:Nobr these two numbers are conjugates, associates of Template:Tmath. 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 Template:Nobr

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

Angles of Template:Tmath and Template:Tmath thus have golden rational cosines but their sines are the square roots of golden rational numbers.[29] cos⁡25π=−12φ‾,sin⁡25π=122+φ,cos⁡45π=−12φ,sin⁡45π=122+φ‾.

Three-dimensional space

A regular icosahedron with edge length Template:Tmath can be oriented so that the Cartesian coordinates of its vertices areTemplate:Sfn (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 Template:Tmath generated by four mirrors which can be conveniently oriented as Template:Tmath, Template:Tmath, Template:Tmath, and Template:Tmath. Then the 120 vertices have golden-integer coordinates: arbitrary permutations of Template:Tmath and Template:Tmath with an even number of minus signs, Template:Tmath with an odd number of minus signs, and Template:Tmath.[30]

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.Template:Sfnm The icosians of unit norm are the vertices of a 600-cell.Template:Sfn

Quasiperiodicity

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

Golden integers are used in studying quasicrystals.Template:Sfn

Other applications

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

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.Template:Sfn They can, in fact, be defined over the golden field.Template:Sfnm

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.Template:Sfnm

Notes

Template:Reflist

References

Template:Div col

Template:Div col end

Template:Bots

  1. ↑ The expression Template:Tmath is pronounced "the rational numbers adjoin the square root of five", or, more concisely, "Q adjoin root five". See Template:Harvnb.
  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 (§Template:Nbsp8.2.1, Template:Pgs). See Template:Harvnb for the 3rd edition. The name is relatively uncommon; most sources use symbolic names such as Template:Tmath or Template:Tmath.
  3. ↑ Template:Harvnb.
  4. ↑ Template:Harvnb.
  5. ↑ This is true for conjugation in quadratic fields in general. See Template:Harvnb.
  6. ↑ For instance by Template:Harvnb; Template:Harvnb.
  7. ↑ Template:Harvnb.
  8. ↑ Template:Harvnb; Template:Harvnb; Template:Harvnb.
  9. ↑ A list of primes can be found in Template:Harvnb.
  10. ↑ Template:Harvnb.
  11. ↑ Template:Harvnb.
  12. ↑ Template:Harvnb; Template:Harvnb.
  13. ↑ Template:Harvnb describes this for finite-dimensional field extensions in general.
  14. ↑ Our matrix Template:Tmath, or the mirrored variant Template:Tmath, is commonly denoted Template:Tmath or Template:Tmath in work about the Fibonacci numbers. See Template:Harvnb for a survey in that context. Here we use the symbol Template:Tmath for consistency with the symbol Template:Tmath and to avoid confusion with the rational numbers Template:Tmath, which are also often denoted Template:Tmath. Template:Harvnb also use the symbol Template:Tmath, and call this the "golden matrix".
  15. ↑ Template:Harvnb; Template:Harvnb
  16. ↑ Template:Harvnb; Template:Harvnb; Template:Harvnb also mention the isomorphism between the real subfield of the cyclotomic field Template:Tmath and the arithmetic of matrices spanned by Template:Tmath and Template:Tmath, which they call the silver matrices Template:Tmath and Template:Tmath. Template:Pb Template:Harvnb work with the basis Template:Tmath, relative to which the matrix Template:Tmath represents Template:Tmath: Template:Pb 𝐑′=[0510],  a𝐈+b𝐑′=[a5bba]. Template:Pb In this basis, the golden ratio Template:Tmath is represented by a matrix Template:Tmath: Template:Pb 𝜱′=[12521212],  a𝐈+b𝜱′=[a+12b52b12ba+12b]. Template:Pb This is the same idea as using the matrices Template:Tmath and Template:Tmath: arithmetic of these matrices is likewise isomorphic to arithmetic in Template:Tmath, and the eigenvalues, characteristic polynomial, trace, and determinant are the same in any basis. However, the eigenvectors are Template:Tmath and Template:Tmath rather than Template:Tmath and Template:Tmath.
  17. ↑ Template:Harvnb; Template:Harvnb.
  18. ↑ Here the symbol Template:Tmath indicates the transpose of a matrix, so Template:Tmath is a column vector.
  19. ↑ Template:Harvnb
  20. ↑ Template:Harvnb plots these points and hyperbolas rotated and scaled so that Template:Tmath and Template:Tmath coordinates make a square grid aligned with the page.
  21. ↑ Template:Harvnb; Template:Harvnb.
  22. ↑ Template:Harvnb; Template:Harvnb.
  23. ↑ Template:Harvnb; Template:Harvnb
  24. ↑ Template:Harvnb. Template:Pb The formula was developed by Abraham de Moivre (1718) and then independently by Jacques Philippe Marie Binet (1843) and Gabriel Lamé (1844); see Template:Harvnb.
  25. ↑ For Template:Tmath, which is its own conjugate, the polynomial x2−2x+1=(x−1)2 is not minimal.
  26. ↑ Because, as described in Template:Slink, (x−α)(x−α‾)=x2−tr(α)x+N(α) for any Template:Tmath in Template:Tmath. In this case, Template:Tmath, Template:Tmath, Template:Tmath, and Template:Tmath.
  27. ↑ Template:Harvnb proves this and various related results. See also Template:Harvnb.
  28. ↑ Template:Harvnb. Template:Pb More generally, for any odd prime Template:Tmath, the field Template:Tmath is a subfield of Template:Tmath. Moreover, by the Kronecker–Weber theorem, every abelian extension of the rationals is contained in some cyclotomic field. See Template:Harvnb.
  29. ↑ Template:Harvnb; Template:Harvnb.
  30. ↑ Template:Harvnb; Template:Harvnb.
  31. ↑ Template:Harvnb; Template:Harvnb; Template:Harvnb; Template:Harvnb