Is there a general Relationship between the determinant (or eigenvalues/-vectors) of a square matrix $A$ and its "symmetrification" $\frac{1}{2}(A + A^T)$?
2026-03-30 03:37:27.1774841847
Relationship between $A$ and $\frac{1}{2}(A + A^T)$?
104 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 EIGENVALUES-EIGENVECTORS
- Stability of system of parameters $\kappa, \lambda$ when there is a zero eigenvalue
- Stability of stationary point $O(0,0)$ when eigenvalues are zero
- Show that this matrix is positive definite
- Is $A$ satisfying ${A^2} = - I$ similar to $\left[ {\begin{smallmatrix} 0&I \\ { - I}&0 \end{smallmatrix}} \right]$?
- Determining a $4\times4$ matrix knowing $3$ of its $4$ eigenvectors and eigenvalues
- Question on designing a state observer for discrete time system
- Evaluating a cubic at a matrix only knowing only the eigenvalues
- Eigenvalues of $A=vv^T$
- A minimal eigenvalue inequality for Positive Definite Matrix
- Construct real matrix for given complex eigenvalues and given complex eigenvectors where algebraic multiplicity < geometric multiplicity
Related Questions in DETERMINANT
- Form square matrix out of a non square matrix to calculate determinant
- Let $T:V\to W$ on finite dimensional vector spaces, is it possible to use the determinant to determine that $T$ is invertible.
- Optimization over images of column-orthogonal matrices through rotations and reflections
- Effect of adding a zero row and column on the eigenvalues of a matrix
- Geometric intuition behind determinant properties
- Help with proof or counterexample: $A^3=0 \implies I_n+A$ is invertible
- Prove that every matrix $\in\mathbb{R}^{3\times3}$ with determinant equal 6 can be written as $AB$, when $|B|=1$ and $A$ is the given matrix.
- Properties of determinant exponent
- How to determine the characteristic polynomial of the $4\times4$ real matrix of ones?
- The determinant of the sum of a positive definite matrix with a symmetric singular matrix
Related Questions in SYMMETRIC-MATRICES
- $A^2$ is a positive definite matrix.
- Showing that the Jacobi method doesn't converge with $A=\begin{bmatrix}2 & \pm2\sqrt2 & 0 \\ \pm2\sqrt2&8&\pm2\sqrt2 \\ 0&\pm2\sqrt2&2 \end{bmatrix}$
- Is $A-B$ never normal?
- Is a complex symmetric square matrix with zero diagonal diagonalizable?
- Symmetry of the tetrahedron as a subgroup of the cube
- Rotating a matrix to become symmetric
- Diagonalize real symmetric matrix
- How to solve for $L$ in $X = LL^T$?
- Showing a block matrix is SPD
- Proving symmetric matrix has positive eigenvalues
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?
Let $\mathbb K$ be a field. Denote by $\mathbb K^{n\times n}$ the space of matrices, by $\mathbb K_\mathrm{sym}^{n\times n}$ the space of symmetric matrices and by $\mathbb K_\mathrm{antisym}^{n\times n}$ the space of antisymmetric matrices (also denoted $\mathfrak{o}_n(\mathbb K)$). Given a matrix $A\in\mathbb K^{n\times n}$, you get a decomposition into a symmetric part $A_\mathrm{sym}$ and an antisymmetric part $A_\mathrm{antisym}$: $$A=A_\mathrm{sym}+A_\mathrm{antisym} =\underbrace{\frac{1}{2}(A+A^T)}_{\in\mathbb K_\mathrm{sym}^{n\times n}}+\underbrace{\frac{1}{2}(A-A^T)}_{\in\mathbb K_\mathrm{sym}^{n\times n}},$$ hence a decomposition: $$\mathbb K^{n\times n}=\mathbb K_\mathrm{sym}^{n\times n}+\mathbb K_\mathrm{antisym}^{n\times n}.$$ (The sum is direct iff $\operatorname{char}\mathbb K\neq 2$ (so $1+1\neq 0$ in $\mathbb K$): A symmetric and antisymmetric matrix $A$ has to fulfill $A=A^T=-A$, hence $(1+1)A=0$, so $A=0$ if $\operatorname{char}\mathbb K\neq 2$ and the identity matrix $E_n$ is symmetric and antisymmetric if $\operatorname{char}\mathbb K=2$.)
The symmetrification $A\mapsto A_\mathrm{sym}$ is therefore a projection onto a vector subspace, which results in a loss of information. As Thomas Andrews already mentioned, the projection on the zero matrix is a full loss of information: Any antisymmetric matrix $A=B-B^T\propto B_\mathrm{antisym}$ fulfills $A_\mathrm{sym}=0$, hence you cannot deduce even a single information about $A$ from $A_\mathrm{sym}$, that can differ for antisymmetric matrices.
It is possible the other way around: As Thomas Andrews already mentioned as well, their traces (which does not differ for antisymmetric matrices, whose trace always vanishes) are the same: $$\operatorname{tr}(A_\mathrm{sym}) =\frac{1}{2}\operatorname{tr}(A+A^T) =\frac{1}{2}(\operatorname{tr}(A)+\operatorname{tr}(A^T)) =\frac{1}{2}(\operatorname{tr}(A)+\operatorname{tr}(A)) =\operatorname{tr}(A)$$ and therefore the sum of their eigenvalues are as well. Concerning determinants (which behave nicely when used together with multiplication, not addition like the trace), eigenvalues and eigenvectors, my intuition would go towards nothing being possible in that direction, as all of them will probably differ a lot when considering the affine vector space $A_\mathrm{sym}+\mathbb K_\mathrm{antisym}^{n\times n}$, that is projected down onto $A_\mathrm{sym}$. To find some examples, you could find the following lemma helpful:
Given an orthogonal matrix $A\in\mathbb K^{n\times n}$, then: \begin{align*} &2^{2n}\det(A_\mathrm{sym})\det(A_\mathrm{antisym}) =\det(A+A^T)\det(A-A^T) =\det\left((A+A^T)(A-A^T)\right) \\ =&\det(A^2+\underbrace{A^TA-AA^T}_{=E_n-E_n=0}-(A^T)^2) =\det\left(A^2-(A^2)^T\right) =2^n\det\left((A^2)_\mathrm{antisym}\right), \end{align*} hence: $$2^n\det(A_\mathrm{sym})\det(A_\mathrm{antisym}) =\det\left((A^2)_\mathrm{antisym}\right).$$ (This is only non-trivial for even $n$ as for odd $n$, the determinant of antisymmetric matrices always vanishes.) You can for example play a bit using complex structures, which are orthogonal and antisymmetric in particular and give the negative identity when squared.