Ceva s triangle inequalities

Size: px
Start display at page:

Download "Ceva s triangle inequalities"

Transcription

1 Ceva s triangle inequalities Árpád Bényi Department of Mathematics, Western Washington University, 56 High Street, Bellingham, Washington 985, USA Arpad.Benyi@wwu.edu Branko Ćurgus Department of Mathematics, Western Washington University, 56 High Street, Bellingham, Washington 985, USA Branko.Curgus@wwu.edu Corresponding author. This work is partially supported by a grant from the Simons Foundation No to Árpád Bényi. 00 Mathematics Subject Classification: Primary 6D07, 5M04; Secondary 5M5, 5B48

2 Abstract. We characterize triples of cevians which form a triangle independent of the triangle where they are constructed. This problem is equivalent to solving a three-parameter family of inequalities which we call Ceva s triangle inequalities. Our main result provides the parametrization of the solution set.. Introduction In this article we investigate a class of inequalities of the form fa,b,c,ρ fb,c,a,σ < fc,a,b,τ < fa,b,c,ρ+fb,c,a,σ where a,b,c belongs to T = { a,b,c R 3 : a b < c < a+b }. and f : T R R + is some function with positive values. We will refer to as Ceva s triangle inequalities. Clearly, expresses the fact that for some parameters ρ,σ,τ R the lengths fa,b,c,ρ, fb,c,a,σ, fc,a,b,τ form a triangle whenever the lengths a,b,c form a triangle. This problem, albeit much more general, is in the spirit of Bottema, Djordjević, Janić, Mitrinović and Vasić [, Chapter 3], in particular the statement 3.3 which is attributed to Brown []. For example, consider the function ha,b,c,ρ = ρ a a b +b c +c a a 4 +b 4 +c 4. Recall that ha,b,c, is the length of the altitude orthogonal to the side of length a in a triangle with sides a,b,c. It is easy to see that, with a = 3,b = 8,c = 9, the altitudes do not form a triangle. Thus, fails to hold for all a,b,c T with ρ = σ = τ for the function h. However, if we replace f with /h, then it turns out that does hold for all ρ = σ = τ R \ {0} and all a,b,c T. For a connection between the reciprocals of the altitudes and a Heron-type area formula, see Mitchell s note [6]. In this article we will study with fa,b,c,ρ = ρρ a +ρb + ρc. By Stewart s theorem, fa,b,c,ρ gives the length of the cevian AA ρ in a triangle ABC with sides BC = a,ca = b, AB = c and where the point A ρ lies on the Date: November 8, 0. Key words and phrases. triangle inequality, triangle inequality for cevians, cone preserving matrices, common invariant cone.

3 CEVA S TRIANGLE INEQUALITIES line BC with BAρ = ρ BC. Similarly, fb,c,a,σ = BBσ and fc,a,b,τ = CC τ where B σ and C τ lie on the lines CA and AB respectively, with CBσ = σ CA and AC τ = τ AB. Indeed, it is this connection with cevians that inspired the name of the inequalities. Now, it is well known that the medians of a triangle form a triangle as well. This implies that is satisfied for all a,b,c T when ρ = σ = τ = /. In fact, is true for all a,b,c T whenever ρ = σ = τ R. That is, for any triangle ABC and for all ξ R, the cevians AA ξ,bb ξ, and CC ξ always form a triangle. This statement is proved in the book by Mitrinović, Pečarić and Volenec [7, Chapter I.3.4] where it is attributed to Klamkin [5]; see also the articles of Hajja [3, 4] for a geometric proof. Interestingly, for an arbitrary triangle ABC, the triple ρ,σ,τ =,,0 produces the sides AA,BB, and CC 0 which also form a triangle. In other words, for the given f : T R R +, also holds for all a,b,c T and some nondiagonal triple ρ,σ,τ { r,s,t R 3 : r = s = t }. This can be proved by using the methods followed in Figure. The property does not hold for all triples of real numbers. Consider, for example, ρ,σ,τ = /4,/,5/6. In the right triangle ABC with AB =,BC = 8,CA = 3, we easily find AA ρ = 3/.5, BB σ = 3/ =.5, and CC τ = 7/ Thus, AA ρ + BB σ < CC τ, which means that the three cevians do not form a triangle in this case. However, for the same triple but the right triangle ABC with AB =,BC =,CA =, we find AA ρ = 7/4.03,BB σ = / 0.707, and CC τ = 37/6.04, which are now clearly seen to form a triangle. The cautionary examples above lead us to the following problem. Problem. Characterize the set A R 3 of all triples ρ,σ,τ R 3 such that, for the function f given by, Ceva s triangle inequalities hold for all a,b,c T. In other words, characterize the set of all triples ρ,σ,τ such that for all nondegenerate triangles ABC the cevians AA ρ,bb σ and CC τ form a non-degenerate triangle as well. The main result of this paper is the complete parametrization of the set A. Theorem. Let φ = + 5/ denote the golden ratio. The set A is the union of the following three sets { } 3 ξ,ξ,ξ : ξ R, { } 4 ξ, ξ,ξ, ξ, ξ, ξ, ξ,ξ, ξ : ξ R\{ φ,φ} and 5 { ξ, ξ,ξ, ξ, ξ, ξ, ξ,ξ, ξ : ξ φ,φ }. A picture of the solution set A is given in Figure. Notice that the following six points are excluded in the second set: φ,φ, φ, φ,φ,φ, φ, φ,φ, 6 φ,φ,φ, φ, φ,φ, φ,φ, φ.

4 CEVA S TRIANGLE INEQUALITIES 3 A = C τ B C A ρ A ρ B σ Figure. Cevians always form a triangle 3 τ σ 0 ρ 3 3 Figure. The set A

5 4 CEVA S TRIANGLE INEQUALITIES These points are the only common accumulation points of both the second and the third set in the parametrization of A. This claim follows from the identities φ, φ,φ = φ, φ,φ, φ, φ, φ =,φ,, φ φ which are consequences of φ φ = 0. As we will see in Subsection 3.3, these six points are exceptional since for an arbitrary triangle they correspond to degenerate triangles formed by the three cevians. The remainder of the paper is devoted to the proof of the Theorem. First, in Subsection., we introduce a one-parameter family of inequalities whose solution set B is guaranteed to contain A. In Section we use a combination of arguments from analytic and synthetic geometry to prove that B is a subset of the union of the sets defined in 3, 4, 5 and 6. In Section 3, we use linear algebra to prove that the union of the sets in 3, 4, 5 is in fact contained in A and that the points in 6 are not in A. This provides the parametrization given in the Theorem. It is worthwhile noting that the discussion about the set A reduces to the observation that an uncountable family M of 3 3 matrices has a common invariant cone; that is, for a particular cone Q we have MQ Q for all M M. The question about when does a finite family of matrices share an invariant cone is of current interest and already non-trivial. For example, in the simplest case of a finite family that is simultaneously diagonalizable one has a characterization for the existence of such an invariant cone, but this criteria does not seem to be easily applicable; see Rodman, Seyalioglu, and Spitkovsky [9, Theorem ] and also Protasov [8].. The set B Recall that, for a given a,b,c T and a triple ρ,σ,τ R 3, we have the following expressions for the lengths of the cevians: Specifically, AA ρ = fa,b,c,ρ, BB σ = fb,c,a,σ, CC τ = fc,a,b,τ. AA ρ = ρρ a +ρb + ρc, BB σ = σa +σσ b +σc, CC τ = τa + τb +ττ c. Clearly, a triple ρ,σ,τ belongs to A if and only if the following three-parameter family of inequalities is satisfied: 7 AA ρ BB σ < CC τ < AA ρ +BB σ for all a,b,c T... The limiting inequalities. We now introduce the one-parameter family of inequalities emerging from 7 by letting a,b,c belong to the faces of the closure of the infinite tetrahedron T.

