Is the other Gram-Schmidt process truly different from the usual one?

  • Thread starter Thread starter Avatrin
  • Start date Start date
Avatrin
Messages
242
Reaction score
6
Hi

I already know the "usual" Gram-Schmidt Process:

uk = vk - Ʃj=1k-1projujvk

But, then I discovered another Gram-Schmidt process that gives an orthogonal basis (in Matrices and Linear transformations by Charles Cullen):

uk = vk - Ʃj=1k-1(vk*uj)uj

Essentially, it is the same except you do not divide by <uj,uj>. Cullen calls this the Gram-Schmidt process, yet it is different. Does it give a different basis?

The explanations for the usual Gram-Schmidt process are usually visual while the explanation for this one was algebraic. I cannot make sense of it in any of the visual explanations of the Gram-Schmidt process, yet it makes perfect sense algebraically;

Starting with a basis {u1,u2...,uk-1} and a vector vk that is not in its span to create a vector uk that is orthogonal to all ui:

uk*ui = vk*ui + uiƩj=1k-1ajuj = vk*ui + ai = 0

Thus, ai = -vk*ui for uk to be orthogonal to all ui. This gives us what I wrote above.

How are these processes different? Or, if they aren't, why?
 
Last edited:
Physics news on Phys.org
Avatrin said:
Hi

I already know the "usual" Gram-Schmidt Process:



But, then I discovered another Gram-Schmidt process that gives an orthogonal basis (in Matrices and Linear transformations by Charles Cullen):



Essentially, it is the same except you do not divide by <uj,uj>. Cullen calls this the Gram-Schmidt process, yet it is different. Does it give a different basis?

That definition does not give an orthogonal basis unless ##\langle u_j,u_j\rangle =1 ## for ##j=1,\ldots k-1##. I am not familiar with the text that you cite, but it is probably the case that there is an additional steps where we normalize the basis vectors. For example we can start with

$$u'_1 = v_1 , ~~~~ u_1 = \frac{u'_1 }{||u_1'||}.$$

Then we can construct

$$ u'_2 = v_2 - \langle v_2,u_1 \rangle u_1$$

which is orthogonal to ##u_1##, since

$$ \langle u_1, u'_2 \rangle = \langle u_1,v_2 \rangle - \langle v_2,u_1 \rangle \langle u_1, u_1\rangle =0.$$

We will have to similarly normalize ##u_2 = u_1'/||u_2'||## if we want to construct ##u_3## with a similar formula that omits the factor of ##\langle u_j,u_j\rangle##.

The algebraic computation seems clear and also indicates precisely why we need the factor of ##\langle u_j,u_j\rangle## in the formula for the projection operator.
 
I had to reread the text and redo the computations to see that, but yes, it does indeed have to be an orthonormal basis. I just didn't pick up the part that said orthonormal instead of orthogonal.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
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