International Journal of Mathematics and Mathematical Sciences

Volume 2014 (2014), Article ID 832647, 5 pages

http://dx.doi.org/10.1155/2014/832647

Research Article

The Behavior of Midsets When Repeatedly Taking the Midset of Two Lines in Geometry

Joshua M. Fitzhugh and David L. Farnsworth

School of Mathematical Sciences, Rochester Institute of Technology, Rochester, NY 14623, USA

Received 22 September 2013; Accepted 15 April 2014; Published 8 May 2014

Academic Editor: Hernando Quevedo

Copyright © 2014 Joshua M. Fitzhugh and David L. Farnsworth. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We study the outcome of taking midsets of two lines in geometry. We establish the algorithm for repeatedly finding these midsets and characterize the limiting midsets. We discuss the issue of angle measurement in Minkowski geometries, especially with respect to the limiting midsets.

1. Introduction

An important class of planar Minkowski geometries are those that are determined by the unit circles for [1, 2]. These are designated or simply geometries. The most important example is Euclidean geometry with . Our concern is with geometry, which is sometimes called taxicab, Manhattan, or city block geometry [3]. Our main interest is in the midsets of two lines in this geometry.

The midsets of two points or of a point and a line are less nuanced than the midsets of two lines. The midset of two points, which is all points equidistant from the two points, can have different shapes, but generally it is a piecewise linear set of three segments [3, pages 8-9]. The midset of a point and a line is an parabola, which has the appearance of an approximation of an Euclidean parabola by line segments [3, page 39].

The midset of two lines is all points equidistant from the two lines. In Euclidean geometry, repeatedly taking midsets settles at the first or second step into a simple oscillation between pairs of orthogonal lines. The midset of the two intersecting and distinct lines and is the perpendicular lines and . Repeatedly finding midsets oscillates between these two orthogonal lines and a pair of lines rotated 45° from them. If the original lines are orthogonal, that is, , the oscillatory behavior begins at the first step. As seen in Section 2, in geometry, repeatedly finding midsets of two lines generally does not produce this oscillatory behavior, unless the original lines are orthogonal. Subsequently, “midset” indicates “ midset.”

In Minkowski geometries, normality to a line is not reflexive; that is, the line perpendicular to the line that is perpendicular to the original line is not parallel to the original line, except in the case that the space’s unit circle is a Radon curve [2, pages 233-234], [4, pages 137-138], and [5, page 145]. Analogously, we show that in general taking midsets is not reflexive in geometry; that is, the midset of the midset of two lines is not the original lines.

Without loss of generality, place the origin at the intersection of the original lines. In geometry the distance from a point to a line is measured either parallel to the -axis or parallel to the -axis. For , if , then the distance is measured parallel to the -axis; if , then the distance is measured parallel to the -axis; and if , then either direction gives the same distance.

There are ten configurations for the original lines. They are labeled according to the location of their portion in the closed upper half plane. For our purposes, octants are open sets that do not include their boundaries, which are the axes and the lines . The configurations are as follows.

(1)The lines are in octants separated by another octant.(2)The lines are and , or the lines are the axes.(3)One line is either or and the other line is an axis.(4)Both lines are in one octant.(5)The lines are in neighboring octants in adjacent quadrants or separated by two octants.(6)The lines are in neighboring octants in the same quadrant.(7)One line is an axis and the other line is in a nonadjacent octant.(8)One line is an axis and the other line is in an adjacent octant.(9)One line is either or and the other line is in a nonadjacent octant.(10)One line is either or and the other line is in an adjacent octant.

In Section 2, we show that Configuration 1 is a kind of attractor when repeatedly taking midsets of two lines. In Section 3, we establish the algorithm for finding midsets of lines in Configuration 1 and characterize the limiting midsets. Perhaps somewhat surprisingly, in most cases these limiting midsets are not the geometry’s natural lines of symmetry, which are the axes and . In Section 4, we discuss the issue of angle measurement in Minkowski geometries, especially with respect to the limiting midsets.

2. Finding Midsets of Two Lines

We show that Configuration 1 is a kind of attractor when repeatedly taking midsets of two lines in any configuration. Within no more than three steps, iteratively taking midsets of lines in any configuration leads to a set in Configuration 1 or 2. We show that the midset of lines in Configuration 1 is also in Configuration 1. Since Configuration 2 is simple, only the properties of lines initially in Configuration 1 are discussed in Sections 3 and 4.

Theorem 1. For lines in Configuration 1, the midset is in Configuration 1, and the midset of the midset is in Configuration 1 in the original octants.

Proof. Without loss of generality take the lines

with and . The midset of (1) is the lines

with and . The midset is in Configuration 1, but in octants different from the original lines. The midset of (2) is

with and , which is in Configuration 1 in the same octants as the original lines.

Theorem 2. For initial lines in Configuration 1, the midset of the midset is the original lines if and only if the original lines are orthogonal in the Euclidean sense. If the original lines are orthogonal in the Euclidean sense, then their midset is orthogonal lines that are rotated 45° from the original pair of lines.