6 Let a = b+c, b,c > 0. Then Similarly, CEVA S TRIANGLE INEQUALITIES 5 AA ρ = ρρ a +ρa c + ρc = ρa c = ρa c. BB σ = σb a, CC τ = τc+b. Thus, for all b,c > 0, we have ρb+c c σb b c τc+b ρb+c c + σb b c. Equivalently, by letting b/c = t, we have 8 ρt+ σt t τ +t ρt+ + σt t, for all t > 0. Analogously, by considering the other two faces of T, we obtain the following two inequalities 9 ρ+t σt+ τt t ρ+t + σt+, 0 for all t > 0. ρt t σ +t τt+ ρt t + σ +t,.. The definition and a partition of the set B. By B we denote the set of all ρ,σ,τ R 3 which satisfy all three limiting inequalities 8, 9, and 0 for all t > 0. By B τ we denote the horizontal section of B at the level τ, that is, the subset of B with a fixed τ. Then B = τ R B τ. In the previous subsection we have shown that A B. In the remainder of this section we study the sets B τ. The following four points play the central role in the characterization: P τ := τ,τ,τ, P τ := τ, +τ,τ, P τ := τ, τ,τ, P τ := +τ, τ,τ. Note that the points P τ,τ R, appear in 3 and most of the points P τ, P τ, P τ, τ R, appear in B τ is a subset of the union of two lines. Let τ R be fixed. Let l j τ,j {,}, be the lines determined by the points P j τ and P j τ. We first show that if ρ,σ,τ B τ, then ρ τ + = στ +τ. We break our discussion into three cases, depending on the range of the parameter τ. If τ 0, and we let t τ + in 8, then the leftmost inequality gives. If τ τ 0,], then we let t in the first part of 0 to get τ ρ τ τ = σ + τ, τ τ τ

7 6 CEVA S TRIANGLE INEQUALITIES which implies. Finally, if τ >, let t = in the first inequality of 9 to τ obtain ρ+ = σ τ τ +, which implies. Elementary considerations yield that the graph of is the union l τ l τ. Thus B τ l τ l τ..4. The sets B 0 and B. We show now that B 0 = { P ij 0 i,j {,} }. Recall that the points ρ,σ,τ must satisfy. Substituting τ = 0 in this equation gives ρ =, thus ρ = 0 or ρ =. If ρ = 0, then 9 is t σt+ t+ t+ σt+, t > 0. If we let t 0 +, we get σ σ, thus σ =, that is σ = 0 or σ =. So our points are 0,0,0 and 0,,0. If ρ =, then 0 is t σ +t t + σ +t, t > 0. Substituting t = gives σ + σ +, that is σ = 0 or σ =. This gives the points,0,0 and,,0. All in all, the four points found are exactly P ij 0,i,j {,}. Similarly, it can be shown that B = { P ij i,j {,} }..5. A family of crosses associated with the limiting inequalities. In the rest of this section we assume that τ R \{0,}. In this subsection we establish some preliminary facts which are then needed in the last subsection to prove that B τ = { P ij τ i,j {,} } or B τ = { P ij τ i,j {,} } l τ l τ. Let t > 0 be fixed. Notice that inequalities 8, 9 and 0 can be written in the form atρ bt ctσ dt gt atρ bt + ctσ dt, where a,b,c,d,g are all affine functions of t; one of the coefficients of g depends on the fixed value τ. Since gt = 0 yields, we will only consider the case gt 0. Renaming ρ = x, σ = y, we are interested in fully understanding the geometric representation in the xy-plane of inequalities in the generic form ax b cy d g ax b + cy d, where a,b,c,d,g R\{0}. Note that is equivalent to 3 a x b c y d g a g c a x b + c y d. g a g c The canonical form of such inequalities is 4 x y x + y. Elementary considerations show that the solution set of 4 is the set represented in Figure 3. We will refer to it as the canonical cross. It is centered at the origin

8 CEVA S TRIANGLE INEQUALITIES 7 and its marking points are, in counterclockwise direction,, 0,0,,, 0, and 0,. Note also that there are two pairs of parallel lines that define the boundary of the canonical cross, and the slopes of the lines that are not parallel have values and. Figure 3. The canonical cross Figure 4. Shifted and skewed The change of coordinates x a x a b, y c y d c, g transforms 4 into 3 and the canonical cross is transformed into a shifted and skewed version of it, illustrated in Figure 4. Hence, a shifted and skewed cross is the solution set of. Its center is at b a, d c, and its marking points are b a + g a, d c, b a, d c + g c, b a g a, d c and b a, d c g c. The interior of the parallelogram with vertices at the marking points will be referred to as the nucleus of the cross. The equations of two pairs of parallel boundary lines of this cross are y = a c x b a + d c ± g c and y = a c x b a + d c ± g c. For a given t > 0, the limiting inequality 8 has the form. Hence its solution set is a cross inthe ρσ-planeat thefixed level τ. We denotethis cross by Cross 8 t,τ. The equations of the two pairs of the parallel boundary lines of this cross are 5 y = t+ t x t+ + t+ t ± τ+t t and y = t+ t g x t+ + t+ t ± τ+t t. Similarly, Cross 9 t,τ and Cross 0 t,τ refer to the solution sets of 9 and 0. The equations of the two pairs of the corresponding parallel boundary lines of these cross, respectively, are 6 y = t+ x+ t + t+ ± τt t t+ and y = t+ x+ t + t+ ± τt t t+, y = t x t+ t + t ± τt+ and y = t x t+ t + t 7 ± τt+.

