Mediant (mathematics)

In mathematics, the mediant of two fractions, generally made up of four positive integers

:$\frac \quad$ and $\quad \frac \quad$ is defined as $\quad \frac.$

That is to say, the numerator and denominator of the mediant are the sums of the numerators and denominators of the given fractions, respectively. It is sometimes called the freshman sum, as it is a common mistake in the early stages of learning about addition of fractions.

Technically, this is a binary operation on valid fractions (nonzero denominator), considered as ordered pairs of appropriate integers, a priori disregarding the perspective on rational numbers as equivalence classes of fractions. For example, the mediant of the fractions 1/1 and 1/2 is 2/3. However, if the fraction 1/1 is replaced by the fraction 2/2, which is an equivalent fraction denoting the same rational number 1, the mediant of the fractions 2/2 and 1/2 is 3/4. For a stronger connection to rational numbers the fractions may be required to be reduced to lowest terms, thereby selecting unique representatives from the respective equivalence classes.

In fact, mediants commonly occur in the study of continued fractions and in particular, Farey fractions. The ''n''th Farey sequence ''F''_''n'' is defined as the (ordered with respect to magnitude) sequence of reduced fractions ''a''/''b'' (with coprime ''a'', ''b'') such that ''b'' ≤ ''n''. If two fractions ''a''/''c'' < ''b''/''d'' are adjacent (neighbouring) fractions in a segment of F_n then the determinant relation $bc-ad=1$ mentioned above is generally valid and therefore the mediant is the ''simplest'' fraction in the interval (''a''/''c'', ''b''/''d''), in the sense of being the fraction with the smallest denominator. Thus the mediant will then (first) appear in the (''c'' + ''d'')th Farey sequence and is the "next" fraction which is inserted in any Farey sequence between ''a''/''c'' and ''b''/''d''. This gives the rule how the Farey sequences ''F''_''n'' are successively built up with increasing ''n''.

The Stern–Brocot tree provides an enumeration of all positive rational numbers via mediants in lowest terms, obtained purely by iterative computation of the mediant according to a simple algorithm.

Properties

* The mediant inequality: An important property (also explaining its name) of the mediant is that it lies strictly between the two fractions of which it is the mediant: If $a/c < b/d$ and $c\cdot d> 0$, then $\frac a c < \frac < \frac b d.$ This property follows from the two relations $\frac-\frac a c= =\left( \frac-\frac a c \right)$ and $\frac b d-\frac= =\left( \frac-\frac a c \right).$
* Componendo and Dividendo Theorems: If $a/c = b/d$ and $c \ne 0,\ d \ne 0$, then $\frac a c = \frac b d = \frac$
:* Componendo:
:$\frac = \frac$
:* Dividendo:
:$\frac = \frac$
* Assume that the pair of fractions ''a''/''c'' and ''b''/''d'' satisfies the determinant relation $bc-ad=1$. Then the mediant has the property that it is the ''simplest'' fraction in the interval (''a''/''c'', ''b''/''d''), in the sense of being the fraction with the smallest denominator. More precisely, if the fraction $a'/c'$ with positive denominator c' lies (strictly) between ''a''/''c'' and ''b''/''d'', then its numerator and denominator can be written as $a'=\lambda_1 a + \lambda_2 b$ and $c' = \lambda_1 c + \lambda_2 d$ with two ''positive'' real (in fact rational) numbers $\lambda_1,\,\lambda_2$. To see why the $\lambda_i$ must be positive note that $\frac-\frac a c=\lambda_2$ and $\frac b d - \frac=\lambda_1$ must be positive. The determinant relation $bc-ad=1 \,$ then implies that both $\lambda_1,\,\lambda_2$ must be integers, solving the system of linear equations $a'=\lambda_1 a+ \lambda_2 b$ $c' = \lambda_1 c+ \lambda_2 d$ for $\lambda_1,\lambda_2$. Therefore, $c'\ge c+d.$
* The converse is also true: assume that the pair of reduced fractions ''a''/''c'' < ''b''/''d'' has the property that the ''reduced'' fraction with smallest denominator lying in the interval (''a''/''c'', ''b''/''d'') is equal to the mediant of the two fractions. Then the determinant relation holds. This fact may be deduced e.g. with the help of Pick's theorem which expresses the area of a plane triangle whose vertices have integer coordinates in terms of the number v_interior of lattice points (strictly) inside the triangle and the number v_boundary of lattice points on the boundary of the triangle. Consider the triangle $\Delta(v_1,v_2,v_3)$ with the three vertices ''v''₁ = (0, 0), ''v''₂ = (''a'', ''c''), ''v''₃ = (''b'', ''d''). Its area is equal to $\text(\Delta) = \, .$ A point $p=(p_1,p_2)$ inside the triangle can be parametrized as $p_1=\lambda_1 a+\lambda_2 b,\; p_2=\lambda_1 c+\lambda_2 d,$ where $\lambda_1\ge 0,\,\lambda_2 \ge 0, \,\lambda_1+\lambda_2 \le 1.$ The Pick formula $\text(\Delta)=v_\mathrm + - 1$ now implies that there must be a lattice point lying inside the triangle different from the three vertices if (then the area of the triangle is $\ge 1$). The corresponding fraction ''q''₁/''q''₂ lies (strictly) between the given (by assumption reduced) fractions and has denominator q_2 = \lambda_1 c+ \lambda_2 d \le \max(c,d) as $\lambda_1+\lambda_2 \le 1.$
* Relatedly, if ''p''/''q'' and ''r''/''s'' are reduced fractions on the unit interval such that , ''ps'' − ''rq'', = 1 (so that they are adjacent elements of a row of the Farey sequence) then $?\left(\frac\right) = \frac1 2 \left(?\left(\frac p q\right) + ?\left(\frac r s\right)\right)$ where is Minkowski's question mark function.

