Suppose I have n-1 linearly independent vectors in n dimensional space, and I wish to find a vector perpendicular to all of these. How would I go about doing this? When working in three dimensions, I can just find the cross product of the two given vectors. In 2 dimensions, I would solve the algebraic expression for the dot product. These two methods seem entirely different and so I am not sure if they can somehow be generalised. I could generalise the approach for the 2D case by writing a series of n-1 simultaneous equations which are the dot products of an unknown vector with the given vectors, and u could write this in matrix form, but then I don't know what to do with this...
2026-04-21 04:23:29.1776745409
How to find a vector in nD that is perpendicular to (n-1) linearly independent vectors.
292 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LINEAR-ALGEBRA
- An underdetermined system derived for rotated coordinate system
- How to prove the following equality with matrix norm?
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Why the derivative of $T(\gamma(s))$ is $T$ if this composition is not a linear transformation?
- Why is necessary ask $F$ to be infinite in order to obtain: $ f(v)=0$ for all $ f\in V^* \implies v=0 $
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Summation in subsets
- $C=AB-BA$. If $CA=AC$, then $C$ is not invertible.
- Basis of span in $R^4$
- Prove if A is regular skew symmetric, I+A is regular (with obstacles)
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in VECTOR-SPACES
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Does curl vector influence the final destination of a particle?
- Closure and Subsets of Normed Vector Spaces
- Dimension of solution space of homogeneous differential equation, proof
- Linear Algebra and Vector spaces
- Is the professor wrong? Simple ODE question
- Finding subspaces with trivial intersection
- verifying V is a vector space
- Proving something is a vector space using pre-defined properties
- Subspace of vector spaces
Related Questions in MATRIX-EQUATIONS
- tensor differential equation
- Can it be proved that non-symmetric matrix $A$ will always have real eigen values?.
- Real eigenvalues of a non-symmetric matrix $A$ ?.
- How to differentiate sum of matrix multiplication?
- Do all 2-variable polynomials split into linear factors over the space of $2 \times 2$ complex matrices?
- Big picture discussion for iterative linear solvers?
- Matrix transformations, Eigenvectors and Eigenvalues
- Jordan chevaley decomposition and cyclic vectors
- If $A$ is a $5×4$ matrix and $B$ is a $4×5$ matrix
- Simplify $x^TA(AA^T+I)^{-1}A^Tx$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
As you've noted, the problem can be reduced to finding the null space of a matrix. But perhaps to others it is not obvious why this is so.
Let $v_1,\ldots,v_{n-1},x\in\mathbb{R}^n$ be column vectors. Consider: $$ A = \begin{bmatrix}v_1^T\\\vdots\\v_{n-1}^T\end{bmatrix} \;\;\;\implies\;\;\; Ax=\vec{0} =\begin{bmatrix}v_1^T x\\\vdots\\v_{n-1}^T x\end{bmatrix} =\begin{bmatrix}v_1\cdot x\\\vdots\\v_{n-1}\cdot x\end{bmatrix} $$ So, finding the null-space of $ A $ is equivalent to enforcing $v_i\cdot x=0$, meaning $x$ is orthogonal to the rest of the set.
It may also be worth mentioning the Gram-Schmidt procedure, which is a little more general.
Notice that this gives you an easy way to construct an orthonormal vector $v_n$, which is orthogonal to a set of orthonormal vectors $v_1,\ldots,v_{n-1}$. Just choose a random vector $r\in\mathbb{R}^n$, normalize it, and take: $$ v_n = r - \sum_{k=1}^{n-1} \frac{v_k\cdot r}{v_k\cdot v_k}v_k $$ where, if $r$ or $v_n$ turns out to be linearly dependent on one of the $v_i$, just choose a different $r$. (The probability of such an event is extraordinarily low; theoretically, zero in fact.)