9 8 CEVA S TRIANGLE INEQUALITIES By Cτ we denote the family of all these crosses: Cτ = { Cross 8 t,τ : t > 0 } { Cross 9 t,τ, t > 0 } { Cross 0 t,τ, t > 0 }. In the next subsection we will need the following two facts about Cτ: Fact. The points P i τ,p i τ,i {,}, lie on the distinct parallel boundary lines of each of the crosses in Cτ. Fact. For each slope m R \ {0,} there is a cross in Cτ with the boundary lines going through P τ and P τ having slope m and, consequently, with the boundary lines through P τ and P τ having slope m. Fact is verified by substitution of the ρσ-coordinates of P ij τ,i,j {,}, in the equations of the boundary lines of the crosses in Cτ. For example, the ρσcoordinates of P τ satisfy the left equation in 5 with sign. The table below gives the complete account: P τ P τ P τ P τ 5 left eq. with left eq. with + right eq. with right eq. with + 6 left eq. with + left eq. with right eq. with + right eq. with 7 right eq. with + right eq. with left eq. with + left eq. with To prove Fact we distinguish three cases. If m >, then, by 5 and the table above, Cross 8 /m,τ has the desired property. If 0 < m <, then, by 6 and the table, Cross 9 +/m,τ proves Fact. If m < 0, then, by 7 and the table, Cross 0 m,τ is the one whose existence is claimed in Fact. Notice that when the slope m is that of the line l, the cross as in Fact is degenerate, that is, it is the union of the lines l and l..6. Intersection of crosses determined by four points. By Fact we know that the four points P ij τ,i,j {,}, belong to all the crosses in Cτ. Moreover, there is possibly only one extra point having the property that it lies on all the crosses. That point is P 0 τ := τ, τ,τ, which is the intersection of the lines l τ and l τ defined in Subsection.3. Note that some of the points P 0 τ, τ R\{0,}, appear in 5. Now, for which τ-s could one expect P 0 τ to belong to all the crosses in Cτ? Letting t 0 + in 8 and 0, we get ρ τ ρ + and σ τ + σ. If we substitute ρ = / τ and σ = τ /τ, we obtain that τ must satisfy τ τ τ τ τ + τ. Straightforward calculations show that the solution of the above inequalities is the following union of disjoint intervals: [ ] [ 5, ] [ 5 3 5, + ] 5 + 5, 3+ 5,

10 CEVA S TRIANGLE INEQUALITIES 9 or in terms of the golden ratio φ: [ φ, φ ] [ φ,φ ] [ φ,φ ]. In Subsection 3.3 we will indeed show that, for τ in the interior of this set, the point P 0 τ belongs to all the crosses in the family Cτ. Since τ R\{0,} is fixed, henceforth in this proof we will not emphasize the dependence on τ. We denote by S j the open line segment determined by P j and P j,j {,}. We will break our discussion into three separate cases that take into account the relative positions of the five points P 0,P,P,P,P. We will repeatedly use Fact without explicitly citing it. Case. If {P 0 } = S S, then B τ = { P,P,P,P }. Case. If P 0 S S, then B τ = { P,P,P,P }. Case 3. If P 0 S \S S \S, then Bτ = { P,P,P,P,P 0 }. Notice that the line l containing P and P has slope m = /τ R\{0,} and that the line l containing P and P has slope m. Note also that when τ = / we have m =. In this case P 0 is the midpoint of S and it is outside of S. That is, m = can occur only in Case3. Case. Any point X that lies in S S can be eliminated by a cross that has the boundary lines through P and P of slope m, and boundary lines through points P and P of slope m; see Figure 5. To eliminate a point X outside of the segments S and S, consider the cross having boundary lines that pass through P and P of slope m ǫ, and boundary lines passing through P, P of slope m+ǫ, with ǫ 0,m sufficiently small; see Figure 6. Case. Points X that lie in l \ S l \ S are eliminated by a cross that has boundary lines through P and P of slope m, and boundary lines through points P and P of slope m; this is similar to the method used in Figure 5. Thus, it remains to eliminate the points inside either of the segments S or S. Consider X S. Select a point Q l and between X and P so that the line through Q and P has a slope m 0 R \ {,0}. The cross with boundary lines through P and P of slope m 0, and boundary lines through points P and P of slope m 0 contains X in its nucleus, thus eliminating it; see Figure 7. A similar argument works for X S. Case3. We will show that no other point on l and l, besides P 0,P,P,P,P, belongs to all crosses in C. Let us assume that P 0 S \S. Clearly, the cross that has the boundary lines through P and P parallel to l, and the boundary lines through points P and P parallel to l eliminates any point X in l \ S, as well as the points in the interior of S. Let now X S. Moreover, assume that X is between P and P 0. Select a point Q on l and between X and P 0 such that the slope of the line through Q and P has a slope m 0 in R\{,0}. The cross with boundary lines through P and P of slope m 0, and boundary lines through points P and P of slope m 0 contains

11 0 CEVA S TRIANGLE INEQUALITIES P P P P P 0 X P P P 0 P X P Figure 5 Figure 6 P P 0 P X Q P P 0 P X Q P P P P Figure 7 Figure 8 P X Q P P 0 P P 0 P P P P Q P X Figure 9 Figure 0

12 CEVA S TRIANGLE INEQUALITIES X in its nucleus, thus eliminating it. This way, we eliminate all the points inside the segment S with the exception of P 0 ; see Figure 8. Next let X l \S. First assume that X and P 0 are on the same side of S. If P 0 is between X and S, let Q be a point on l between X and P 0 such that the slope of the line through P and Q is in R\{0,}. Denote this slope by m 0. The cross with boundary lines through P and P of slope m 0, and boundary lines through points P and P of slope m 0 eliminates X; see Figure 9. If X is between P 0 and S a similar argument eliminates it. If X and P 0 are on the opposite sides of S, then pick Q on l between X and S such that the slope m 0 of the line through P and Q is in R\{0,}. The cross with boundary lines through P and P of slope m 0, and boundary lines through points P and P of slope m 0 eliminates X; see Figure 0. Finally, the case P 0 S \S is handled similarly. The only exception is the case when P 0 is the midpoint of S. In this case τ = / and m = and the points in S l \ S are eliminated by crosses that have the boundary lines through P and P with slopes ±ǫ, and the boundary lines through points P and P with slopes ǫ for sufficiently small ǫ > The set A In Section we proved that A B and that the set B is a subset of the union of the sets defined in 3, 4, 5 and 6. In this section, in Subsection 3. we prove that the set in 3 is a subset of A, in Subsection 3.3 we prove that the set in 5 is a subset of A and that the points in 6 are not in A, and in Subsection 3.4 we prove that the set in 4 is a subset of A. All together these inclusions imply that A equals the union of the sets in 3, 4 and From the tetrahedron to the cone. In this subsection, we show that a triple a,b,c T if and only if a,b,c Q, where Q is the interior in the first octant of the cone x +y +z xy +yz +zx = 0. That is, Q = x y : x,y,z > 0, x +y +z < xy +yz +zx. z By definition, a,b,c T if and only if a b < c < a+b. The last two inequalities are equivalent to a +b ab < c < a +b +ab, and these two inequalities are, in turn, equivalent to a +b c < ab.

