# Inner ProductWatch

Announcements
#1
We have the standard inner/dot product for Euclidean space in .

The standard inner/dot product of two vectors a = (a1, a2, …, an)T and b = (b1, b2, …, bn)T in is defined as: .

Here, I am defining these vectors as column vectors by saying a is the transpose of the row vector (a1, a2, …, an) and similarly for b.

But, I've come across things saying we can have an inner product e.g. on as: Let’s define, for x, y : where x = (x1, x2)T and y = (y1, y2)T as opposed to the standard inner/dot product: So, I was wondering, wouldn't this cause confusion or is there something I am missing? For example, usually we say the length of a vector in e.g. (1,3)T is in agreement to the definition of the length of a vector using the inner product of R^2: ||(1,3)T|| = where ||x|| denotes the length of the vector x and in general: ||x|| = .

So, now if I use the other inner product , I get: ||(1,3)T|| = = , giving a different length.

So, is it always that the length of a vector in a vector space is ALWAYS dependent on how the inner product for the vector space is defined or given to you, and that if no SPECIFIC inner product is specified, you assume the length of the vector is calculated using the 'normal' method or standard inner product?
Last edited by Chittesh14; 10 months ago
0
10 months ago
#2
Yes, the length will depend on the inner product you're using.

Btw: I can see significant improvement in the way you're writing things up. Good work.
0
#3
(Original post by DFranklin)
Yes, the length will depend on the inner product you're using.

Btw: I can see significant improvement in the way you're writing things up. Good work.
0
#4
DFranklin

Hello, I was just wondering, a few days ago we had a discussion about a matrix being invertible.
What would be the chain of reasoning to show:
A matrix having a non-zero determinant implying that it has full row rank (for a square matrix, so full rank in general), so if , then A has full row rank.

Would this be good?

If a square matrix A has a non-zero determinant i.e. , this implies that A is invertible, and so the equation has the trivial solution x = 0 implying the vector x has no free variables, or the general vector parametric solution of doesn't contain any free parameters. As a result, we can say matrix A has full column rank and therefore as the matrix is square and the number of columns is equal to the number of rows, this implies that the matrix A has full row rank.

Or would you directly say: Since |A| ≠ 0, A is invertible and so it has full rank implying A has full row rank (and full column rank).
Last edited by Chittesh14; 10 months ago
0
10 months ago
#5
(Original post by Chittesh14)
DFranklin

Hello, I was just wondering, a few days ago we had a discussion about a matrix being invertible.
What would be the chain of reasoning to show:
A matrix having a non-zero determinant implying that it has full row rank (for a square matrix, so full rank in general), so if , then A has full row rank.

Would this be good?

If a square matrix A has a non-zero determinant i.e. , this implies that A is invertible, and so the equation has the trivial solution x = 0 implying the vector x has no free variables, or the general vector parametric solution of doesn't contain any free parameters. As a result, we can say matrix A has full column rank and therefore as the matrix is square and the number of columns is equal to the number of rows, this implies that the matrix A has full row rank.

Or would you directly say: Since |A| ≠ 0, A is invertible and so it has full rank implying A has full row rank (and full column rank).
It's very hard to answer this kind of question without knowing exactly what you've proved in your course and in what order.

But I think it would be very unlikely you proved implies A is invertible without proving A has full rank first (or during). In which case the 2nd method is better than the first.
0
#6
(Original post by DFranklin)
It's very hard to answer this kind of question without knowing exactly what you've proved in your course and in what order.

But I think it would be very unlikely you proved implies A is invertible without proving A has full rank first (or during). In which case the 2nd method is better than the first.
Thanks, I appreciate it 0
X

new posts Back
to top
Latest
My Feed

### Oops, nobody has postedin the last few hours.

Why not re-start the conversation?

see more

### See more of what you like onThe Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

### University open days

• Sheffield Hallam University
Get into Teaching in South Yorkshire Undergraduate
Wed, 26 Feb '20
• The University of Law
Solicitor Series: Assessing Trainee Skills – LPC, GDL and MA Law - London Moorgate campus Postgraduate
Wed, 26 Feb '20
• University of East Anglia
Sat, 29 Feb '20

### Poll

Join the discussion

#### Do you get study leave?

Yes- I like it (120)
59.11%
Yes- I don't like it (10)
4.93%
No- I want it (57)
28.08%
No- I don't want it (16)
7.88%