How to construct a vector perpendicular to a bunch of known vectors?

jollage
Messages
61
Reaction score
0
Hi,

Given several vectors, which may be or not be orthogonal to each other, how to construct a vector perpendicular to them? In a sense of inner production being zero.

To be specific, I have n vectors v_{N} of length N, where n<N. So the maximum rank for these vectors is n, which leaves space for new vectors perpendicular to all of them. How to construct such a vector? I know Gram-Schmidt process, but it seems it's not what I want.

Thanks.
 
Physics news on Phys.org
Why isn't the Gram-Schmidt process what you want?
 
Thanks. I see. I should use Gram-Schmidt process.
 
You can, but you can also write a matrix M using your vectors, row-reduce, calculate the nullspace of M and then use the fact , by the fundamental theorem of algebrar ,that the nullspace of the matrix is the ortho complement of the row space, and then you can find a basis for the nullspace. Just an alternative.
 
Last edited:
##\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