13 CEVA S TRIANGLE INEQUALITIES Squaring both sides, followed by simple algebraic transformations, yields the following equivalent inequalities: a +b c < 4a b, a 4 +b 4 +c 4 +a b a c b c < 4a b, a 4 +b 4 +c 4 < a 4 +b 4 +c 4 +a b +a c +b c, a 4 +b 4 +c 4 < a +b +c. Now, taking the square root of both sides, we adjust the last inequality to look like an inequality for a dot product of two unit vectors: a +b +c a 4 +b 4 +c 4 > 3 3. This means that the cosine of the angle between the vectors a,b,c and,, is bigger than /3. In other words, a,b,c are lengths of sides of a triangle if and only if the point a,b,c is inside the cone centered around the diagonal x = y = z and with the angle arccos /3. The algebraic equation of this cone is x +y +z xy +yz +zx = 0. Therelevance of the above observation is that now we can characterize A in terms of a cone preserving property of a class of 3 3 matrices. More precisely, this observation, in combination with Subsection., yields the following sequence of equivalences: where ρ,σ,τ A AA ρ,bb σ,cc τ T for all a,b,c T AA ρ,bb σ,cc τ Q for all a,b,c Q Mρ,σ,τQ Q, Mρ,σ,τ = ρρ ρ ρ σ σσ σ τ τ ττ 3.. Rotation. Consider the matrix τ τ τ τ Mτ,τ,τ = τ τ τ τ. τ τ τ τ For simplicity, we write M instead of Mτ,τ,τ. A long but straightforward calculation shows that M T M, that is, τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ τ.

14 evaluates to ττ + I and CEVA S TRIANGLE INEQUALITIES 3 Therefore the matrix detm = ττ + 3. ττ + M isorthogonal anditsdeterminantis. Thus, ττ + M isarotation. Clearly, the eigenvector corresponding to the real eigenvalue is the vector,,. Therefore the transformation of R 3 induced by M leaves the cone Q invariant. Consequently, the set in 3 is a subset of A Degenerate case. Let τ R\{0,} and consider the matrix τ τ τ τ τ τ M = M τ, τ,τ = τ τ τ τ τ τ τ A simple verification yields that the linearly independent vectors τ,0, and τ,τ,0 are eigenvectors corresponding to the eigenvalue 0. Since M has rank, the third eigenvector is τ τ,,ττ τ and it corresponds to the eigenvalue τ 6 3τ 5 +3τ 4 τ 3 +3τ 3τ + τ τ. The matrix M maps Q into Q if and only if the last eigenvector or its opposite is in Q and the corresponding eigenvalue is positive. To explore for which τ this is the case, we introduce the change of variables τ +x/. Then, the eigenvector becomes x+ x, x x+, x 4 and the corresponding eigenvalue is x 6 3x 4 +5x +5 4x. The polynomial in the numerator is even and, since its second derivative 30x 4 36x +0 is strictly positive, it is concave up. Thus, its minimum is 5. Therefore the third eigenvalue is always positive. Next, we use the dot product to calculate the absolute value of the cosine of the angle between x+ x, x x+, x and,,. 4.

15 4 CEVA S TRIANGLE INEQUALITIES After simplifying, the absolute value of the cosine is x x 6 7x 4 +59x +. This simplification is based on the following two identities 4x+ +4x +x = 3+x 4 x x 4 +x 4 = 3+x x 6 7x 4 +59x +. Next, we need to find those values of x for which 8 is greater than /3. This is equivalent to x +3 3 x 6 7x 4 +59x + >, and, after further simplification, to 9 x 6 +3x 4 9x +5 > 0 As 5 is a root of the polynomial y 3 +3y 9y +5, factoring the last displayed polynomial yields x 6 +3x 4 9x +5 = 5 x 8x +x 4 = 5 x x x Since = + 5 and = + 5, the roots of the polynomial in 9 in the increasing order are 5, 5, 5, + 5, 5, + 5. Thus, the solutions of 9 are the open intervals 5, 5, 5, + 5, The corresponding intervals for τ are φ, φ, with the approximate values being φ, φ, 5, + 5. φ, φ,.68, 0.68, 0.38, 0.68,.68,.68. Hence, the matrix M maps Q into Q if and only if τ φ, φ φ, φ φ, φ. This, in particular implies that the set in 5 is a subset of A. Moreover, for τ { φ, φ,φ,φ,φ,φ }, the eigenvector of M lies on the boundary of the cone Q. This boundary corresponds to the squares of the sides of degenerate triangles. Thus, for an arbitrary triangle ABC, for the six triples listed in 6 the corresponding cevians form a degenerate triangle. In other words, the points in 6 are not in A.

16 CEVA S TRIANGLE INEQUALITIES Real eigenvalues. Consider the matrix ξ ξ ξ ξ M = Mξ, ξ, ξ = ξ + ξ +ξ ξ. ξ ξ ξ ξ The eigenvectors of this matrix are, φ, φ φ φ, where φ = + 5. The corresponding eigenvalues are ξ +ξ, φ ξ, φ ξ. This can be verified by direct calculations. In the verification of these claims and in the calculations below, the following identities involving φ are used: φ = φ, φ +φ = 3, φ φ = 5. The matrix M is singular if and only if ξ +ξ = 0. That is, for ξ = φ = φ or ξ = φ = φ. But for ξ = φ the matrix M of this section coincides with the matrix M in Section 3.3 with τ = φ there. For ξ = φ the matrix M of this section coincides with the matrix M in Section 3.3 with τ = φ there. Therefore in the rest of this section we can assume that M is invertible, that is, we assume 0 ξ φ and ξ φ. The matrix B = φ φ φ φ diagonalizes M since ξ +ξ 0 0 B MB = D = 0 φ ξ φ ξ. Notice that only the top left diagonal entry in D might be non-positive. Also, the square of the top left diagonal entry in D is the product of the remaining two diagonal entries: φ ξ φ ξ = ξ +ξ. Next, we define another cone, Q 0 = u v : v,w > 0, u < 4vw, w and prove that DQ 0 = Q 0 and BQ 0 = Q.

