Skip to main content

Question 1.12

Solutions

TZ
leumasicOfficial

7 months ago

(i) Proof by cases/exhaustion:
x,y0\bm{x, y \geq 0}

[x0y0    x=xy=y]    xy=xy=xy\begin{aligned} [ x \geq 0 \wedge y \geq 0 \implies x = |x| \wedge y = |y| ] \implies |xy| = xy = |x| \cdot |y| \end{aligned}

x,y0\bm{x, y \leq 0}

[x0y0    x=xy=y]    xy=xy=xy=xy\begin{aligned} [ x \leq 0 \wedge y \leq 0 \implies -x = |x| \wedge -y = |y| ] \implies |xy| = xy = -x \cdot -y = |x| \cdot |y| \end{aligned}

x0,y0\bm{x \geq 0, y \leq 0}

[x0y0    x=xy=y]    xy=xy=xy\begin{aligned} [ x \geq 0 \wedge y \leq 0 \implies x = |x| \wedge -y = |y| ] \implies |xy| = x \cdot -y = |x| \cdot |y| \end{aligned}

We can ignore the case x0,y0x \leq 0, y \geq 0 as it would be treated
by the third one, if the starting inequalities' variables were
interchanged.

(ii)

1x=1x1=1x1(i)=1x1=1x\begin{aligned} |\frac{1}{x}| & = |1 \cdot x^{-1}| \\ & = |1| \cdot |x^{-1}| && (i) \\ & = 1 \cdot |x^{-1}| \\ & = \frac{1}{|x|} \end{aligned}

(iii)

xy=xy1=xy1(ii)=xy(i)\begin{aligned} \frac{|x|}{|y|} & = |x| |y|^{-1} \\ & = |x| |y^{-1}| && (ii) \\ & = |\frac{x}{y}| && (i) \end{aligned}

(iv)

x+zx+z    x+zx+zz=y    x+(y)x+y    xyx+y\begin{aligned} |x + z| \leq |x| + |z| & \implies |x + z| \leq |x| + |-z| && z = -y \\ & \implies |x + (-y)| \leq |x| + |y| \\ & \implies |x - y| \leq |x| + |y| \end{aligned}

(v)

x=(xy)+yxy+yTriangle inequality    xyxy\begin{aligned} |x| = |(x - y) + y| & \leq |x - y| + |y| && \text{Triangle inequality} \\ \implies |x| - |y| & \leq |x - y| \end{aligned}

(vi)

xyxy    yxyxInterchanging x,y    yx(xy)    yxxy    xy leqxy    xyxyxy(v)    xyxy\begin{aligned} |x| - |y| \leq |x - y| & \implies |y| - |x| \leq |y - x| && \text{Interchanging } x, y \\ & \implies |y| - |x| \leq |-(x - y)| \\ & \implies |y| - |x| \leq |x - y| \\ & \implies -|x - y| \ leq |x| - |y| \\ & \implies -|x - y| \leq |x| - |y| \leq |x - y| && (v) \\ & \implies ||x| - |y|| \leq |x - y| \end{aligned}

(vii)

x+yx+y    x+y+zx+y+zTriangle inequality    (x+y)+zx+y+zx+y+z\begin{aligned} |x + y| \leq |x| + |y| \implies |x + y| + |z| & \leq |x| + |y| + |z| && \text{Triangle inequality} \\ \implies |(x + y) + z| \leq |x + y| + |z| & \leq |x| + |y| + |z| \end{aligned}
0
Submit a solution
Optional • Markdown

Sign in to share your solution for this question.

Sign in

Navigate

Q 1.12

Navigate

Q 1.12