Codenominator function

From testwiki
Jump to navigation Jump to search

Template:Short description

Template:Multiple issues The codenominator is a function that extends the Fibonacci sequence to the index set of positive rational numbers, 𝐐+. Many known Fibonacci identities carry over to the codenominator. One can express Dyer's outer automorphism Ξ± of the extended modular group Template:Math in terms of the codenominator. This automorphism can be viewed as an automorphism group of the trivalent tree. The real Ξ±-covariant modular function Jimm on the real line 𝐑 is defined via the codenominator. Jimm relates the Stern-Brocot tree to the Bird tree. Jimm induces an involution of the moduli space of rank-2 pseudolattices and is related to the arithmetic of real quadratic irrationals.

Definition of the codenominator

The codenominator function F:𝐐+→𝐙+ is defined by the following system of functional equations:

F(1+1x)=F(x),F(11+x)=F(x)+F(1x)(x∈𝐐+)

with the initial condition F(1)=1. The function F(1/x)≑F(1+x) is called the conumerator. (The name `codenominator' comes from the fact that the usual denominator function D:𝐐+→𝐙+ can be defined by the functional equations

D(1+x)=D(x),D(1/(1+x))=D(x)+D(1/x),

and the initial condition D(1)=1.)

The codenominator takes every positive integral value infinitely often.

Connection with the Fibonacci sequence

For integer arguments, the codenominator agrees with the standard Fibonacci sequence, satisfying the recurrence:

Fn+1=Fn+Fnβˆ’1,F1=F2=1.

The codenominator extends this sequence to positive rational arguments. Moreover, for every rational x∈𝐐+, the sequence Gn:=F(x+n) is the so-called Gibonacci sequence[1] (also called the generalized Fibonacci sequence) defined by G0:=F(x), G1:=F(1+x) and the recursion Gn+2=Gn+Gnβˆ’1.

Examples (n is a positive integer)
1 F(n)=Fn
2 F(1/2)=2, more generally F(1/n)=F(n+1)=Fn+1.
3 F(n+1/2)=Ln=Fn+1+Fnβˆ’1 is the Lucas sequence Template:OEIS2C.
4 F(n+1/3)=2Fn+1+Fnβˆ’1 is the sequence Template:OEIS2C.
5 F(n+1/4)=3Fn+1+Fnβˆ’1 is the sequence Template:OEIS2C.
6 F(n+1/5)=5Fn+1+Fnβˆ’1 is the sequence Template:OEIS2C.
7 F(n+1/n)=2Fn2+(βˆ’1)n is the sequence Template:OEIS2C.
8 F(23/31)=107, F(31/23)=47.
9 F(19/41)=24Γ—7, F(41/19)=34.
10 F(FnFn+1)=n,F(Fn+1Fn)=1.

Properties of the codenominator

The codenominator has the following properties:[2]

1. Fibonacci recursion: The codenominator function satisfies the Fibonacci recurrence for rational arguments:

F(x+n)=FnF(x+1)+Fnβˆ’1F(x),(n>1,x∈𝐐+)

2. Fibonacci invariance: For any integer n>1 and x∈𝐐+

F(Fn+Fn+1xFnβˆ’1+Fnx)=F(x).

3. Symmetry: If x∈(0,1)∩𝐐, then

F(1βˆ’x)=F(x).

4. Continued fractions: For a rational number x expressed as a simple continued fraction [n0,n1,...,nk], the value of F(x) can be computed recursively using Fibonacci numbers as:

F[n0,n1,…,nk]=Fn0F[n1,…,nk]+Fn0βˆ’1F[n1+1,…,nk].

5. Involutivity: The numerator function num:𝐐+β†’β„€+ can be expressed in terms of the codenominator as num(x)=F(F(x)F(1/x)), which implies

F(F(x)F(1/x))F(F(1/x)F(x))=x(x∈𝐐+)

6. Reversion:

F[0,n1,…,nk]=F[0,nk,…,n1]

7. Splitting: Let 0≀l≀r be integers. Then:

F[m0,…,mr]=F[m0,…,ml]F[ml+1,…,mr]+F[m0,…,msβˆ’1]F[ml+1+1,…,mr],

where s is the least index such that ms=β‹―=ml=1 (if m0=β‹―=ml=1, then set F[m0,…,msβˆ’1]=0).

8. Periodicity: For any positive integer m, the codenominator F[n0,n1,…,nk] is periodic in each partial quotient nk modulo m with period divisible with Ο€(m) , where Ο€(m) is the Pisano period.[3]

9. Fibonacci identities: Many known Fibonacci identities admit a codenominator version. For example, if at least two among x,y,z∈𝐐+ are integral, then

F(x+y)F(x+z)βˆ’F(x)F(x+y+z)=cds(x)F(y)F(z),

where cds(x):=F(1/x)2βˆ’F(1/x)F(x)βˆ’F(x)2 is the codiscriminant[2] (also called the 'characteristic number'[1]). This reduces to Tagiuri's identity[4] when x,y,zβˆˆβ„€; which in turn is a generalization of the famous Catalan identity. Any Gibonacci identity[1][5][6] can be interpreted as a codenominator identity. There is also a combinatorial interpretation of the codenominator.[7]

The codiscriminant is a 2-periodic function.

Involution Jimm

The Jimm (Ψ¬) function is defined on positive rational arguments via

J(x):=F(1/x)F(x)(x∈𝐐+) This function is involutive and admits a natural extension to non-zero rationals via J(βˆ’x):=βˆ’1/J(x) which is also involutive.

Let x=[n0,n1,,nk]>1 be the simple continued fraction expansion of x∈𝐐+. Denote by 1k the sequence 1,1,,1 of length k. Then:

J(x)=[1n0βˆ’1,2,1n1βˆ’2,2,1n2βˆ’2,2,,2,1nkβˆ’1βˆ’2,2,1nkβˆ’1]

with the rules:

[,n,10,m,]:=[,n,m,]

and

[,n,1βˆ’1,m,]:=[,n+mβˆ’1,].

The function J admits an extension to the set of non-zero real numbers by taking limits (for positive real numbers one can use the same rules as above to compute it). This extension (denoted again J) is 2-1 valued on golden -or noble- numbers (i.e. the numbers in the Template:Math-orbit of the golden ratio Ο†=1+52).

The extended function J

  • sends rationals to rationals,[2]
  • sends golden numbers to rationals,[2]
  • is involutive except on the set of golden numbers,[2]
  • respects ends of continued fractions; i.e. if the continued fractions of x,y has the same end then so does J(x),J(y),
  • sends real quadratic irrationals (except golden numbers) to real quadratic irrationals (see below),[8]
  • commutes with the Galois conjugation on real quadratic irrationals[8] (see below),
  • is continuous at irrationals,[8]
  • has jumps at rationals,[2]
  • is differentiable a.e.,[8]
  • has vanishing derivative a.e.,[8]
  • sends a set of full measure to a set of null measure and vice versa[2]

and moreover satisfies the functional equations[8]

Involutivity

J(J(x))=x (except on the set of golden irrationals),

Covariance with 1βˆ’x

J(1βˆ’x)=1βˆ’J(x) (provided xβ‰ 1),

Covariance with 1/x

J(1/x)=1/J(x),

`Twisted' covariance with βˆ’x

J(βˆ’x)=βˆ’1/J(x).

These four functional equations in fact characterize Jimm. Additionally, Jimm satisfies

Reversion invariance

J([n0,n1,,nk])=[m0,m1,,ml]J([nk,,n1,n0])=[ml,,m1,m0]

Jumps

Let Ξ΄:=J(x+)βˆ’J(xβˆ’) be the jump of J at x. Then Ξ΄([1m,n1,…,nk])=(βˆ’1)m+n1+β‹―+nk5cds([0,nk,nkβˆ’1,…,n1,n1βˆ’1]).

Dyer's outer automorphism and Jimm

The extended modular group Template:Math admits the presentation

⟨U,V,K|U2=V2=K2=(UV)2=(KU)3=1⟩

where (viewing Template:Math as a group of MΓΆbius transformations) U:=xβ†’1/x, V:xβ†’βˆ’x and K:xβ†’1βˆ’x.

The map Ξ± of generators

α:U→U,V→UV,K→K

defines an involutive automorphism Template:Math β†’ Template:Math, called Dyer's outer automorphism.[9] It is known that Out(Template:Math)≃𝐙/2𝐙 is generated by Ξ±. The modular group Template:Math =⟨VU,KU⟩< Template:Math is not invariant under Ξ±. However, the subgroup Ξ“=⟨KU,UVKV⟩<Template:Math is Ξ±-invariant. Conjugacy classes of subgroups of Ξ“ is in 1-1 correspondence with bipartite trivalent graphs, and Ξ± thus defines a duality of such graphs.[10] This duality transforms zig-zag paths on a graph 𝒒 to straight paths on its Ξ±-dual graph and vice versa.

Dyer's outer automorphism can be expressed in terms of the codenumerator, as follows: Suppose p,q,r,sβˆˆπ™+ and M=[pqrs]∈PGL2(𝐙). Then

Ξ±(M)=[F(2r+s2p+q)βˆ’F(r+sp+q)2F(r+sp+q)βˆ’F(2r+s2p+q)F(2p+q2r+s)βˆ’F(p+qr+s)2F(p+qr+s)βˆ’F(2p+q2r+s)].

The covariance equations above implies that J is a representation of Ξ± as a map Template:Math β†’ Template:Math, i.e. J(Mx)=Ξ±(M)J(x) whenever xβˆˆπ‘ and M∈Template:Math. Another way of saying this is that J is a Ξ±-covariant map.

In particular, J sends Template:Math-orbits to Template:Math-orbits, thereby inducing an involution of the moduli space of rank-2 pseudo lattices,[11] Template:Math, where Template:Math is the projective line over the real numbers.

Given x,y∈Template:Math, the involution J sends the geodesic on the hyperbolic upper half plane β„‹ through x,y to the geodesic through J(x),J(y), thereby inducing an involution of geodesics on the modular curve Template:Math\β„‹. It preserves the set of closed geodesics because J sends real quadratic irrationals to real quadratic irrationals (with the exception of golden numbers, see below) respecting the Galois conjugation on them.

Jimm as a tree automorphism

Djokovic and Miller constructed Aut(PGL2(𝐙)) as a group of automorphisms of the infinite trivalent tree.[12] In this context, Ξ± appears as an automorphism of the infinite trivalent tree. Aut(PGL2(𝐙)) is one of the 7 groups acting with finite vertex stabilizers on the infinite trivalent tree.[13]

Jimm and the Stern-Brocot tree

Bird's tree of rational numbers

Applying Jimm to each node of the Stern-Brocot tree permutes all rationals in a row and otherwise preserves each row, yielding a new tree of rationals called Bird's tree, which was first described by Bird.[14] Reading the denominators of rationals on Bird's tree from top to bottom and following each row from left to right gives Hinze's sequence:[15]

2,3,3,5,4,4,5,8,7,5,7,7,5,...Template:OEIS

The sequence of conumerators is:

1,2,1,3,3,1,2,5,4,4,5,2,1,3,3,8,7,5,7,7,...Template:OEIS

Properties of the plot of Jimm and the golden ratio

By involutivity, the plot of J is symmetric with respect to the diagonal x=y, and by covariance with 1βˆ’x, the plot is symmetric with respect to the diagonal x+y=1. The fact that the derivative of J is 0 a.e. can be observed from the plot.

Plot of Jimm. Its limit at 0 + 0+ is 1/Ο† , and at 1 βˆ’ 1- it is 1 βˆ’ 1/Ο†. By involutivity, the value at 1/Ο† is 0, and the value at 1 βˆ’ 1/Ο† is 1. The amount of jump at x=1/2 is 1/sqrt (5). By involutivity, the plot is symmetric with respect to the diagonal x=y, and by commutativity with 1-x, the plot is symmetric with respect to the diagonal x+y=1. The fact that the derivative of Jimm is 0 a.e. can be observed from the plot.

The plot of Jimm hides many copies of the golden ratio Ο† in it. For example

1 limxβ†’+∞J(x)=Ο†, J(Ο†)=+∞
2 limxβ†’βˆ’βˆžJ(x)=φ¯, J(φ¯)=βˆ’βˆž
3 limxβ†’0+J(x)=Ο†βˆ’1, J(Ο†βˆ’1)=0
4 limxβ†’0βˆ’J(x)=Ο†Β―βˆ’1, J(Ο†Β―βˆ’1)=0
5 limx→1+J(x)=1+φ, J(1+φ)=1
6 limxβ†’1βˆ’J(x)=1+φ¯, J(1+φ¯)=1

More generally, for any rational q, the limit limxβ†’q+J(x) is of the form y:=aΟ†+bcΟ†+d with a,b,c,dβˆˆπ™ and adβˆ’bc=Β±1. The limit limxβ†’qβˆ’J(x) is its Galois conjugate yΒ―:=aφ¯+bcφ¯+d. Conversely, one has J(y)=J(yΒ―)=q.

Jimm on real quadratic irrational numbers

Jimm sends real quadratic irrationals to real quadratic irrationals, except the golden irrationals, which it sends to rationals in a 2–1 manner. It commutes with the Galois conjugation on the set of non-golden quadratic irrationals, i.e. if J(a+b)=A+B, then J(aβˆ’b)=Aβˆ’B, with a,b,A,B∈𝐐 and b,B positive non-squares.

For example:

J(3+527)=βˆ’3+2957,J(11)=15+90126.

2-variable form of functional equations

The functional equations can be written in the two-variable form as:[16]

Involutivitiy
J(x)=yJ(y)=x
Covariance with 1βˆ’x
x+y=1J(x)+J(y)=1
Covariance with 1/x
xy=1J(x)J(y)=1
Covariance with βˆ’x
x+y=0J(x)J(y)=βˆ’1

As a consequence of these, one has: 1x+1y=11J(x)+1J(y)=1. Therefore J sends the pair (ℬx,ℬy) of complementary Beatty sequences to the pair (ℬJ(x),ℬJ(y)) of complementary Beatty sequences; where x,y are non-golden irrationals with 1/x+1/y=1.

If x=a+b(a,b∈𝐐) is a real quadratic irrational, which is not a golden number, then as a consequence of the two-variable version of functional equations of J one has

1. N(x)=1N(J(x))=1

2. Tr(x)=0N(J(x))=βˆ’1

3. Tr(x)=1Tr(J(x))=1

4. Tr(1/x)=1Tr(1/J(x))=1

where N(x):=a2βˆ’b denotes the norm and Tr(x):=2a denotes the trace of x.

On the other hand, J may send two members of one real quadratic number field to members of two different real quadratic number fields; i.e. it does not respect individual class groups.

Jimm on Markov irrationals

Jimm sends the Markov irrationals[17] to 'simpler' quadratic irrationals,[18] see table below.

Markov number Markov irrational x J(x)
1 (1+5)/2 ∞
2 1+2 2
5 (9+221)/10 6βˆ’1
13 (23+1517)/26 12βˆ’2
29 (53+7565)/58 35/6βˆ’1
34 (15+526)/17 20βˆ’3
89 (157+71285)/178 30βˆ’4
169 (309+257045)/338 204/35βˆ’1
194 (86+21170)/97 119/10βˆ’2
233 (411+488597)/466 42βˆ’5
433 (791+1687397)/866 (12143βˆ’60)/59
610 (269+209306)/305 56βˆ’6
985 (1801+8732021)/1970 1189/204βˆ’1
1325 (2339+15800621)/2650 (3434βˆ’42)/14
1597 (2817+22953677)/3194 72βˆ’7
2897 (5137+75533477)/5794 12958/33βˆ’2
4181 (7375+157326845)/8362 90βˆ’8
5741 (10497+511865269)/11482 3915530/1189βˆ’1
6466 (2953+5940706)/3233 (710295βˆ’297)/292
7561 (13407+514518485)/15122 (414430βˆ’279)/139
9077 (16013+741527357)/18154 722/6βˆ’4
10946 (19308+467395890)/21892 110βˆ’9
14701 (26879+1945074605)/29402 (704899βˆ’2030)/2029
28657 (50549+7391012837)/57314 132βˆ’10
33461 (61181+10076746685)/66922 (13184030/2310βˆ’1)
37666 (17202+531921370)/18833 (81081730βˆ’3479)/3421
43261 (76711+16843627085)/86522 13345/70βˆ’2

Jimm and dynamics

Jimm conjugates[19] the Gauss map G (see Gauss–Kuzmin–Wirsing operator) to the so-called Fibonacci map Ξ¦ ,[20] i.e. Ξ¦=J∘G∘J.

The expression of Jimm in terms of continued fractions shows that, if a real number x obeys the Gauss-Kuzmin distribution, then the asymptotic density of 1's among the partial quotients of J(x) is one, i.e. J(x) does not obey the Gauss-Kuzmin statistics. For example

21/3=[1,3,1,5,1,1,4,1,1,8,1,14,1,10,2,1,4,12,2,3,2,...]

J(21/3)=[2,1,3,1,1,1,4,1,1,4,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,2,3,1,1,2,1,1,1,1,1...]

This argument also shows that J sends the set of real numbers obeying the Gauss-Kuzmin statistics, which is of full measure, to a set of null measure.

Jimm on higher algebraic numbers

It is widely believed[21] that if x is an algebraic number of degree >2, then it obeys the Gauss-Kuzmin statistics.Template:Efn By the above remark, this implies that J(x) violates the Gauss-Kuzmin statistics. Hence, according to the same belief, J(x) must be transcendental. This is the basis of the conjecture[16] that Jimm sends algebraic numbers of degree >2 to transcendental numbers. A stronger version[22] of the conjecture states that any two algebraically related J(x), J(y) are in the same Template:Math-orbit, if x,y are both algebraic of degree >2.

Functional equations and equivariant modular forms

Given a representation ρ:PSL2(𝐙)β†’PGL2(𝐙), a meromorphic function h on β„‹ is called a ρ-covariant function if

h(Ξ³β‹…z)=ρ(Ξ³)β‹…h(z)for all zβˆˆπ‡,Ξ³βˆˆΞ“.

(sometimes h is also called a ρ-equivariant function). It is known that[23] there exists meromorphic covariant functions h on the upper half plane β„‹, i.e. functions satisfying h(Mz)=Mh(z). The existence of meromorphic functions satisfying a version of the functional equations for J is also known.[2]

Some codenumerator values

Below is a table of some codenominator values 41/k, where 41 is an arbitrarily chosen number.

k F(41/k) k F(41/k) k F(41/k) k F(41/k)
1 59369Γ—2789 11 17 21 3Γ—5Γ—11Γ—41 31 199
2 7Γ—2161 12 23Γ—3 22 31 32 17
3 5Γ—7Γ—19 13 5Γ—13 23 2Γ—3 33 131
4 5Γ—67 14 3Γ—281 24 22Γ—3 34 2Γ—3Γ—11
5 11Γ—19 15 23 25 22 35 26
6 3Γ—5Γ—7 16 19 26 7 36 3Γ—43
7 103 17 29 27 233 37 32Γ—23
8 32Γ—23 18 17 28 47 38 3Γ—137
9 31 19 34 29 17 39 9349
10 73 20 89Γ—199 30 13 40 3Γ—5Γ—7Γ—11Γ—41Γ—2161

See also

Notes

Template:Notelist

References

Template:Reflist

  1. ↑ 1.0 1.1 1.2 Koshy, T. (2001). Fibonacci and Lucas Numbers with Applications, Volume. John Wiley & Sons.
  2. ↑ 2.0 2.1 2.2 2.3 2.4 2.5 2.6 2.7 Uludağ, A. M.; Eren GΓΆkmen, B. (2022). "The conumerator and the codenominator". Bulletin des Sciences MathΓ©matiques. 180 (180): 1–31. doi:10.1016/j.bulsci.2022.103192. PMID 103192.
  3. ↑ 'Pisano' is another name of Fibonacci
  4. ↑ A. Tagiuri, Di alcune successioni ricorrenti a termini interi e positivi, Periodico di Matematica 16 (1900–1901), 1–12.
  5. ↑ https://arxiv.org/abs/1903.01407 Some Weighted Generalized Fibonacci Number Summation Identities, Part 1, arXiv:1903.01407
  6. ↑ https://arxiv.org/abs/2106.11838 Some Weighted Generalized Fibonacci Number Summation Identities, Part 2, arXiv:1903.01407
  7. ↑ Mahanta, P. J., & Saikia, M. P. (2022). Some new and old Gibonacci identities. Rocky Mountain Journal of Mathematics, 52(2), 645-665.
  8. ↑ 8.0 8.1 8.2 8.3 8.4 8.5 Uludağ, A. M.; Ayral, H. (2019). "An involution of reals, discontinuous on rationals, and whose derivative vanishes ae". Turkish Journal of Mathematics. 43 (3): 1770–1775. doi:10.3906/mat-1903-34.
  9. ↑ Dyer, J. L. (1978). "Automorphic sequences of integer unimodular groups". Illinois Journal of Mathematics 22 (1) 1-30.
  10. ↑ Jones, G. A., & Singerman, D. (1994). Maps, hypermaps and triangle groups. The Grothendieck Theory of Dessins d'Enfants (L. Schneps ed.), London Math. Soc. Lecture Note Ser, 200, 115-145.
  11. ↑ Manin YI (2004). Real multiplication and noncommutative geometry (ein Alterstraum). In the Legacy of Niels Henrik Abel: The Abel Bicentennial, Oslo, (pp. 685-727). Berlin, Heidelberg: Springer Berlin Heidelberg.
  12. ↑ D. Z. Djokovic, D.G. L. MILLER (1980), Regular groups of automorphisms of cubic graphs, J. Combin. Theory Ser. B 29 (1980) 195-230.
  13. ↑ Conder, M., & Lorimer, P. (1989). Automorphism groups of symmetric graphs of valency 3. Journal of Combinatorial Theory, Series B, 47(1), 60-72.
  14. ↑ R.S. Bird (2006) Loopless functional algorithms, in: International Conference on Mathematics of Program Construction, Jul 3, Springer, Berlin, Heidelberg, pp. 90–114.
  15. ↑ R. Hinze (2009), The Bird tree, J. Funct. Program. 19 (5) 491–508.
  16. ↑ 16.0 16.1 Uludag, A.M. and Ayral, H. (2021) On the involution Jimm. Topology and geometry–a collection of essays dedicated to Vladimir G. Turaev, pp.561-578.
  17. ↑ Aigner, Martin (2013). Markov's theorem and 100 years of the uniqueness conjecture : a mathematical journey from irrational numbers to perfect matchings. New York: Springer. ISBN 978-3-319-00887-5. OCLC 853659945.
  18. ↑ B. Eren, Markov Theory and Outer Automorphism of PGL(2,Z), Galatasaray University Master Thesis, 2018.
  19. ↑ Uludağ, A. M.; Ayral, H. (2018). "Dynamics of a family of continued fraction maps". Dynamical Systems. 33 (3): 497–518. doi:10.1080/14689367.2017.1390070.
  20. ↑ C. Bonanno and S. Isola. (2014). " A thermodynamic approach to two-variable Ruelle and Selberg zeta functions via the Farey map", Nonlinearity. 27 (5) 10.1088/0951-7715/27/5/897
  21. ↑ Bombieri, E. and van der Poorten, A. (1975): "Continued Fractions of Algebraic Numbers", in: Baker (ed.), Transcendental Number Theory, Cambridge University Press, Cambridge, 137-155.
  22. ↑ https://arxiv.org/abs/1808.09719 Testing the transcendence conjectures of a modular involution of the real line and its continued fraction statistics, Authors: Hakan Ayral, A. Muhammed Uludağ, arXiv:1808.09719
  23. ↑ Saber, H., & Sebbar, A. (2022). Equivariant solutions to modular Schwarzian equations. Journal of Mathematical Analysis and Applications, 508(2), 125887