17 6 CEVA S TRIANGLE INEQUALITIES First notice that the definition of Q 0, and 0 yield the following equivalences: u v Q 0 v,w > 0 and u < 4vw w φ ξ v > 0, φ ξ w > 0 and ξ +ξ u <4 φ ξ v φ ξ w ξ +ξ u φ ξ v φ ξ Q 0 w D u v Q 0, w which, in turn, prove DQ 0 = Q 0. Second, we verify that the matrix B maps Q 0 onto Q. Set x y = B u u+v +w v = u+φ v +φ w, z w u+φ v +φ w and calculate x +y +z xy +yz +zx = x xy zx + y +z yz = x x y +z + y z = u+v +w 5u+ φ +φ v +w + φ φ v w = 5 u+v +w u+v +w +5v w = 5 u v +w +v w = 5 u 4vw. Sincex +y +z xy+yz+zx < 0 represents the interior or the disconnected part of the circular cone with the axis x = y = z and with a generatrix x = y,z = 0, all three coordinates x, y, z satisfying the last inequality must have the same sign. Clearly, if u < 4vw, then v,w are nonzero and have the same sign. Assume x +y +z xy +yz +zx = 5 u 4vw < 0.

18 Then, if both v,w < 0, we have CEVA S TRIANGLE INEQUALITIES 7 x = u+v +w < v w v w = v w 0. The contrapositive of this implication is that, if x > 0, then at least one, and hence both, v,w > 0. Conversely, if v,w > 0, then x = u+v +w > v w+v +w = v w 0. That is: v,w > 0 implies x > 0. Hence, the following equivalences hold: x y Q x > 0 and x +y +z xy +yz +zx < 0 z v,w > 0 and u < 4vw u v Q 0. w This proves that BQ 0 = Q. Since B MB = D and DQ 0 = Q 0, we have MQ = MBQ 0 = BDQ 0 = BQ 0 = Q. This proves that M P ξ,ξ R \ { φ,φ}, leaves the cone Q invariant. Thus, the second points listed in 4 belong to A. The other families of points in 4 are treated similarly, proving that the set in 4 is a subset of A. This completes our proof of the Theorem. 4. Closing comments WewishtoendwitharemarkconcerninganarbitraryfixedtriangleABC withthe sidesa,b,c. For suchatriangle, denotebyaa,b,c theset ofall triplesρ,σ,τ R 3 for which the cevians AA ρ, BB σ, and CC τ form a triangle. Clearly, A Aa,b,c. In fact, A = a,b,c T Aa,b,c. The set Aa,b,c is a subset of R3 bounded by the surface which is the union of the solutions to AA ρ + BB σ = CC τ or BB σ + CC τ = AA ρ or CC τ + AA ρ = BB σ. The general equation of this surface is quite cumbersome. To get an idea how this surface looks like, we plot it in Figure for an equilateral triangle. Figure also illustrates the last sentence in Subsection 3.3: For an arbitrary triangle ABC, the six special points listed in 6 belong to the surface bounding Aa, b, c. Acknowledgement The authors thank an anonymous referee for the careful reading of the paper and very useful suggestions which significantly improved the presentation.

19 8 CEVA S TRIANGLE INEQUALITIES 3 τ 0 0 σ Figure. The set A and the surface bounding A,, 3 References [] O. Bottema, R.Ž. Djordjević, R.R. Janić, D.S. Mitrinović, P.M. Vasić, Geometric inequalities. Wolters-Noordhoff Publishing, Groningen, 969. [] J.L. Brown Jr., Solution to E 366, Amer. Math. Monthly , [3] M. Hajja, On nested sequences of triangles, Results in Mathematics , [4] M. Hajja, The sequence of generalized median triangles and a new shape function, Journal of Geometry , [5] M.S. Klamkin, Second solution to Aufgabe 677, Elem. Math , [6] D. W. Mitchell, A Heron-type formula for the reciprocal area of a triangle, Mathematical Gazette 89 November 005, 494. [7] D.S. Mitrinović, J.E. Pečarić, V. Volenec, Recent advances in geometric inequalities. Mathematics and its Applications East European Series, 8. Kluwer Academic Publishers Group, Dordrecht, 989. [8] V. Protasov, When do several linear operators share an invariant cone? Linear Algebra Appl , [9] L. Rodman, H. Seyalioglu, I. Spitkovsky, On common invariant cones for families of matrices. Linear Algebra Appl , ρ

Ceva s triangle inequalities

Ceva s triangle inequalities arxiv:206.636v [math.mg] 7 Jun 202 Ceva s triangle inequalities Árpád Bényi Department of Mathematics, Western Washington University, 56 High Street, Bellingham, Washington 98225, USA E-mail: Arpad.Benyi@wwu.edu

More information

arxiv: v1 [math.ho] 10 May 2013

arxiv: v1 [math.ho] 10 May 2013 OUTER MEDIN TRINGLES ÁRPÁD ÉNYI ND RNKO ĆURGUS arxiv:305.353v [math.ho] 0 May 203 bstract. We define the notions of outer medians and outer median triangles. We show that outer median triangles enjoy similar

More information

Extra Problems for Math 2050 Linear Algebra I

Extra Problems for Math 2050 Linear Algebra I Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as

More information

Applied Linear Algebra in Geoscience Using MATLAB

Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

Maths for Signals and Systems Linear Algebra in Engineering

Maths for Signals and Systems Linear Algebra in Engineering Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 15, Tuesday 8 th and Friday 11 th November 016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE

More information

NOTE ON HADWIGER FINSLER S INEQUALITIES. 1. Introduction

NOTE ON HADWIGER FINSLER S INEQUALITIES. 1. Introduction Journal of Mathematical Inequalities Volume 6, Number 1 (01), 57 64 NOTE ON HADWIGER FINSLER S INEQUALITIES D.Ş. MARINESCU, M.MONEA, M.OPINCARIU AND M. STROE (Communicated by S. Segura Gomis) Abstract.

More information

October 25, 2013 INNER PRODUCT SPACES

October 25, 2013 INNER PRODUCT SPACES October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal

More information

AN EQUIVALENT FORM OF THE FUNDAMENTAL TRIANGLE INEQUALITY AND ITS APPLICATIONS

AN EQUIVALENT FORM OF THE FUNDAMENTAL TRIANGLE INEQUALITY AND ITS APPLICATIONS AN EQUIVALENT FORM OF THE FUNDAMENTAL TRIANGLE INEQUALITY AND ITS APPLICATIONS SHAN-HE WU MIHÁLY BENCZE Dept. of Mathematics and Computer Science Str. Harmanului 6 Longyan University 505600 Sacele-Négyfalu

More information

Contents. 1 Vectors, Lines and Planes 1. 2 Gaussian Elimination Matrices Vector Spaces and Subspaces 124

Contents. 1 Vectors, Lines and Planes 1. 2 Gaussian Elimination Matrices Vector Spaces and Subspaces 124 Matrices Math 220 Copyright 2016 Pinaki Das This document is freely redistributable under the terms of the GNU Free Documentation License For more information, visit http://wwwgnuorg/copyleft/fdlhtml Contents

More information

Homework 2. Solutions T =

