Non-negativity of the inner product

In summary, the inner product axioms listed are:(a) <x+z, y> = <x,y> + <z,y>(b) <cx,y> = c<x,y>(c) <x,y> = <y,x>*(d) <x,x> > 0 if x ≠ 0These axioms imply that <x,y> ≥ 0 for all x and y. This is because the inner product is a real-valued operation, regardless of whether the underlying field is real or complex. In the case of the reals, <x,y> represents the dot product of two vectors, which can never be negative. In the case of the complex numbers, <x,y> can be
  • #1
Mr Davis 97
1,462
44
The inner product axioms are the following:
##\text{(a)} \ \langle x+z,y \rangle = \langle x,y \rangle + \langle z,y \rangle##
##\text{(b)} \ \langle cx,y \rangle = c\langle x,y \rangle##
##\text{(c)} \ \overline{\langle x,y \rangle} = \langle y,x \rangle##
##\text{(d)} \ \langle x,x \rangle > 0 \ \text{if} \ x \ne 0##

What about these axioms imply that ##\langle x,y \rangle \ge 0## for all ##x## and ##y##?
 
Physics news on Phys.org
  • #2
Mr Davis 97 said:
The inner product axioms are the following:
##\text{(a)} \ \langle x+z,y \rangle = \langle x,y \rangle + \langle z,y \rangle##
##\text{(b)} \ \langle cx,y \rangle = c\langle x,y \rangle##
##\text{(c)} \ \overline{\langle x,y \rangle} = \langle y,x \rangle##
##\text{(d)} \ \langle x,x \rangle > 0 \ \text{if} \ x \ne 0##

What about these axioms imply that ##\langle x,y \rangle \ge 0## for all ##x## and ##y##?
What does ##\overline{\langle x,y \rangle}## mean?
 
  • #3
fresh_42 said:
What does ##\overline{\langle x,y \rangle}## mean?
Complex conjugation, in the case that the underlying field is complex
 
  • #4
Mr Davis 97 said:
Complex conjugation, in the case that the underlying field is complex
In that case: what does ##\langle x,y \rangle \geq 0## mean?
 
  • #5
fresh_42 said:
In that case: what does ##\langle x,y \rangle \geq 0## mean?
Well I'm not sure. I though the inner product could never be negative
 
  • #6
Mr Davis 97 said:
Well I'm not sure. I though the inner product could never be negative
As you see, you have to decide, what your underlying field is. Complex numbers cannot be (Archimedean) ordered, so ##\langle x,y \rangle \geq 0## usually makes no sense here (unless you define an order that doesn't have much to do with the corresponding arithmetic). It can make sense for ##\langle x,x \rangle## as, e.g. the ordinary dot product ##\langle x,x \rangle = x^\tau \cdot \bar{x} \in \mathbb{R}##.

So for the real case, do you have any ideas?
 
  • #7
fresh_42 said:
As you see, you have to decide, what your underlying field is. Complex numbers cannot be (Archimedean) ordered, so ##\langle x,y \rangle \geq 0## usually makes no sense here (unless you define an order that doesn't have much to do with the corresponding arithmetic). It can make sense for ##\langle x,x \rangle## as, e.g. the ordinary dot product ##\langle x,x \rangle = x^\tau \cdot \bar{x} \in \mathbb{R}##.

So for the real case, do you have any ideas?
Well I just realize that the inner product can be negative... Well then I guess that leads me to another question. I know that the norm of a vector ##\sqrt{\langle x, x\rangle}## can intuitevly be thought of as length of a vector. However, what is the geometric intuition behind the inner product of any two distinct vectors, especially that in the case of the reals the inner product can be negative?
 
  • #8
Mr Davis 97 said:
I know that the norm of a vector ##\sqrt{\langle x, x\rangle}## can intuitevly be thought of as length of a vector. However, what is the geometric intuition behind the inner product of any two distinct vectors, ...
In the usual sense, i.e. the one you mentioned ##\langle x, x\rangle = \sum_i x_i^2##, this is the ordinary Euclidean metric. It is simply the theorem of Pythagoras. If you change the coordinates in a way, that leaves you with the two you actually need, as ##x,y## always lie in a plane, you get the school version of it.
... especially that in the case of the reals the inner product can be negative?
One can always write ##\langle x, y\rangle = (x,y) B (x,y)^\tau ## with a matrix ##B##. In the case of the Euclidean metric we have ##B=I##. And as we're on a physics website: the Minkowski metric is given by ##B = \operatorname{diag}(1,-1,-1,-1)##, resp. ##B = \operatorname{diag}(-1,1,1,1)## depending on whether a mathematician or a physicist wrote the book.

