mth536_problem_7_1a

7 proof that let 2 5 3 4 7 7 7 2 7 2 7 2

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ¤£ Now suppose . Since is a sum of nonnegative terms, it can only be zero if each term is zero, in which case for all and by definition . ¡ ¢ ¦ § ¤ © § ¨ ¦& By a similar argument, is the maximum of a set of nonnegative terms and can only be zero if each term is zero, which again implies that . ¡ ¤ © § © &  7© § ¤7 $ – p. 5/ Proof that 4 and  satisfy condition 3 3 By the properties of absolute value, ¤7    ¤7 £ ¨ © 7 §  $ 1 9 1  ¤7  ¦ § § 7 © 7  so interchanging 3 and leaves both and unchanged. ¤ § ¡ ¢ ¡ – p. 6/ Proof that Let ¤ ¦ ¦§ 2 5 3 4 ¡ ¦ § 7 © @  ¢ ¤ ¥£ ¨  6 . Then  ¤7  7 §  7 © @   ¤7  7 2 7 2 7 §  satisfies condition 4 – p. 7/ Proof that Let ¤...
View Full Document

Ask a homework question - tutors are online