Homework 2. Solutions T = Homework. s Let {e x, e y, e z } be an orthonormal basis in E. Consider the following ordered triples: a) {e x, e x + e y, 5e z }, b) {e y, e x, 5e z }, c) {e y, e x, e z }, d) {e y, e x, 5e z }, e) {

More information

11.1 Three-Dimensional Coordinate System

11.1 Three-Dimensional Coordinate System 11.1 Three-Dimensional Coordinate System In three dimensions, a point has three coordinates: (x,y,z). The normal orientation of the x, y, and z-axes is shown below. The three axes divide the region into

More information

Exercises for Unit I (Topics from linear algebra)

Exercises for Unit I (Topics from linear algebra) Exercises for Unit I (Topics from linear algebra) I.0 : Background Note. There is no corresponding section in the course notes, but as noted at the beginning of Unit I these are a few exercises which involve

More information

Math 302 Outcome Statements Winter 2013

Math 302 Outcome Statements Winter 2013 Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a

More information

Exercises for Unit I (Topics from linear algebra)

Exercises for Unit I (Topics from linear algebra) Exercises for Unit I (Topics from linear algebra) I.0 : Background This does not correspond to a section in the course notes, but as noted at the beginning of Unit I it contains some exercises which involve

More information

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 240 Spring, Chapter 1: Linear Equations and Matrices MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear

More information

Chapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem

Chapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem Chapter 4 Inverse Function Theorem d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d dd d d d d This chapter

More information

Linear Algebra March 16, 2019

Linear Algebra March 16, 2019 Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented

More information

8. Find r a! r b. a) r a = [3, 2, 7], r b = [ 1, 4, 5] b) r a = [ 5, 6, 7], r b = [2, 7, 4]

8. Find r a! r b. a) r a = [3, 2, 7], r b = [ 1, 4, 5] b) r a = [ 5, 6, 7], r b = [2, 7, 4] Chapter 8 Prerequisite Skills BLM 8-1.. Linear Relations 1. Make a table of values and graph each linear function a) y = 2x b) y = x + 5 c) 2x + 6y = 12 d) x + 7y = 21 2. Find the x- and y-intercepts of

More information

8. Diagonalization.

8. Diagonalization. 8. Diagonalization 8.1. Matrix Representations of Linear Transformations Matrix of A Linear Operator with Respect to A Basis We know that every linear transformation T: R n R m has an associated standard

More information

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system

More information

7. Dimension and Structure.

7. Dimension and Structure. 7. Dimension and Structure 7.1. Basis and Dimension Bases for Subspaces Example 2 The standard unit vectors e 1, e 2,, e n are linearly independent, for if we write (2) in component form, then we obtain

More information

Linear Algebra I. Ronald van Luijk, 2015

Linear Algebra I. Ronald van Luijk, 2015 Linear Algebra I Ronald van Luijk, 2015 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents Dependencies among sections 3 Chapter 1. Euclidean space: lines and hyperplanes 5 1.1. Definition

More information

Math 105A HW 1 Solutions

Math 105A HW 1 Solutions Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S

More information

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix

More information

ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST

ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST me me ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST 1. (1 pt) local/library/ui/eigentf.pg A is n n an matrices.. There are an infinite number

More information

y 2 . = x 1y 1 + x 2 y x + + x n y n 2 7 = 1(2) + 3(7) 5(4) = 3. x x = x x x2 n.

y 2 . = x 1y 1 + x 2 y x + + x n y n 2 7 = 1(2) + 3(7) 5(4) = 3. x x = x x x2 n. 6.. Length, Angle, and Orthogonality In this section, we discuss the defintion of length and angle for vectors and define what it means for two vectors to be orthogonal. Then, we see that linear systems

More information

1.1 Line Reflections and Point Reflections

1.1 Line Reflections and Point Reflections 1.1 Line Reflections and Point Reflections Since this is a book on Transformation Geometry, we shall start by defining transformations of the Euclidean plane and giving basic examples. Definition 1. A

More information

Groups of Prime Power Order with Derived Subgroup of Prime Order

Groups of Prime Power Order with Derived Subgroup of Prime Order Journal of Algebra 219, 625 657 (1999) Article ID jabr.1998.7909, available online at http://www.idealibrary.com on Groups of Prime Power Order with Derived Subgroup of Prime Order Simon R. Blackburn*

More information

Math Precalculus I University of Hawai i at Mānoa Spring

Math Precalculus I University of Hawai i at Mānoa Spring Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2014 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents

More information

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors

Chapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there

More information

Final Exam. Linear Algebra Summer 2011 Math S2010X (3) Corrin Clarkson. August 10th, Solutions

Final Exam. Linear Algebra Summer 2011 Math S2010X (3) Corrin Clarkson. August 10th, Solutions Final Exam Linear Algebra Summer Math SX (3) Corrin Clarkson August th, Name: Solutions Instructions: This is a closed book exam. You may not use the textbook, notes or a calculator. You will have 9 minutes

More information

INTRODUCTION TO ALGEBRAIC TOPOLOGY. (1) Let k < j 1 and 0 j n, where 1 n. We want to show that e j n e k n 1 = e k n e j 1

INTRODUCTION TO ALGEBRAIC TOPOLOGY. (1) Let k < j 1 and 0 j n, where 1 n. We want to show that e j n e k n 1 = e k n e j 1 INTRODUCTION TO ALGEBRAIC TOPOLOGY Exercise 7, solutions 1) Let k < j 1 0 j n, where 1 n. We want to show that e j n e k n 1 = e k n e j 1 n 1. Recall that the map e j n : n 1 n is defined by e j nt 0,...,

More information

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij

More information

Chapter 3. Vector spaces

Chapter 3. Vector spaces Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say

More information

Linear Algebra. Min Yan

Linear Algebra. Min Yan Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

More information

3. Which of these numbers does not belong to the set of solutions of the inequality 4

3. Which of these numbers does not belong to the set of solutions of the inequality 4 Math Field Day Exam 08 Page. The number is equal to b) c) d) e). Consider the equation 0. The slope of this line is / b) / c) / d) / e) None listed.. Which of these numbers does not belong to the set of

More information

Linear algebra. S. Richard

Linear algebra. S. Richard Linear algebra S. Richard Fall Semester 2014 and Spring Semester 2015 2 Contents Introduction 5 0.1 Motivation.................................. 5 1 Geometric setting 7 1.1 The Euclidean space R n..........................

More information

Definition (T -invariant subspace) Example. Example

Definition (T -invariant subspace) Example. Example Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin

More information

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N. Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class

More information

Math Linear Algebra Final Exam Review Sheet

Math Linear Algebra Final Exam Review Sheet Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of

More information

Exercises for Unit I I (Vector algebra and Euclidean geometry)