Normally one wants do define a distance, i.e. a metric by a inner product, so it makes sense to require that there will be no negative distances. But in principle every matrix ##B## is allowed, although one might not call the result a inner product, rather a bilinear form B instead (see the other thread).
 
  • #9
Mr Davis 97 said:
The inner product axioms are the following:
##\text{(a)} \ \langle x+z,y \rangle = \langle x,y \rangle + \langle z,y \rangle##
##\text{(b)} \ \langle cx,y \rangle = c\langle x,y \rangle##
##\text{(c)} \ \overline{\langle x,y \rangle} = \langle y,x \rangle##
##\text{(d)} \ \langle x,x \rangle > 0 \ \text{if} \ x \ne 0##

What about these axioms imply that ##\langle x,y \rangle \ge 0## for all ##x## and ##y##?
Mr Davis 97 said:
Well I just realize that the inner product can be negative... Well then I guess that leads me to another question. I know that the norm of a vector ##\sqrt{\langle x, x\rangle}## can intuitevly be thought of as length of a vector. However, what is the geometric intuition behind the inner product of any two distinct vectors, especially that in the case of the reals the inner product can be negative?
I think you may have asked the original question because you confused inner product with norm measure (it happens).
For ordinary geometrical vectors:
a•b = ||a|| ||b|| cos(a,b)
(the angle (a,b) has orientation from a to b and + or - sign ...)
Play with that and I think it can answer a lot.

P.S. Also (perhaps part of the confusion), in abstract and linear algebra, a [vector] space with norm does not necessarily have inner product (it can just be a space with norm, and norm is by axiom always real and possitive, or zero). Whereas, on the other hand, a space with inner product always has a norm (at least the obvious one that has been mentioned).
 
Last edited:
  • Like
Likes WWGD and FactChecker
  • #10
fresh_42 said:
Normally one wants do define a distance, i.e. a metric by a inner product
2 typos here: 1. (corr.) "wants to". 2. (corr.) "an inner".
 
  • #11
fresh_42 said:
In that case: what does ##\langle x,y \rangle \geq 0## mean?
Even when working in a Complex V.S, inner-products are Real-valued , e.g. http://mathworld.wolfram.com/InnerProduct.html

EDIT: This is incorrect, As Stavros pointed out. A Complex inner-product can be Complex-valued.
 
Last edited:
  • #12
WWGD said:
Even when working in a Complex V.S, inner-products are Real-valued , e.g. http://mathworld.wolfram.com/InnerProduct.html
You mean for x=y? (by using axiom (c) we get that the inner product is real). For x≠y it can be complex (otherwise why the complex conjugate? - look also carefully at your quoted ref.).

In the axioms it is forgotten to be mentioned (implied) that the inner product on a space V is a mapping from VxV to C ...
Mr Davis 97 said:
The inner product axioms are the following:
##\text{(a)} \ \langle x+z,y \rangle = \langle x,y \rangle + \langle z,y \rangle##
##\text{(b)} \ \langle cx,y \rangle = c\langle x,y \rangle##
##\text{(c)} \ \overline{\langle x,y \rangle} = \langle y,x \rangle##
##\text{(d)} \ \langle x,x \rangle > 0 \ \text{if} \ x \ne 0##

What about these axioms imply that ##\langle x,y \rangle \ge 0## for all ##x## and ##y##?
 
  • #13
Stavros Kiri said:
You mean for x=y? (by using axiom (c) we get that the inner product is real). For x≠y it can be complex (otherwise why the complex conjugate? - look also carefully at your quoted ref.)

In the axioms it is forgotten to be mentioned (implied) that the inner product on a space V is a mapping from VxV to C ...
Ah, my bad, when I read scalar I assumed Real-valued for some reason.
 
  • Like
