Starting from the closed set describing an ellipsoid in $\mathbb{R}^N$: $$\Omega_x = \{ x \in \mathbb{R}^N : (x-x_0)^T\Sigma_x^{-1}(x-x_0) \leq \varepsilon^2 \}$$ where $\Sigma_x \in \mathbb{R}^{N\times N}$ is a symmetric positive definite square matrix and $x_0 \in \mathbb{R}^N$, I need to find a way a to proove that its image through the linear map $\varphi: \mathbb{R}^N \rightarrow \mathbb{R}^n,\; n<N$, defined as the product with a full rank rectangular matrix: $$y = \varphi(x) := Px, \; P\in\mathbb{R}^{n\times N},\;\rho(P)=n$$ is still an ellipsoid, in $\mathbb{R}^n$ of course, defined in this way: $$\Omega_y = \varphi(\Omega_x) = \{y \in \mathbb{R}^n: y = Px, \;x \in \Omega_x\} = \{y \in \mathbb{R}^n : (y-y_0)^T\Sigma_y^{-1}(y-y_0) \leq \varepsilon^2 \}$$ with: $$y_0 = Px_0 \in \mathbb{R}^n$$ $$\Sigma_y = P\Sigma_yP^T \in \mathbb{R}^{n\times n}$$
2025-01-13 02:45:42.1736736342
Linear Map of an ellipsoid in $\mathbb{R}^N$ into another ellipsoid in $\mathbb{R}^n$, with $n<N$
518 Views Asked by Vexx23 https://math.techqa.club/user/vexx23/detail At
1
There are 1 best solutions below
Related Questions in MATRICES
- Show CA=CB iff A=B
- What is the correct chain rule for composite matrix functions?
- Is the row space of a matrix (order n by m, m < n) of full column rank equal to $\mathbb{R}^m$?
- How to show that if two matrices have the same eigenvectors, then they commute?
- Linear Algebra: Let $w=[1,2,3]_{L_1}$. Find the coordinates of w with respect to $L$ directly and by using $P^{-1}$
- How to prove the cyclic property of the trace?
- Matrix expression manipulation
- Matrix subring isomorphic to $\mathbb{C}$
- Is the ellipsoid $x'Qx < \alpha$ equivalent to $\alpha Q^{-1} - x x' \succ 0$?
- Show that matrix $M$ is not orthogonal if it contains column of all ones.
Related Questions in ALGEBRAIC-GEOMETRY
- Relations among these polynomials
- Completion of a flat morphism
- Is every sheaf a subsheaf of a flasque sheaf?
- Intersection of curves on surfaces and the sheaf $\mathcal O_{C\cap C'}$
- Does intersection of smooth divisors satisfy Serre $S_2$ criterion?
- Application of GRR in number theory
- Generic point and pull back
- Every point lies on a unique secant through $C$
- Projective transformation in $\mathbb{P}^1$
- Equality $H^i(K,\mathcal{F}_{|K})=\varinjlim_{U\supset K}H^i(U,\mathcal{F}_{|U})$ for a constructible sheaf
Related Questions in LINEAR-TRANSFORMATIONS
- Finding a subspace such that a bilinear form is an inner product.
- Linear maps preserving the determinant and Hermiticity
- Tensor Contraction producing a trace.
- Composition of Transformation Matrix from scaling, angling and reflecting
- Find matrix corresponding to linear transformation mapping $\mathbb{R}^3$ onto $\mathbb{R}^2$
- Derivative of a Linear Transformation
- Linear Transformation: Find Matrix A Representing L
- Projection Transformation on $x$ Axis Parallel to $y=2x$
- What is meant by the notation "Tf"?
- Find Matrix A Representing L and Matrix B Representing L
Related Questions in QUADRICS
- Is there a way to parametrise general quadrics?
- A circular paraboloid can be a elliptic paraboloid?
- Classify the surface $x^2 + y^2 - z^2 + 2xy - 2xz - 2yz - y = 0$
- Change the variables in $Q(x,y,z)=(x-y+z-1)^2-2z+4$ to have $Q(f(u,v,w))=u^2+v$
- One-Sheet Hyperboloid: Find the equation given the figure
- Points with constant polar w.r.t to a tangent conic bundle
- Parametrizaction of a Hyperboloid
- How to find the equation of the curve defining the intersection of two quadrics.
- Linear Map of an ellipsoid in $\mathbb{R}^N$ into another ellipsoid in $\mathbb{R}^n$, with $n<N$
- Find an orthogonal Matrix to a quadric
Related Questions in SYSTEM-IDENTIFICATION
- What is the name of this formula??
- Properties of Injective Operator on Hilbert Space
- How to estimate a delay?
- Is chaning the reference gain a good control strategy? Feed forward control with system identification?
- Is there a way to check true/false stability in a discrete transfer/state space model?
- A priori structural identifiability analysis of a system of ordinary differential equation using differential algebra
- How can I estimate a kalman gain matrix from system identification method?
- How can I determine $A, B, C, D, K$ from subspace? System identification
- Observer Kalman Filter Identification - Why does my markov parameters jump so much?
- Finding discrete matrix $A$ from time continuous data - System identification
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Refuting the Anti-Cantor Cranks
- Find $E[XY|Y+Z=1 ]$
- 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?
- What are the Implications of having VΩ as a model for a theory?
- How do we know that the number $1$ is not equal to the number $-1$?
- Defining a Galois Field based on primitive element versus polynomial?
- Is computer science a branch of mathematics?
- Can't find the relationship between two columns of numbers. Please Help
- 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
- A community project: prove (or disprove) that $\sum_{n\geq 1}\frac{\sin(2^n)}{n}$ is convergent
- Alternative way of expressing a quantied statement with "Some"
Popular # Hahtags
real-analysis
calculus
linear-algebra
probability
abstract-algebra
integration
sequences-and-series
combinatorics
general-topology
matrices
functional-analysis
complex-analysis
geometry
group-theory
algebra-precalculus
probability-theory
ordinary-differential-equations
limits
analysis
number-theory
measure-theory
elementary-number-theory
statistics
multivariable-calculus
functions
derivatives
discrete-mathematics
differential-geometry
inequality
trigonometry
Popular Questions
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- 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)$?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- How to find mean and median from histogram
- Difference between "≈", "≃", and "≅"
- Easy way of memorizing values of sine, cosine, and tangent
- How to calculate the intersection of two planes?
- What does "∈" mean?
- If you roll a fair six sided die twice, what's the probability that you get the same number both times?
- Probability of getting exactly 2 heads in 3 coins tossed with order not important?
- Fourier transform for dummies
- Limit of $(1+ x/n)^n$ when $n$ tends to infinity
A first change of variable, $x'=x-x_0$, is employed in order to get an ellipsoid centred in the origin: $$\Omega_x=\{ x\in\mathbb{R}^N: x= x'+ x_0 \;,\;x'^T\Sigma^{-1}x'\le\varepsilon^2 \}$$
Moreover $y=Px=P(x'+x_0)=Px'+Px_0$
Calling $y_0:=Px_0$ then a new variable $y'$ can be defined as $y':=y-y_0 = Px'$
A second change of variable, is needed in order to obtain a sphere of $\mathbb{R}^N$, in place of the original ellipsoid. Considering the factorisation $\Sigma_x$ through the diagonal matrix of the eigenvalues $\Lambda_x$ and the orthogonal matrix with the eigenvectors as columns $\Pi_x $ (this is always possible because $\Sigma_x$ is symmetric positive definite therefore full rank) $\Sigma_x = \Pi_x \Lambda_x\Pi_x^T $: $$x'^T\Sigma_x^{-1}x'=x'^T\Pi_x\Lambda_x^{-1}\Pi_x^Tx'=x'^T\Sigma_x^{-1}x'=x'^T\Pi_x\Lambda_x^{-\frac{1}{2}}\Lambda_x^{-\frac{1}{2}}\Pi_x^Tx'=\left(\Lambda_x^{-\frac{1}{2}}\Pi_x^Tx'\right)^T\left(\Lambda_x^{-\frac{1}{2}}\Pi_x^Tx'\right)$$ because $(\Lambda_x^{-1/2})^T = \Lambda_x^{-1/2}$ since it is a diagonal matrix (it is chosen as the diagonal matrix having in its main diagonal the square root ot the eigenvalues of $\Sigma_x^{-1}$).
By calling $\Lambda_x^{-1/2}\Pi_x^T = B$ and defining $x''=Bx'$ then: $$x'^T\Sigma_x^{-1}x'= (Bx')^T(Bx') = x''^Tx''$$
$$\Omega_{x''}:=\{ x''\in\mathbb{R}^N:x''=Bx'=B(x-x_0), \; x\in\Omega_x\}$$
Since $\Sigma_x$ is positive definite all its eigenvalues are positive, then $B$ is full rank and then invertible: $x'=B^{-1}x''=\Pi_x\Lambda_x^{1/2}x''$ where $\Lambda_x^{1/2}:=\left(\Lambda_x^{-1/2}\right)^{-1}$
Then also $y'=Px'=PB^{-1}x''=P'x''$ where $P':=PB^{-1}$.
If $\Omega_{y'}:=\{y'\in\mathbb{R}^n:y'=y-y_0,\; y\in\Omega_y\}$ and $\varphi':=x''\longmapsto P'x'' $ then: $$\Omega_{y'}=\varphi(\Omega_x'')=\{y'\in\mathbb{R}^n:y'=P'x'', \;x''\in\Omega_{x''} \}$$
Now the problem is reduced to finding the linear map of a hypersphere into a lower dimension space. To this aim, the matrix $P'$ is factorised according to the singular value decomposition $$P'=U\Sigma V^T= \begin{matrix} \end{matrix} = \begin{pmatrix}u_1 & u_2& \cdots & u_n\end{pmatrix}\begin{pmatrix} \sigma_1 & 0 & \cdots & 0 & \cdots & 0 \\ 0 & \sigma_2 & \cdots & 0 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots & & \vdots \\ 0 & 0 & \cdots & \sigma_n & \cdots & 0 \end{pmatrix}\begin{pmatrix}v_1 \\ v_2 \\ \vdots \\ v_N\end{pmatrix}$$ where $U\in\mathbb{R}^{n\times n}, \; \Sigma\in\mathbb{R}^{n\times N}, \; V\in\mathbb{R}^{N\times N}$, $\sigma_i = \sqrt{\lambda_i(P'P'^T)}$, $u_i$ is the $i$-th normalized eigenvector of $P'P'^T$ whereas $v_i$ is the $i$-th normalized eigenvector of $P'^TP'$. The above relationship can be rewritten highlighting the action performed by $P'$ on $v_i$: $$P'V=U\Sigma V^TV=U\Sigma$$ Now, considering just tbhe $i$-th column of these $n\times N$ matrices:
$ P'v_i = \sigma_iu_i \quad \forall i=1,...,n\;$ whereas $P'v_i = 0 \quad \forall i=n,...,N$.
Then $P'$ maps the base $(v_1,...,v_n)$ into $(\sigma_1 u_1,...,\sigma_n u_n)$ and nulls all the other remaining vectors of $\mathbb{R}^N$ $(v_{n+1},...,v_N)$. Each vector of $\mathbb{R}^N$ can be represented as linear combination of the orthonormal base $(v_1,...,v_N)$; then $x''$ is mapped onto $\mathbb{R}^n$, deleting its last $N-n$ components w.r.t. such base, stretching the first $n$ components according to different weighting parameters.
Since the linear map of a sphere by a full rank diagonal matrix is an ellipsoid having as semiaxes length the reciprocal of the elements on the diagonal, while the linear map of an ellipsoid through an orthogonal matrix simply rotates without changing the shape the application of $P'$ over $\Omega_{x''}$ has to produce, eventually, an ellipsoid in $\mathbb{R}^n$.
$U$ represents the rotation matrix, aligning the ellipsoid with the eigenvectors of $P'P'^T$ (these eigenvectors are the directions of the ellipsoid main axes) and $\hat \Sigma := \left( \Sigma\Sigma^T\right)^{1/2}$ is the diagonal matrix having the on the diagonal the semiaxes length.
Then $\Omega_{y'}$ is described by the matrix $U\hat \Sigma^2 U^T = U \Sigma\Sigma^T U^T = U \Sigma V^T V \Sigma^T U^T = P'P'^T$: $$\Omega_{y'}=\{y'\in\mathbb{R}^n: y'^T(P'P'^T)^{-1}y'\le\varepsilon^2\}$$ but $P'=PB^{-1}$ then $(P'P'^T)^{-1}=(PB^{-1}{PB^{-1}}^TP^T)^{-1}=(P\Sigma_xP^T)^{-1}$.
Coming back to the original value $y$: $$\Omega_{y}=\{y\in\mathbb{R}^n: (y-Px_0)^T(P\Sigma_xP^T)^{-1}(y-Px_0)\le\varepsilon^2\}$$