Graphical determination of mediants

A positive rational number is one in the form $a/b$ where $a,b$ are positive natural numbers; ''i.e.'' $a,b\in\mathbb^$. The set of positive rational numbers $\mathbb^$ is, therefore, the Cartesian product of $\mathbb^$ by itself; ''i.e.'' $\mathbb^=(\mathbb^)^2$. A point with coordinates $(b,a)$ represents the rational number $a/b$, and the slope of a segment connecting the origin of coordinates to this point is $a/b$. Since $a,b$ are not required to be coprime, point $(b,a)$ represents one and only one rational number, but a rational number is represented by more than one point; ''e.g.'' $(4,2),(60,30),(48,24)$ are all representations of the rational number $1/2$. This is a slight modification of the formal definition of rational numbers, restricting them to positive values, and flipping the order of the terms in the ordered pair $(b,a)$ so that the slope of the segment becomes equal to the rational number.

Two points $(b,a)\neq(d,c)$ where $a,b,c,d\in\mathbb^$ are two representations of (possibly equivalent) rational numbers $a/b$ and $c/d$. The line segments connecting the origin of coordinates to $(b,a)$ and $(d,c)$ form two adjacent sides in a parallelogram. The vertex of the parallelogram opposite to the origin of coordinates is the point $(b+d,a+c)$, which is the mediant of $a/b$ and $c/d$.

The area of the parallelogram is $bc-ad$, which is also the magnitude of the cross product of vectors $\langle b,a\rangle$ and $\langle d,c\rangle$. It follows from the formal definition of rational number equivalence that the area is zero if $a/b$ and $c/d$ are equivalent. In this case, one segment coincides with the other, since their slopes are equal. The area of the parallelogram formed by two consecutive rational numbers in the Stern–Brocot tree is always 1.

Generalization

The notion of mediant can be generalized to ''n'' fractions, and a generalized mediant inequality holds, a fact that seems to have been first noticed by Cauchy. More precisely, the weighted mediant $m_w$ of ''n'' fractions $a_1/b_1,\ldots,a_n/b_n$ is defined by $\frac$ (with $w_i>0$). It can be shown that $m_w$ lies somewhere between the smallest and the largest fraction among the $a_i/b_i$.

See also

* Mediant
* Padé approximant
* Stern–Brocot tree
* Parallel (operator)

References

{{Reflist

External links

Mediant Fractions
at cut-the-knot

MATHPAGES, Kevin Brown: Generalized Mediant

Fractions (mathematics)
Elementary arithmetic
Operations on numbers