Likes Stavros Kiri
  • #14
WWGD said:
Ah, my bad, when I read scalar I assumed Real-valued for some reason.
Ok. 'Scalar' as opposed to 'vector' ...

Also in the ref., or in general, one has to realize the differences (and connections) between 'metric space', 'normed space' and 'inner product space'. (+ there are more useful types mentioned there, e.g. 'Hilbert space', Lorentzian inner product and metric etc. ...)
 
  • #15
Stavros Kiri said:
Ok. 'Scalar' as opposed to 'vector' ...

Also in the ref., or in general, one has to realize the differences (and connections) between 'metric space', 'normed space' and 'inner product space'. (+ there are more useful types mentioned there, e.g. 'Hilbert space', Lorentzian inner product and metric etc. ...)

I was thinking of Real vector spaces and somehow did not read carefully-enough, my bad, wake-up time, I am having my double shot :).
 
  • #16
WWGD said:
I was thinking of Real vector spaces and somehow did not read carefully-enough, my bad, wake-up time, I am having my double shot :).
Lol. Can happen to anyone ...
 
  • Like
Likes WWGD
  • #17
My doubt is then how do we do geometry in a Complex V.S if we do not have the expression :

##\frac {a.b}{||a||||b||}=cos(\theta) ## , since a.b ( the dot product) is not a Real number?
 
  • #18
WWGD said:
My doubt is then how do we do geometry in a Complex V.S if we do not have the expression :

##\frac {a.b}{||a||||b||}=cos(\theta) ## , since a.b ( the dot product) is not a Real number?
We do geometry in the corresponding real V.S##^2##. Otherwise we get imaginary and negative volumes, I guess. Or we define a distance by ##d(a,b)=|\,||a||-||b||\,|##. Your question is in its kernel: How can a complex vector space be oriented, if we don't consider it as a real one of twice the dimension? I think it can't for the same reasons the complex numbers can't be Archimedean ordered, but I don't have the definitions or a proof in mind, i.e. a list of requirements.
 
  • #19
fresh_42 said:
We do geometry in the corresponding real V.S##^2##. Otherwise we get imaginary and negative volumes, I guess. Or we define a distance by ##d(a,b)=|\,||a||-||b||\,|##. Your question is in its kernel: How can a complex vector space be oriented, if we don't consider it as a real one of twice the dimension? I think it can't for the same reasons the complex numbers can't be Archimedean ordered, but I don't have the definitions or a proof in mind, i.e. a list of requirements.
Do you mean orientation in terms of a choice of basis (so that we have two orientations, + and -) and two bases B,B' are equivalent iff the change-of-basis matrix has + determinant and are inequivalent otherwise? EDIT: Is orientation/orientability a Topological or Geometric property? EDIT: So we define two possible orientations on a pair ( Vector Space, Basis) , but, as you said, we need to then consider "Realified" bases for the Complex spaces ( or viceversa)?
 
Last edited:
  • #20
The usual dot product on a complex vector space is given as sesquiliniear form by ##v \cdot w = \sum_i \bar{v}_i w_i## or the other way around. This gives us the real valued Euclidean norm ##\langle v,v \rangle = \sum_i ||v_i||^2##. If we allow the inner product to be complex, we cannot use it to apply real arithmetic as the basis of geometry. Otherwise we will have find a way to get rid of the imaginary part, e.g. by simply ignoring the ##\mathcal{i}##, i.e. the substitution ##\mathcal{i} \mapsto 1##. I just don't know where this leads to or what will be left of any geometry in these cases. So as long as the requirements aren't defined, it's hard to tell what's possible or not. I cannot imagine how such a solution should look like. If we simply want to use the ordinary Euclidean geometry, then ##\mathbb{C}=\mathbb{R}^2## will do.
 
  • #21
