A Why Is the Discriminant Non-Positive in the Triangle Inequality Proof?

LagrangeEuler
Messages
711
Reaction score
22
In the derivation of triangle inequality |(x,y)| \leq ||x|| ||y|| one use some ##z=x-ty## where ##t## is real number. And then from ##(z,z) \geq 0## one gets quadratic inequality
||x||^2+||y||^2t^2-2tRe(x,y) \geq 0
And from here they said that discriminant of quadratic equation
D=4(Re(x,y))^2-4 ||y||^2|x||^2 \leq 0
Could you explain me why ##<## sign in discriminant relation? When discriminant is less then zero solutions are complex conjugate numbers. But I still do not understand the discussed inequality. What about for example in case
||x||^2+||y||^2t^2-2tRe(x,y) \leq 0?
 
Physics news on Phys.org
The quadratic equation
$$
||x||^2+||y||^2t^2-2tRe(x,y) \geq 0
$$
must always be zero or positive for all real ##t##. This means the function ##f(t)=||x||^2+||y||^2t^2-2tRe(x,y)## must always be above the ##t## axis, which further implies that it can have at most one solution (which occurs when the minimum of this function touches the ##t## axis): one solution or no solution at all. In terms of the discrimant, the discrimant of ##f(t)## is either zero or negative.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top