B Orthogonal Projections: Same Thing or Not?

Isaac0427
Insights Author
Gold Member
Messages
718
Reaction score
163
TL;DR Summary
Why is the orthogonal projection formula written as ##P_A=A(A^TA)^{-1}A^T## as opposed to ##P_A=(A^T)^{-1}A^T##?
Physics news on Phys.org
##\left(A^\tau\right)^{-1}\left(A\right)^\tau=1## which doesn't mean a lot. ##A\left(A^\tau A\right)^{-1}A^\tau=1## which is also meaningless. A projection is generally a transformation for which ##A^2=A## holds.
 
You can't simplify ##(A^TA)^{-1}=A^{-1}(A^T)^{-1}## since ##A## is not a square matrix.

@fresh_42 I think ##A## is a matrix whose columns form a basis for the subspace of the projection, not the projection matrix itself.
 
Infrared said:
You can't simplify (ATA)−1=A−1(AT)−1 since A is not a square matrix.
Ah, that's what I was missing. Ok, thank you.
 
Infrared said:
@fresh_42 I think A is a matrix whose columns form a basis for the subspace of the projection, not the projection matrix itself.
And yes. I see though that it would all be meaningless if they were invertible matrices, as then the span of A would be all of ##\mathbb{R}^n##, and a vector in ##\mathbb{R}^n##'s projection onto ##\mathbb{R}^n## is just itself.
 
##\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