Intereting Posts

Finding the Limit $\lim_{x\to 0} \frac{\sin x(1 – \cos x)}{x^2}$
What are the assumptions for applying Wald's equation with a stopping time
Finding the rotation matrix in n-dimensions
How to prove that compact subspaces of the Sorgenfrey line are countable?
Sets of uniqueness in $\mathbb{C}^2$
Countability of disjoint intervals
Generalization of $f(\overline{S}) \subset \overline{f(S)} \iff f$ continuous
How to reverse the $n$ choose $k$ formula?
Intersecting maximal ideals of $k$ with $k$
Proof that Fibonacci Sequence modulo m is periodic?
Proof of replacement rule in conditional probability
Proving that the language $\mathscr L$ is non regular using the pumping lemma
Find $\sin\frac{\pi}{3}+\frac{1}{2}\sin\frac{2\pi}{3}+\frac{1}{3}\sin\frac{3\pi}{3}+\cdots$
Motivation behind the definition of a Manifold.
The sum $\frac{1}{\ln(2)}+\frac{1}{\ln(3)}+\frac{1}{\ln(4)}+…$ is divergent. Find the regularized evaluation

I’m stuck on a review problem.

Consider the matrix:

- What conditions must the constants b1,b2 and b3 satisfy so that the system below has a solution
- Show $\operatorname{rank}(A) + \operatorname{rank}(B) \ge \operatorname{rank}(A+B)$
- Let $T:V→V$ be a linear transformation satisfying $T^2(v)=-v$ for all $v\in V$. How can we show that $n$ is even?
- Prove that if Rank$(A)=n$, then Rank$(AB)=$Rank$(B)$
- Showing equality in Cauchy-Schwarz inequality
- Given $A$ and $B$ positive-definite matrices and $Q$ unitary matrix, prove that if $A = BQ$, then $A=B$.

$$\left[ \begin{array}{ccc}

-1 & 1 \\

1 & 1\\

2 & 1

\end{array} \right] $$

I’m asked to find a matrix $P$ which projects onto the range of $A$, with respect to the standard basis.

I’m not actually sure how to tackle this problem. I know that if you want to project a vector $u$ onto a vector $v$, you do $\operatorname{proj}_v u = \frac{\langle u,v\rangle}{\langle v.v\rangle}v$. Does a similar procedure exist if you want to project a matrix onto another matrix?

Also, what do they mean by range of $A$? By googling, it appears to refer to the column space, but if that’s true, then what is the domain of a matrix? Does it even exist?

So it’s easy to see that the two columns of $A$ are linearly independent, so they form a basis for $C(A)$. How should I go about solving the given problem? Also, what if I have to do it with respect to a non-standard basis?

Thanks for your help.

- Uniqueness of Duals in a Monoidal Category
- Isometry group of a norm is always contained in some Isometry group of an inner product?
- Finding the Jordan canonical form of this upper triangule $3\times3$ matrix
- For two vectors $a$ and $b$, why does $\cos(θ)$ equal the dot product of $a$ and $b$ divided by the product of the vectors' magnitudes?
- large sets of commuting linearly independent matrices
- A problem on skew-symmetric matrix
- prove that $\text{rank}(AB)\ge\text{rank}(A)+\text{rank}(B)-n.$
- Rotation of conics sections using linear algebra

Let your matrix be $A$. Then the projection matrix onto $R(A)$ is $P_{R(A)}=A(A^TA)^{-1}A^T$.

Indeed, the range of $A$, denoted $R(A)$, is the column space of $A$.

For a non-standard basis, express $A$ in the new basis, and then apply the above formula.

Edited:

The intuition on the structure of the projection matrix $P$ is as follows.

The defining property of $P$ is that for any vector $x$ we must have that

$x-Px \perp R(A)$ or equivalently that $x-Px \in R(A)^{\perp}$ and since $R(A)^{\perp}=N(A^T)$, this yields $x-Px \in N(A^T)$. So $A^T (x-Px)=0$ for all $x$. Selecting $x=e_1, e_2, …, e_n$, the standard basis yields $n$ equations, $A^T P e_i = A^T e_i, i=1, …,n$. Now, the minimum norm solution of the $i^{th}$ system with respect to $Pe_i$ is $Pe_i = A (A^T A)^{-1}A^T e_i$. Grouping all these equations in matrix notation yields $P=A (A^T A)^{-1}A^T$.

Manos posted $A(A^TA)^{-1}A^T$. Since the proof is so simple, I’ll add it here.

Any vector can be written as $u+v$, where $u$ is in the column space of $A$ and $v$ is orthogonal to the column space of $A$. What must be proved is then that

$A(A^TA)^{-1}A^T(u+v)= u$. Notice that $A^Tv = 0$, so we must only consider $A(A^TA)^{-1}A^Tu$. Since $u$ is in the column space of $A$, we have $u=Aw$ (where, in this case, $w$ is in $\mathbb{R}^2$). **(PS: Note in response to a comment below: $w\in\mathbb R^2,$ NOT $\mathbb R^3$.)** So

$$

A(A^TA)^{-1}A^T u = \Big(A(A^TA)^{-1}A^T \Big) Aw = A(A^TA)^{-1} \Big( A^T A\Big)w.

$$

Do the obvious cancelation and get $Aw$ and remember that $Aw=u$.

- If $p,q$ are prime, solve $p^3-q^5=(p+q)^2$.
- Deriving generators for $H^1(T)$: what are $dx$ and $dy$?
- A subgroup with an index of 2 is normal to the group.
- Harmonic Analysis on the real special linear group
- Probability questions of watch problem
- nilpotent elements of $M_2(\mathbb{R})$, $M_2(\mathbb{Z}/4\mathbb{Z})$
- What is the categorical diagram for the tensor product?
- Prove that $A+B=-2I_{4}$
- Proof of vector addition formula
- What is the definition of tensor contraction?
- Conjectures Involving floor(x)/piecewise continuity with regards to Integration and Differential Equations
- How would you prove that $\sqrt{2}$ is irrational?
- Integral $\int_0^1\frac{1-x^2+\left(1+x^2\right)\ln x}{\left(x+x^2\right)\ln^3x}dx$
- 3 Statements of axiom of choice are equivalent
- Name for kind of big O notation with leading coefficient