Exercises for Unit I I (Vector algebra and Euclidean geometry) Exercises for Unit I I (Vector algebra and Euclidean geometry) I I.1 : Approaches to Euclidean geometry Ryan : pp. 5 15 1. What is the minimum number of planes containing three concurrent noncoplanar lines

More information

Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems

Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems To locate a point in a plane, two numbers are necessary. We know that any point in the plane can be represented as an ordered pair (a, b) of real numbers, where a is the x-coordinate and b is the y-coordinate.

More information

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v ) Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O

More information

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether

More information

A METHOD FOR ESTABLISHING CERTAIN TRIGONOMETRIC INEQUALITIES

A METHOD FOR ESTABLISHING CERTAIN TRIGONOMETRIC INEQUALITIES Volume 8 (007), Issue 1, Article 9, 11 pp. A METHOD FOR ESTABLISHING CERTAIN TRIGONOMETRIC INEQUALITIES MOWAFFAQ HAJJA DEPARTMENT OF MATHEMATICS YARMOUK UNIVERSITY IRBID, JORDAN. mowhajja@yahoo.com Received

More information

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces. Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,

More information

SUMMARY OF MATH 1600

SUMMARY OF MATH 1600 SUMMARY OF MATH 1600 Note: The following list is intended as a study guide for the final exam. It is a continuation of the study guide for the midterm. It does not claim to be a comprehensive list. You

More information

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

11. Periodicity of Klein polyhedra (28 June 2011) Algebraic irrationalities and periodicity of sails. Let A GL(n + 1, R) be an operator all of

11. Periodicity of Klein polyhedra (28 June 2011) Algebraic irrationalities and periodicity of sails. Let A GL(n + 1, R) be an operator all of 11. Periodicity of Klein polyhedra (28 June 2011) 11.1. lgebraic irrationalities and periodicity of sails. Let GL(n + 1, R) be an operator all of whose eigenvalues are real and distinct. Let us take the

More information

2. Every linear system with the same number of equations as unknowns has a unique solution.

2. Every linear system with the same number of equations as unknowns has a unique solution. 1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations

More information

SOMEWHAT STOCHASTIC MATRICES

SOMEWHAT STOCHASTIC MATRICES SOMEWHAT STOCHASTIC MATRICES BRANKO ĆURGUS AND ROBERT I. JEWETT Abstract. The standard theorem for stochastic matrices with positive entries is generalized to matrices with no sign restriction on the entries.

More information

Linear vector spaces and subspaces.

Linear vector spaces and subspaces. Math 2051 W2008 Margo Kondratieva Week 1 Linear vector spaces and subspaces. Section 1.1 The notion of a linear vector space. For the purpose of these notes we regard (m 1)-matrices as m-dimensional vectors,

More information

Chapter 6: Orthogonality

Chapter 6: Orthogonality Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products

More information

Vectors, dot product, and cross product

Vectors, dot product, and cross product MTH 201 Multivariable calculus and differential equations Practice problems Vectors, dot product, and cross product 1. Find the component form and length of vector P Q with the following initial point

More information

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

More information

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88 Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant

More information

N-WEAKLY SUPERCYCLIC MATRICES

N-WEAKLY SUPERCYCLIC MATRICES N-WEAKLY SUPERCYCLIC MATRICES NATHAN S. FELDMAN Abstract. We define an operator to n-weakly hypercyclic if it has an orbit that has a dense projection onto every n-dimensional subspace. Similarly, an operator

More information

Chapter 13: Vectors and the Geometry of Space

Chapter 13: Vectors and the Geometry of Space Chapter 13: Vectors and the Geometry of Space 13.1 3-Dimensional Coordinate System 13.2 Vectors 13.3 The Dot Product 13.4 The Cross Product 13.5 Equations of Lines and Planes 13.6 Cylinders and Quadratic

More information

Chapter 13: Vectors and the Geometry of Space

Chapter 13: Vectors and the Geometry of Space Chapter 13: Vectors and the Geometry of Space 13.1 3-Dimensional Coordinate System 13.2 Vectors 13.3 The Dot Product 13.4 The Cross Product 13.5 Equations of Lines and Planes 13.6 Cylinders and Quadratic

More information

Math Precalculus I University of Hawai i at Mānoa Spring

Math Precalculus I University of Hawai i at Mānoa Spring Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents

More information

November 18, 2013 ANALYTIC FUNCTIONAL CALCULUS

November 18, 2013 ANALYTIC FUNCTIONAL CALCULUS November 8, 203 ANALYTIC FUNCTIONAL CALCULUS RODICA D. COSTIN Contents. The spectral projection theorem. Functional calculus 2.. The spectral projection theorem for self-adjoint matrices 2.2. The spectral

More information

Math 3c Solutions: Exam 1 Fall Graph by eliiminating the parameter; be sure to write the equation you get when you eliminate the parameter.

Math 3c Solutions: Exam 1 Fall Graph by eliiminating the parameter; be sure to write the equation you get when you eliminate the parameter. Math c Solutions: Exam 1 Fall 16 1. Graph by eliiminating the parameter; be sure to write the equation you get when you eliminate the parameter. x tan t x tan t y sec t y sec t t π 4 To eliminate the parameter,

More information

c Igor Zelenko, Fall

c Igor Zelenko, Fall c Igor Zelenko, Fall 2017 1 18: Repeated Eigenvalues: algebraic and geometric multiplicities of eigenvalues, generalized eigenvectors, and solution for systems of differential equation with repeated eigenvalues

More information

Study guide for Exam 1. by William H. Meeks III October 26, 2012

Study guide for Exam 1. by William H. Meeks III October 26, 2012 Study guide for Exam 1. by William H. Meeks III October 2, 2012 1 Basics. First we cover the basic definitions and then we go over related problems. Note that the material for the actual midterm may include

More information

MATH 255 Applied Honors Calculus III Winter Midterm 1 Review Solutions

MATH 255 Applied Honors Calculus III Winter Midterm 1 Review Solutions MATH 55 Applied Honors Calculus III Winter 11 Midterm 1 Review Solutions 11.1: #19 Particle starts at point ( 1,, traces out a semicircle in the counterclockwise direction, ending at the point (1,. 11.1:

More information

Midterm 1 Review. Distance = (x 1 x 0 ) 2 + (y 1 y 0 ) 2.

Midterm 1 Review. Distance = (x 1 x 0 ) 2 + (y 1 y 0 ) 2. Midterm 1 Review Comments about the midterm The midterm will consist of five questions and will test on material from the first seven lectures the material given below. No calculus either single variable

More information

Problem Set # 1 Solution, 18.06

Problem Set # 1 Solution, 18.06 Problem Set # 1 Solution, 1.06 For grading: Each problem worths 10 points, and there is points of extra credit in problem. The total maximum is 100. 1. (10pts) In Lecture 1, Prof. Strang drew the cone

More information

