Proving Reversibility of A with u & v of Size n*1

  • Thread starter Thread starter John Smith
  • Start date Start date
  • Tags Tags
    Reversibility
John Smith
Messages
6
Reaction score
0
I need help with this proof.
We have u and v of size n*1. It is giving that I of size n*n.
A = I + u*v^Transpose

Proof that if u^T*v is not = -1
then A is reverseble and that A is
A^-1 = I - (1 / (1+u^T*V))*uv^T
 
Physics news on Phys.org
The obvious thing to do is to look at
(I+uv^T)(I- \frac{1}{1+ u^Tv}uv^T)
and
(I- \frac{1}{1+ u^Tv}uv^T)(I+ uv^T)

What do you get when you multiply those out?

(Are you certain that one of those uv^T is not supposed to be vu^T?)
 
Last edited by a moderator:
I did multiply the equation out and find out that ((v^T)* u)^T = u^T * v
But I was wondering if this was enough to show out the proof.
 
No, that is not the point at all!
The products of both
(I+uv^T)(I- \frac{1}{1+ u^Tv}uv^T)
and
(I- \frac{1}{1+ u^Tv}uv^T)(I+ uv^T)
should be the identity matrix!
 
Yes thank you I think that I got it now.
 
##\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