Don Page comma: Difference between revisions

(One intermediate revision by the same user not shown)

Line 1:

A '''Don Page comma''' is a [[comma]] computed from two other intervals by the method suggested by the Don Page paper, [http://arxiv.org/abs/0907.5249 ''Why the Kirnberger Kernel Is So Small'']. If ''a'' and ''b'' are two rational numbers greater than 1, define ~~{{nowrap| ''~~r'' {~~{=}} (~~(''a'' - 1)(''b'' + 1)) / (~~(''~~b'' - 1~~)(''a'' + 1)~~) }}. ~~Suppose~~ ''r'' reduced to lowest terms is ''p''/''q'', ~~and ''a'' and ''b'' are written in [[monzo]] form as '''u''' and '''v'''. Then~~ the Don Page comma is defined as DPC(''a'', ''b'') = ''q'''''u''' - ''p'''''v''', or else minus that if the size in [[cent]]s is less than zero. The reason for introducing monzos is purely numerical; if monzos are not used the numerators and denominators of the Don Page comma quickly become so large they cannot easily be handled. In ratio form, the Don Page comma can be written {{nowrap| ''a''''q''/''b''''p'' }}, or the reciprocal of that if ~~that~~ is less than 1.

A '''Don Page comma''' or '''bimodular comma''' is a [[comma]] computed from two other intervals by the method suggested by the Don Page paper, [http://arxiv.org/abs/0907.5249 ''Why the Kirnberger Kernel Is So Small'']. If ''a'' and ''b'' are two rational numbers greater than 1, define <math>r=\frac{\left(a-1\right)\left(b+1\right)}{\left(a+1\right)\left(b-1\right)}</math>. If we write ''r'' reduced to lowest terms as ''p''/''q'', the Don Page comma is defined as DPC(''a'', ''b'') = {{nowrap| ''a''''q''/''b''''p'' }}, or else the reciprocal of that if it is less than 1. We may also express it in monzo form as ''q'''''u''' - ''p'''''v''' for ''a'' and ''b'' written in [[monzo]] form as '''u''' and '''v'''

== Bimodular approximants ==

If ''x'' is near to 1, then ln(''x'')/2 is approximated by {{nowrap| bim(''x'') {{=}} (''x'' - 1)/(''x'' + 1) }}, the bimodular approximant function, which is the {{w|Padé approximant}} of order (1, 1) to ln(''x'')/2 near 1. The bimodular approximant function is a {{w|Möbius transformation}} and hence has an inverse, which we denote {{nowrap| mib(''x'') {{=}} (1 + ''x'')/(1 - ''x'') }}, which is the (1, 1) Padé approximant around 0 for exp(2''x''). Then {{nowrap| bim(exp(2''x'')) {{=}} tanh(''x'') }}, and therefore {{nowrap| ln(mib(''x''))/2 {{=}} artanh(''x'') {{=}} ''x'' + ''x''3/''x'' + ''x''5/5 + … }}, from which it is apparent that bim(''x'') approximates ln(''x'')/2, and mib(''x'') approximates exp(2''x''), to the second order; we may draw the same conclusion by directly comparing the series for exp(2''x'') = 1 + 2''x'' + 2''x''2 + O(''x''3) with {{nowrap| mib(''x'') {{=}} 1 + 2''x'' + 2''x''2 + O(''x''3) }} and {{nowrap| ln(''x'')/2 {{=}} (''x'' - 1)/2 - (''x'' - 1)2/4 + O(''x''3) }}, which is the same to the second order as bim(''x''). Using mib, we may also define {{nowrap| BMC(''a'', ''b'') = DPC(mib(''a''), mib(''b'')) }}, where BMC is an acronym for ''bimodular comma''.

@@ Line 1: / Line 1: @@
-A '''Don Page comma''' is a [[comma]] computed from two other intervals by the method suggested by the Don Page paper, [http://arxiv.org/abs/0907.5249 ''Why the Kirnberger Kernel Is So Small'']. If ''a'' and ''b'' are two rational numbers greater than 1, define {{nowrap| ''r'' {{=}} ((''a'' - 1)(''b'' + 1)) / ((''b'' - 1)(''a'' + 1)) }}. Suppose ''r'' reduced to lowest terms is ''p''/''q'', and ''a'' and ''b'' are written in [[monzo]] form as '''u''' and '''v'''. Then the Don Page comma is defined as DPC(''a'', ''b'') = ''q'''''u''' - ''p'''''v''', or else minus that if the size in [[cent]]s is less than zero. The reason for introducing monzos is purely numerical; if monzos are not used the numerators and denominators of the Don Page comma quickly become so large they cannot easily be handled. In ratio form, the Don Page comma can be written {{nowrap| ''a''<sup>''q''</sup>/''b''<sup>''p''</sup> }}, or the reciprocal of that if that is less than 1.
+A '''Don Page comma''' or '''bimodular comma''' is a [[comma]] computed from two other intervals by the method suggested by the Don Page paper, [http://arxiv.org/abs/0907.5249 ''Why the Kirnberger Kernel Is So Small'']. If ''a'' and ''b'' are two rational numbers greater than 1, define <math>r=\frac{\left(a-1\right)\left(b+1\right)}{\left(a+1\right)\left(b-1\right)}</math>. If we write ''r'' reduced to lowest terms as ''p''/''q'', the Don Page comma is defined as DPC(''a'', ''b'') = {{nowrap| ''a''<sup>''q''</sup>/''b''<sup>''p''</sup> }}, or else the reciprocal of that if it is less than 1. We may also express it in monzo form as ''q'''''u''' - ''p'''''v''' for ''a'' and ''b'' written in [[monzo]] form as '''u''' and '''v'''
 == Bimodular approximants ==
+{{Todo|clarify|inline=1|text=rewrite GWS gibberish}}
 If ''x'' is near to 1, then ln(''x'')/2 is approximated by {{nowrap| bim(''x'') {{=}} (''x'' - 1)/(''x'' + 1) }}, the bimodular approximant function, which is the {{w|Padé approximant}} of order (1, 1) to ln(''x'')/2 near 1. The bimodular approximant function is a {{w|Möbius transformation}} and hence has an inverse, which we denote {{nowrap| mib(''x'') {{=}} (1 + ''x'')/(1 - ''x'') }}, which is the (1, 1) Padé approximant around 0 for exp(2''x''). Then {{nowrap| bim(exp(2''x'')) {{=}} tanh(''x'') }}, and therefore {{nowrap| ln(mib(''x''))/2 {{=}} artanh(''x'') {{=}} ''x'' + ''x''<sup>3</sup>/''x'' + ''x''<sup>5</sup>/5 + … }}, from which it is apparent that bim(''x'') approximates ln(''x'')/2, and mib(''x'') approximates exp(2''x''), to the second order; we may draw the same conclusion by directly comparing the series for exp(2''x'') = 1 + 2''x'' + 2''x''<sup>2</sup> + O(''x''<sup>3</sup>) with {{nowrap| mib(''x'') {{=}} 1 + 2''x'' + 2''x''<sup>2</sup> + O(''x''<sup>3</sup>) }} and {{nowrap| ln(''x'')/2 {{=}} (''x'' - 1)/2 - (''x'' - 1)<sup>2</sup>/4 + O(''x''<sup>3</sup>) }}, which is the same to the second order as bim(''x''). Using mib, we may also define {{nowrap| BMC(''a'', ''b'') = DPC(mib(''a''), mib(''b'')) }}, where BMC is an acronym for ''bimodular comma''.