Lecture 11: Eigenvalues and Eigenvectors

Lecture 11: Eigenvalues and Eigenvectors Lecture : Eigenvalues and Eigenvectors De nition.. Let A be a square matrix (or linear transformation). A number λ is called an eigenvalue of A if there exists a non-zero vector u such that A u λ u. ()

More information

we have the following equation:

we have the following equation: 1 VMTS Homework #1 due Thursday, July 6 Exercise 1 In triangle ABC, let P be 2 3 of the way from A to B, let Q be 1 3 of the way from P to C, and let the line BQ intersect AC in R How far is R along the

More information

1. The positive zero of y = x 2 + 2x 3/5 is, to the nearest tenth, equal to

1. The positive zero of y = x 2 + 2x 3/5 is, to the nearest tenth, equal to SAT II - Math Level Test #0 Solution SAT II - Math Level Test No. 1. The positive zero of y = x + x 3/5 is, to the nearest tenth, equal to (A) 0.8 (B) 0.7 + 1.1i (C) 0.7 (D) 0.3 (E). 3 b b 4ac Using Quadratic

More information

2. Review of Linear Algebra

2. Review of Linear Algebra 2. Review of Linear Algebra ECE 83, Spring 217 In this course we will represent signals as vectors and operators (e.g., filters, transforms, etc) as matrices. This lecture reviews basic concepts from linear

More information

Lecture 1: Systems of linear equations and their solutions

Lecture 1: Systems of linear equations and their solutions Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications

More information

PRIMES Math Problem Set

PRIMES Math Problem Set PRIMES Math Problem Set PRIMES 017 Due December 1, 01 Dear PRIMES applicant: This is the PRIMES 017 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 01.

More information

Lebesgue Measure on R n

Lebesgue Measure on R n CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

More information

MT182 Matrix Algebra: Sheet 1

MT182 Matrix Algebra: Sheet 1 MT82 Matrix Algebra: Sheet Attempt at least questions to 5. Please staple your answers together and put your name and student number on the top sheet. Do not return the problem sheet. The lecturer will

More information

A = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,

A = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is, 65 Diagonalizable Matrices It is useful to introduce few more concepts, that are common in the literature Definition 65 The characteristic polynomial of an n n matrix A is the function p(λ) det(a λi) Example

More information

Jim Lambers MAT 610 Summer Session Lecture 1 Notes

Jim Lambers MAT 610 Summer Session Lecture 1 Notes Jim Lambers MAT 60 Summer Session 2009-0 Lecture Notes Introduction This course is about numerical linear algebra, which is the study of the approximate solution of fundamental problems from linear algebra

More information

Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved

Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural

More information

1 Geometry of R Conic Sections Parametric Equations More Parametric Equations Polar Coordinates...

1 Geometry of R Conic Sections Parametric Equations More Parametric Equations Polar Coordinates... Contents 1 Geometry of R 1.1 Conic Sections............................................ 1. Parametric Equations........................................ 3 1.3 More Parametric Equations.....................................

More information

1 9/5 Matrices, vectors, and their applications

1 9/5 Matrices, vectors, and their applications 1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric

More information

Lecture 7: Positive Semidefinite Matrices

Lecture 7: Positive Semidefinite Matrices Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.

More information

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8. Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:

More information

1 Matrices and vector spaces

1 Matrices and vector spaces Matrices and vector spaces. Which of the following statements about linear vector spaces are true? Where a statement is false, give a counter-example to demonstrate this. (a) Non-singular N N matrices

More information

Solving Homogeneous Systems with Sub-matrices

Solving Homogeneous Systems with Sub-matrices Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State

More information

Fundamentals of Engineering Analysis (650163)

Fundamentals of Engineering Analysis (650163) Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is

More information

Exam Study Questions for PS10-11 (*=solutions given in the back of the textbook)

Exam Study Questions for PS10-11 (*=solutions given in the back of the textbook) Exam Study Questions for PS0- (*=solutions given in the back of the textbook) p 59, Problem p 59 Problem 3 (a)*, 3(b) 3(c) p 55, Problem p547, verify the solutions Eq (8) to the Marcov Processes being

More information

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column

More information

Linear Algebra Homework and Study Guide

Linear Algebra Homework and Study Guide Linear Algebra Homework and Study Guide Phil R. Smith, Ph.D. February 28, 20 Homework Problem Sets Organized by Learning Outcomes Test I: Systems of Linear Equations; Matrices Lesson. Give examples of

More information

BROWN UNIVERSITY MATH 0350 MIDTERM 19 OCTOBER 2017 INSTRUCTOR: SAMUEL S. WATSON. a b. Name: Problem 1

BROWN UNIVERSITY MATH 0350 MIDTERM 19 OCTOBER 2017 INSTRUCTOR: SAMUEL S. WATSON. a b. Name: Problem 1 BROWN UNIVERSITY MATH 0350 MIDTERM 19 OCTOBER 2017 INSTRUCTOR: SAMUEL S. WATSON Name: Problem 1 In this problem, we will use vectors to show that an angle formed by connecting a point on a circle to two

More information

The geometry of secants in embedded polar spaces

The geometry of secants in embedded polar spaces The geometry of secants in embedded polar spaces Hans Cuypers Department of Mathematics Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands June 1, 2006 Abstract Consider

More information

Chapter 8. Rigid transformations

Chapter 8. Rigid transformations Chapter 8. Rigid transformations We are about to start drawing figures in 3D. There are no built-in routines for this purpose in PostScript, and we shall have to start more or less from scratch in extending

More information

Some notes on Coxeter groups

Some notes on Coxeter groups Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three

More information

1 Matrices and Systems of Linear Equations. a 1n a 2n

1 Matrices and Systems of Linear Equations. a 1n a 2n March 31, 2013 16-1 16. Systems of Linear Equations 1 Matrices and Systems of Linear Equations An m n matrix is an array A = (a ij ) of the form a 11 a 21 a m1 a 1n a 2n... a mn where each a ij is a real

More information

Solutions: The Geometry of Spacetime

Solutions: The Geometry of Spacetime Solutions: The Geometry of Spacetime James Callahan iii Preface This book consists of detailed solutions to the exercises in my text The Geometry of Spacetime (Springer, New York, 2000). My Web site,

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information

Z-Pencils. November 20, Abstract

Z-Pencils. November 20, Abstract Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is

More information

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition

Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing

More information

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman

Kernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu

More information

Math 118, Fall 2014 Final Exam

Math 118, Fall 2014 Final Exam Math 8, Fall 4 Final Exam True or false Please circle your choice; no explanation is necessary True There is a linear transformation T such that T e ) = e and T e ) = e Solution Since T is linear, if T

More information

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop Eric Sommers 17 July 2009 2 Contents 1 Background 5 1.1 Linear algebra......................................... 5 1.1.1

More information