fresh_42 said:
The usual dot product on a complex vector space is given as sesquiliniear form by ##v \cdot w = \sum_i \bar{v}_i w_i## or the other way around. This gives us the real valued Euclidean norm ##\langle v,v \rangle = \sum_i ||v_i||^2##. If we allow the inner product to be complex, we cannot use it to apply real arithmetic as the basis of geometry. Otherwise we will have find a way to get rid of the imaginary part, e.g. by simply ignoring the ##\mathcal{i}##, i.e. the substitution ##\mathcal{i} \mapsto 1##. I just don't know where this leads to or what will be left of any geometry in these cases. So as long as the requirements aren't defined, it's hard to tell what's possible or not. I cannot imagine how such a solution should look like. If we simply want to use the ordinary Euclidean geometry, then ##\mathbb{C}=\mathbb{R}^2## will do.

Just throwing this in , have not fully thought through: for a,b in ## \mathbb C ## if <a,b>=c ; c in ##\mathbb C ## can't we talk about ## cos \theta ## in terms of the argument of c (having chosen a branch) EDIT: dividing by the product of scalars ||a||||b|| will not change the angle?
 
  • #22
Mr Davis 97 said:
The inner product axioms are the following:
##\text{(a)} \ \langle x+z,y \rangle = \langle x,y \rangle + \langle z,y \rangle##
##\text{(b)} \ \langle cx,y \rangle = c\langle x,y \rangle##
##\text{(c)} \ \overline{\langle x,y \rangle} = \langle y,x \rangle##
##\text{(d)} \ \langle x,x \rangle > 0 \ \text{if} \ x \ne 0##

What about these axioms imply that ##\langle x,y \rangle \ge 0## for all ##x## and ##y##?
There is a simple counterexample. Consider the inner product of two scalars:
##\langle x,y \rangle = x \overline{y}##
It is easy to show that that satisfies all four of these axioms. Now take <x,-x>. It equals - <x,x>, and from the axioms, it is negative unless x = 0.
 
  • #23
WWGD said:
for a,b in ## \mathbb C ## if <a,b>=c ; c in ##\mathbb C ##

What do you mean by this? Are a and b meant to be scalars ∈ ℂ? If so, what does <a,b> mean? Or do you mean that a,b ∈ℂn?
 
  • #24
Mark Harder said:
What do you mean by this? Are a and b meant to be scalars ∈ ℂ? If so, what does <a,b> mean? Or do you mean that a,b ∈ℂn?
I was thinking of an inner-product in the Complexes but it could also be in ## \mathbb C^n ## , so a,b would be in ## \mathbb C^n ## itself. EDIT: for ##\mathbb C ## we could have , e.g., <z,w>:=zw^ , where b^ is the conjugate of w , i.e., if w=a+ib , then w^:=a-ib.
 
  • #25
This is an interesting point I just noticed the other day in re- writing my linear algebra notes. the usual dot product v.w obtained by letting v amd w be coordinate column vectors and taking the transpose of v, and matrix - multiplying that row vector by the column vector w, is complex valued and can be negative. The result is that when one defines the "orthogonal complement", of a subspace, it may share some non zero vectors with the original subsopace. e.g. over the complex field C we have the vector <1,i > in the plane C^2, which is orthogonal to itself. Thus to do spectral theory and complex geometry, one uses the hermitian inner product whereby one first conjugates all the entries of w and then does what we said before. The axioms originally given by the OP suggest this meaning, and in this setting the hermitian dot product of v with itelf is always real and indeed also non -negative. I.e. even though the underlying field is C, the hermitian inner product is real valued and non negative. This does follow from the axioms given above using the conjugation symmetry property, it seems. oops, i didn't see the typo there, he probably meant that <x,x> ≥ 0 for all x. I.e. <x,y> isn't even non negative for real dot products.

Interestingly, even with the other more primitive inner product, the orthogonal complement of a subspace still has the expected complementary dimension, but it is perhaps better viewed as a subspace of the dual space.
 
  • Like
Likes fresh_42
  • #26
The Hermitian inner product of two vectors in the plane is ##<a+bi,c+di> = (ac+bd) + (bc-ad)i##. The real part is the dot product of the two numbers - viewed as real vectors in the plane. The complex part is their cross product. One gives the cosine of the angle between the two vectors. The other gives the area of the parallelogram that they span.

Note that the real part is symmetric, the complex part anti-symmetric. That is: Real Part ##<v,w> = ## Real Part ##<w,v>##. Imaginary Part ##<v,w> = -## Imaginary Part ##<w,v>##.