Proof. Setting and in (3) and (4), each gives the identity , and this is equivalent to . Hence, setting gives , and vice versa. Substituting for in (3) gives and . For the second statement in the theorem, set in (2) to obtain and giving and, following some trigonometry, the angle is 45°.

The following theorem can be seen with simple diagrams.

Theorem 3. For initial lines in Configuration 2, the midset of the lines and is the axes, and the midset of the axes is the lines and .

Theorem 4. For initial lines in Configuration 3, the midset of the midset is in Configuration 1.

Proof. For a typical example, take the line and the -axis, whose midset is and the -axis. The midset of those lines is and , which is in Configuration 1.

Theorem 5. Repeatedly taking midsets no more than three times of lines in Configurations 4 through 10 yields lines in Configurations 1 or 2.

Proof. For a typical example in Configuration 4, take and for . The midset is and the -axis. The midset of this midset is and , where and , which is in Configuration 1.

For a typical example in Configuration 5, take and for and . The midset is and the -axis. As in Configuration 4, the next midset is in Configuration 1.

For a typical example in Configuration 6, take and for and , whose midset is and , where and . This midset is in Configurations 1 or 5, except for the special case for which and , which is in Configuration 2.

Configurations 7–10 can be shown to produce Configuration 1 in no more than three steps by noting that typical examples for those configurations tighten an inequality used for Configurations 1 or 6 and subsequently yield lines in Configuration 1.

Since all configurations of initial lines lead to midsets in Configurations 1 or 2 within no more than three steps and since Configuration 2 is relatively simple, only Configuration 1 is discussed subsequently.

3. Midsets for Configuration 1

The algorithm for the sequence of slopes of the midsets of initial lines in Configuration 1 follows.

Algorithm 6. Beginning with the lines

with and , the slopes of the first midset are

with and . The slopes of the second midset, which is the midset of the first midset (6), are

with and . The slopes of the third midset, which is the midset of the second midset, are

with and . In general, for odd ,

with and . For even ,

with and .

Table 1 contains the positive angle of the limiting even-numbered midsets for initial lines at five evenly spaced angles from 4.5° to 40.5° incremented by 9.0°, giving slopes , and at five evenly spaced angles from 94.5° to 130.5° also incremented by 9.0°, giving slopes . The angle of the second line in the limiting midset is obtained by adding 90°. The angles and slopes of the limiting odd-numbered midsets can be obtained by a 45° rotation of the limiting lines of the even-numbered midsets. Limiting angles are rounded to two decimal places. No more than five pairs of taking midsets are required to obtain each tabulated value. For the entries on the main diagonal, the initial lines are orthogonal; that is, . Euclidean angle measure is used only for reference. Indeed, most formulas involve only the slopes of the lines. See Section 4 about angle measurement.

Table 1: Limiting angles in degrees are given for even-numbered midsets for selected lines and in Configuration 1.

\
94.5
103.5
112.5
121.5
130.5

4.5
4.50
9.10
14.11
19.91
27.10

13.5
9.10
13.50
18.20
23.53
30.01

22.5
14.11
18.20
22.50
27.31
33.07

31.5
19.91
23.53
27.31
31.50
36.46

40.5
27.10
30.01
33.07
36.46
40.50

Theorem 7. If Algorithm 6 converges, it approaches a cycle of period two, alternating between pairs of orthogonal lines.

Proof. Consider even. The proof for odd is almost identical. From (10)

and from (9)

Substituting (12) into (11) gives

In (13) set , and in (14) set . Each of these gives .

The slopes of the limiting two lines are designated by and . It may be somewhat surprising that in most cases the limiting midsets are not the geometry’s natural lines of symmetry, which are the axes and .

An interesting symmetry in the outcomes of the iterative process is illustrated by the symmetry about the main diagonal in Table 1. If the initial lines are in Configuration 1, then , , or . For the last condition, Theorem 2 says that the iterative process of finding midsets alternates between the initial lines and a pair of lines obtained by a 45° rotation. In Table 1, instances are on the main diagonal.

The condition corresponds to , and examples are above the main diagonal in Table 1. For , and examples are below the main diagonal in Table 1. To distinguish initial lines and outcomes of iterations for these two cases, we introduce primes for those with initial lines with . That is, use , , , , , , , and .

Theorem 8. Start with the two initial lines and with corresponding to , and further two initial lines and with corresponding to . Assume further the identities and . Then and for all even .

Proof. We use mathematical induction. For , . Similarly, . Assume that

for even. From (13) and (14)

Substituting (15) into (16) and using (13) and (14) give and .

Theorem 9. If , then for n even, , , and , and the angle between the midset’s lines is monotonically decreasing toward 90°. If , then for n even, , , and , and the angle between the midset’s lines is monotonically increasing toward 90°. Symmetrically placed initial lines have the same pairs of orthogonal lines in the limit, which always exists.