Geometrically, this inner product contains all of the information of the real dot product. Two vectors are orthogonal if their inner product is purely imaginary. Two vectors are collinear if the inner product is real.

- More generally if one has a regular positive definite inner product ##<,>## on a real vector space ##V## and a linear isomorphism of ##V## ##J:V→V## such that ##J^2 = - Id## and ##<v,w> = <Jv,Jw>## then one gets a Hermitian inner product by ##<<v,w>> = 1/2 <v,w> + i<v,Jw>##
 
Last edited:
  • Like
Likes WWGD
  • #27
lavinia said:
The Hermitian inner product of two vectors in the plane is ##<a+bi,c+di> = (ac+bd) + (bc-ad)i##. The real part is the dot product of the two numbers - viewed as real vectors in the plane. The complex part is their cross product. One gives the cosine of the angle between the two vectors. The other gives the area of the parallelogram that they span.

Note that the real part is symmetric, the complex part anti-symmetric. That is: Real Part ##<v,w> = ## Real Part ##<w,v>##. Imaginary Part ##<v,w> = -## Imaginary Part ##<w,v>##.

This description remains true for complex ##n## -space ##C^{n}##.

Geometrically, this inner product contains all of the information of the real dot product. Two vectors are orthogonal if their inner product is purely imaginary. Two vectors are collinear if the inner product is real.

- More generally if one has a regular positive definite inner product ##<,>## on a real vector space ##V## and a linear isomorphism of ##V## ##J:V→V## such that ##J^2 = - Id## and ##<v,w> = <Jv,Jw>## then one get a Hermitian inner product by <<v,w>> = 1/2 <v,w> + i<v,

Nice. Is this the "default" inner-product used?
 
  • #28
WWGD said:
Nice. Is this the "default" inner-product used?

Not sure what you mean by default.

Note that if you start out with a Hermitian inner product then it splits into two pieces, a real and imaginary part. The real part ##1/2(<v,w> + <w,v>)## is a positive definite real inner product and the imaginary part ##-i/2(<v,w>-<w,v>)## is a skew symmetric real valued bilinear form.

Call the skew symmetric form ##S## and call the positive definite inner product ##P##. You might like to prove that ##S## is non-degenerate and that its n'th power ##∧^{n}S## returns the volume spanned by ##2n## vectors under the inner product ##P##.
 
Last edited:
  • Like
Likes WWGD

1. What is the inner product?

The inner product is a mathematical operation that takes two vectors as inputs and returns a scalar value. It is also known as the dot product or scalar product.

2. What does it mean for the inner product to be non-negative?

A non-negative inner product means that the result of the operation is always equal to or greater than zero. This can also be interpreted as the angle between the two vectors being less than or equal to 90 degrees.

3. Why is the non-negativity of the inner product important?

The non-negativity of the inner product is important because it allows us to define the concept of orthogonality, which is crucial in many areas of mathematics and physics. It also has applications in optimization problems and machine learning algorithms.

4. How is the non-negativity of the inner product proven?

The non-negativity of the inner product can be proven using the Cauchy-Schwarz inequality, which states that the inner product of two vectors is always less than or equal to the product of their magnitudes. If the inner product is equal to the product of their magnitudes, then the vectors are parallel and the angle between them is 0 degrees, making the inner product non-negative.

5. Can the concept of non-negativity of the inner product be extended to complex numbers?

Yes, the concept of non-negativity of the inner product can be extended to complex numbers by using the Hermitian inner product. This generalization allows us to define orthogonality and non-negativity for complex vectors and has applications in quantum mechanics and signal processing.

Similar threads

Replies
3
Views
2K
  • Advanced Physics Homework Help
Replies
0
Views
132
  • Linear and Abstract Algebra
Replies
13
Views
1K
  • Linear and Abstract Algebra
Replies
6
Views
1K
  • Linear and Abstract Algebra
Replies
20
Views
3K
  • Linear and Abstract Algebra
Replies
5
Views
2K
  • Linear and Abstract Algebra
Replies
14
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Quantum Physics
Replies
13
Views
1K
  • Calculus and Beyond Homework Help
Replies
16
Views
915
Back
Top