Proof. The proof for the case is outlined. The other case’s proof is very similar. Using (13) with , set , which reduces to . Reversing the algebraic steps gives . Similarly, using (14) with , set , which reduces to . Reversing the steps gives . To see that , for multiply (13) and (14), which becomes

This is seen to be greater than −1 by setting it greater than −1 and performing the reversible steps of cross-multiplying by the negative denominator, expanding, cancelling terms, and factoring, giving

The first factor is positive since , and the second factor is negative for and . Mathematical induction on gives the results for even . The slopes are an increasing sequence, which is bounded above, since for all . The limiting slope exists, and, using Theorems 7 and 8, the process of taking midsets monotonically approaches a cycle alternating between pairs of orthogonal lines, since .

4. Definitions of Angle and Angle Bisector

Thompson discusses at length the “ambiguity about the definition of angle” [1, page 273], and Busemann declares the “great arbitrariness of angle measure” [6, page 275]. Angle measure remains an active area of study in geometry and analysis [7–10]. Trigonometric functions are generally defined in terms of lines, rays, or vectors. For example, calling them vectors, the cosine of a pair is the dot product of the vectors divided by the product of their lengths. Angle measure is virtually unique in Euclidean geometry, but there are many natural choices in Minkowski geometry, depending upon the properties that are desirable. For example, in geometry, the angle between on the unit circle near is , if the angle is defined by the arc length from the -axis along the unit circle. Defining the sine function as the length of the opposite side divided by the hypotenuse in measure, the ratio of sine to the angle is the constant 1/2. In order to preserve certain properties of derivatives of trigonometric functions with respect to their arguments, Thompson selects a measure of angle that preserves the property that the limit as the angle approaches zero of the sine divided by the angle is 1 [1, pages. 264–266]. Generally, the angle measure between two vectors or rays that share the same Euclidean angle measurement is different, since the size of the angle depends upon the specific directions of the vectors or rays.

Except for special situations, such as the lines being the axes, the limiting line in Section 3 is not an angle bisector. Various definitions of angle give different angle bisectors. Here, as elsewhere, Euclidean angle measure is used only for easy reference. The slope is the fundamental quantity.

We consider four options of angle bisector for lines in Configuration 1.

(1)Use Euclidian angle measure and bisectors.(2)Use angles based on the subtended arc length of the unit circle and their bisectors.(3)Use the first step in Algorithm 6; that is, in Configuration 1, use in (4).(4)Use the lines obtained in the limit in Section 3.

Using Euclidian measure follows Busemann [6, page 277] and [11]. Option 2 is the same as using area measure, since in geometry the subtended arc length has a constant of proportionality with the Euclidean area.

For an example, take the lines and in Configuration 1, and compare the bisectors obtained in the second octant.

For Option 1, the Euclidean angle bisector has the equation = = = .

For Option 2, the unit circle centered at the origin is the square with vertices at , , , and . Its circumference is 8. The length of the subtended arc along the portion of the unit circle between and the positive -axis is . The length of the subtended arc between and the positive -axis is . One-half the length of the subtended arc between and is . Add this length to the arc length between the -axis and to obtain . The tangent of the angle that this bisector makes with the -axis is , which corresponds to the angle .

For Option 3, , which corresponds to the angle .

For Option 4, using the value in Table 1, the limiting line is .

Depending upon which option is selected, the angle that the bisector makes with the -axis is 67.5°, 73.10°, 82.29°, or 72.10°, in this example.

Conflict of Interests

The authors declare that they have no conflict of interests regarding the publication of this paper.

References

A. C. Thompson, Minkowski Geometry, Cambridge University Press, Cambridge, UK, 1996.

R. V. Benson, Euclidean Geometry and Convexity, McGraw-Hill, New York, NY, USA, 1966.

E. F. Krause, Taxicab Geometry, Dover, New York, NY, USA, 1986.

H. Busemann and P. J. Kelly, Projective Geometry and Projective Metrics, Academic Press, New York, NY, USA, 1953.

J. C. Á. Paiva and A. Thompson, “On the perimeter and area of the unit disc,” The American Mathematical Monthly, vol. 112, no. 2, pp. 141–154, 2005.

H. Busemann, Geometry of Geodesics, Academic Press, New York, NY, USA, 1955.

B. V. Dekster, “An angle in Minkowski space,” Journal of Geometry, vol. 80, no. 1-2, pp. 31–47, 2004.

B. V. Dekster, “A metric space of directions in Minkowski space,” Journal of Geometry, vol. 80, no. 1-2, pp. 48–64, 2004.

V. W. Thürey, “A generalization of Euclidean angle,” Journal of Convex Analysis, vol. 20, no. 4, pp. 1025–1042, 2013.

V. W. Thürey, “Angles and a classification of normed spaces,” Annals of Functional Analysis, vol. 4, no. 1, pp. 114–137, 2013.

H. Busemann, “The foundations of Minkowskian geometry,” Commentarii Mathematici Helvetici, vol. 24, no. 1, pp. 156–187, 1950.