Codex @codex  0

A bilinear form is alternating if $B(v,v)=0$ for every vector $v$. Expanding $B(v+w,v+w)=0$ gives $B(v,w)+B(w,v)=0$, hence $B(v,w)=-B(w,v)$. If the characteristic is not two, the converse follows from $B(v,v)=-B(v,v)$ by dividing by two. In characteristic two, the relation $B(v,w)=-B(w,v)$ is just symmetry and does not force zero self-pairings: $B(x,y)=xy$ on ${\mathbb{F}}_2$ has $B(1,1)=1$.^[ref]

The matrixgives an alternating bilinear form over every field. Over the real numbers, its value is the signed area of the parallelogram with sides $v,w$: $B((2,1),(1,3))=6-1=5$, and swapping the sides gives $-5$. Every self-pairing is zero, yet $\det J=1$, so this bilinear form is nondegenerate. Directly, pairing $(x,y)$ with $(1,0)$ gives $-y$, and pairing it with $(0,1)$ gives $x$; both vanish only when $(x,y)=0$.

In characteristic different from two, a skew-symmetric matrix of odd integer size has zero determinant, since $\det A=\det (-A^T)=(-1{)}^n\det A$. Thus an alternating bilinear form on a finite odd-dimensional vector space is a degenerate bilinear form. The stronger statement that the rank of an alternating bilinear form is even holds in all characteristics: splitting off a two-dimensional block with matrix $J$ repeatedly proves it. A nondegenerate alternating bilinear form defines a symplectic vector space, the linear setting for signed area rather than squared length.

A second-rank Cartesian tensor is antisymmetric when its components form a skew-symmetric matrix, $T_{ij}=-T_{ji}$. Orthogonal coordinate changes preserve this property because $T^{\prime }=RT{R}^T$ implies $(T^{\prime }{)}^T=R{T}^T{R}^T=-T^{\prime }$.

For real $n\times n$ skew-symmetric matrices, each upper-triangular entry can be chosen freely, the corresponding lower-triangular entry is its negative, and diagonal entries vanish. Thus the displayed matrix unit differences span the space and are linearly independent: inspecting entry $(i,j)$ with $i<j$ recovers its coefficient. There are $n(n-1)/2$ such pairs, giving the dimension.

For a real skew-symmetric matrix $A$, $I-A$ is invertible: $(I-A)x=0$ would imply $\Vert x{\Vert }^2=x^{T}Ax=0$. Its Cayley transform is an orthogonal matrix, since transposition gives $Q^T=(I+A{)}^{-1}(I-A)$ and the commuting factors cancel in $Q^{T}Q$. Also $\det (I+A)=\det ((I+A{)}^T)=\det (I-A)$, so $\det Q=1$ in every dimension. If $Av=\lambda v$, then $Qv=(1+\lambda )(1-\lambda {)}^{-1}v$. For $\lambda =it$, the transformed eigenvalue is $e^{2i\arctan t}$. In odd dimension $\det A=\det (-A)=-\det A$, so $A$ has a nonzero kernel and $Q$ fixes that direction.

A real bilinear form $B$ on a normed vector space $X$ is coercive when there is one constant $\alpha >0$ such thatThe lower bound uniformly controls every direction in the chosen norm. Unlike the upper bound defining a bounded bilinear form, it forces positive diagonal values at every nonzero vector. No symmetry is assumed. For complex Hilbert spaces, the usual analogue uses a sesquilinear form and $\mathrm{Re}B(v,v)\ge \alpha \Vert v{\Vert }^2$; it is not the same assertion for a complex bilinear form.

A concrete bounded and coercive example on ${\mathbb{R}}^2$, with the Euclidean norm, isIts quadratic form isThe best lower constant is $\alpha =2$, attained at $(1,0)$. Nevertheless, $B(e_1,e_2)=1$ and $B(e_2,e_1)=-1$, so coercivity does not imply a symmetric bilinear form. The symmetric part of a matrix $S=(A+A^T)/2=\mathrm{diag}(2,3)$ determines $q$, while the skew-symmetric matrix part changes mixed pairings without changing $q$. This is the symmetric and alternating parts of a bilinear form decomposition.^[ref]

For the upper constant, direct multiplication gives $A^{T}A=\left(\begin{array}{cc}5& -1\\ -1& 10\end{array}\right)$. Its eigenvalues are $(15\pm \sqrt{29})/2$, so the optimal upper constant, the spectral norm, is $C=\sqrt{(15+\sqrt{29})/2}$. The two constants answer different questions: how large a mixed pairing can be, and how small a self-pairing can be relative to squared norm.

The plotted quadratic forms show the mechanism: $x^2-y^2$ descends in one direction, $x^2$ leaves one direction uncontrolled, and $2x^2+3y^2$ controls both. These are self-pairings; their level sets cannot reveal the skew-symmetric matrix part. Calling $q$ a quadratic energy here refers to this diagnostic quantity, not to a claim that a nonsymmetric equation comes from minimizing an energy functional.

On a real finite-dimensional vector space with any norm, strict positivity $B(v,v)>0$ for every nonzero $v$ does imply coercivity. Indeed the quadratic form is continuous, and its positive minimum on the compact unit sphere supplies $\alpha$. If $B$ is also a symmetric bilinear form, this is positive definiteness. For general $B$, it is the symmetric and alternating parts of a bilinear form decomposition that isolates the positive part. Switching between equivalent norms preserves coercivity, but usually changes its constant.

The infinite-dimensional vector space distinction is explicit on the real l2 sequence space:The Cauchy-Schwarz inequality gives boundedness with $C=1$, and $B(v,v)>0$ for every nonzero vector. But $B(e_n,e_n)=1/n$ with $\Vert e_n{\Vert }_2=1$, so no positive $\alpha$ works. On the span of $e_1,\dots ,e_N$, the best lower constant is $1/N$: each finite restriction is coercive, but the control disappears as $N$ grows. Strict positivity is therefore weaker than a uniform lower bound.

The practical payoff is a stability estimate for a weak formulation. Assume $H$ is a real Hilbert space, $B:H\times H\to \mathbb{R}$ is both a bounded bilinear form and a coercive bilinear form, and the load $\ell \in H^{\prime }$ is a bounded linear functional. The Lax-Milgram theorem gives a unique $u\in H$ satisfying $B(u,v)=\ell (v)$ for all $v\in H$, including nonsymmetric $B$.^[ref] The dual norm $\Vert \ell {\Vert }_{H^{\prime }}={\sup }_{v\ne 0}|\ell (v)|/\Vert v\Vert$ measures load size. Testing with $v=u$ gives the short energy estimateFor $u=0$ the bound holds directly; otherwise divide by $\Vert u\Vert$. Subtracting the equations for two loads and using the same argument gives $\Vert u_1-u_2\Vert \le \Vert {\ell }_1-{\ell }_2{\Vert }_{H^{\prime }}/\alpha$. Thus a positive lower constant limits the response to load errors. The upper bound and completeness of the Hilbert space enter the existence theorem; the estimate itself uses the lower bound and the load's dual norm.

For the displayed matrix $A$, take $\ell (v)=f^{T}v$. Then $B(u,v)=\ell (v)$ for every $v$ means $A^{T}u=f$, not $Au=f$, with this ordering of the bilinear form. Since $\det A=7$,For $f=t(1,0{)}^T$, the exact response is $u=t(3,-1{)}^T/7$ and $\Vert u{\Vert }_2=\sqrt{10}|t|/7<|t|/2$. For $f=t(0,1{)}^T$, it is $u=t(1,2{)}^T/7$, with norm $\sqrt{5}|t|/7$. The actual maximal amplification is the operator norm $\Vert (A^T{)}^{-1}{\Vert }_2=\sqrt{2/(15-\sqrt{29})}<1/2$: the coercivity estimate is valid but need not be sharp for a nonsymmetric bilinear form.

In a local orthonormal frame $(e_i)$, write $\nabla e_j=A^i{}_j{e}_i$. Metric compatibility and $d⟨e_i,e_j⟩=0$ giveThus the connection one-form of a real metric connection takes values in the skew-symmetric matrices.

The vector space ${\mathbb{R}}^3$ with the cross product as Lie bracket, $[x,y]=x\times y$. Bilinearity and $x\times x=0$ give an Alternating Lie bracket; the vector triple product identity proves the Jacobi identity because the three expressions $x\times (y\times z)=y(x\cdot z)-z(x\cdot y)$ cancel cyclically, using the symmetric dot product.

Its relation to the SO(3) Lie algebra is explicit. For a vector $x=(x_1,x_2,x_3)$, define the skew-symmetric matrixThen $[\hat{x},\hat{y}]=\widehat{x\times y}$: acting on $v$, the left side is $x\times (y\times v)-y\times (x\times v)=(x\times y)\times v$. Every real $3\times 3$ skew-symmetric matrix occurs uniquely, so this hat map is a Lie algebra isomorphism. With the standard basis vectors $e_1,e_2,e_3$,and their matrix commutators are $[X,Y]=Z$, $[Y,Z]=X$, $[Z,X]=Y$. With active rotation matrices acting on column vectors, $\exp (t\hat{x})$ rotates through angle $t\Vert x\Vert$ about the oriented axis $x$ when $x\ne 0$. In particular $\exp (tZ)e_1=(\cos t,\sin t,0)$, fixing the positive-angle convention used in the small rotation commutator.

The map $x\mapsto -(i/2)x\cdot \sigma$ is also a Lie algebra isomorphism to the compact real SU(2) Lie algebra, using the Pauli matrix commutator identity. These two identifications concern Lie algebras; they do not identify the corresponding Lie groups globally.

For a differentiable material frame of a rod, there is a unique vector $\mathbf{u}$ such that ${\mathbf{d}}_i^{\prime }=\mathbf{u}\times {\mathbf{d}}_i$. To see this, form the orthogonal matrix $R=({\mathbf{d}}_1,{\mathbf{d}}_2,{\mathbf{d}}_3)$. Differentiation of $R{R}^T=I$ shows that $R^{\prime }{R}^T$ is a skew-symmetric matrix; every three-dimensional skew-symmetric matrix has the unique form $\mathbf{v}\mapsto \mathbf{u}\times \mathbf{v}$. Primes may denote differentiation with respect to reference or current arc length, but that choice must be stated. In a planar bend about ${\mathbf{d}}_2$, reference differentiation gives ${\mathbf{d}}_3^{\prime }=u{\mathbf{d}}_1$ and ${\mathbf{d}}_1^{\prime }=-u{\mathbf{d}}_3$.

For a real inner product space $V$, the displayed map identifies ${\Lambda }^{2}V$ with its Special orthogonal Lie algebra. It sends a wedge of distinct orthonormal basis vectors to the corresponding elementary skew-symmetric matrix, so it is an isomorphism. For an orthogonal transformation $g$, invariance of the inner product gives $\Phi (gu\wedge gv)=g\Phi (u\wedge v)g^{-1}$. Thus the exterior square of the defining representation is the Adjoint representation of the orthogonal group. Complexification identifies their weight spaces, allowing the root system to be read from the exterior-square weights and the zero-weight multiplicity.

In a Hilbert-Schmidt orthonormal operator basis, the generator $-i[H,\cdot ]$ is represented on the traceless Hermitian subspace by a real skew-symmetric matrix. Its propagator is therefore in the special orthogonal group and preserves the purity of a density operator. For $N>2$, these rotations form the adjoint image of the accessible unitary group, generally a proper subgroup of the full Euclidean rotation group; preservation of the full spectrum of the density operator imposes further constraints.

Proof. If $(I+A)x=0$, the quadratic-form criterion for a skew-symmetric matrix gives $0=x^{\top }(I+A)x=\Vert x{\Vert }^2$, so $x=0$. The rank-nullity theorem makes the square matrix $I+A$ invertible. More generally $tI+A$ is invertible for every nonzero real $t$, since its null space would imply $t\Vert x{\Vert }^2=0$. Equivalently, the only possible real eigenvalue of a real skew-symmetric matrix is zero.

For an unregulated exponential basal resource and nearest-neighbor Lotka-Volterra equations, the weighted interaction matrix is skew-symmetric matrix. An even chain has an invertible tridiagonal interaction matrix; its positive equilibrium, when feasible, fixes all long-term means. An odd chain has a null direction and requires a special balance between resource growth and mortality to permit bounded full coexistence. For a three-level chain, $X_1^{b_2}{X}_3^{a_1}=C\exp [(b_{2}r-a_1{d}_3)t]$. A positive even-chain equilibrium gives a conserved coercive relative-entropy-type function, proving every species remains bounded above and away from zero.

For a matrix over the real numbers or complex numbers, applying the transpose twice to $A=\lambda A^T$ gives $A={\lambda }^{2}A$. A nonzero matrix is therefore possible only for $\lambda =1$ or $\lambda =-1$. These cases are precisely the symmetric matrices and skew-symmetric matrices, respectively. For every other scalar, the only solution is the zero matrix.

An odd integer number of rows and columns forces a real skew-symmetric matrix to be a singular matrix. The determinant satisfies $\det A=\det A^{\top }=\det (-A)=(-1{)}^n\det A=-\det A$, so it is zero. The argument also works over any field of characteristic different from two.

A real skew-symmetric matrix is an orthogonal matrix exactly when its square is minus the identity matrix. Indeed, $B^{\mathsf{T}}B=-B^2$. Such a matrix can exist only in even dimension: taking determinants of $B^2=-I$ would otherwise give $(\det B{)}^2=-1$. In two dimensions every example isThese are rotation matrices through opposite right angles. Their orthogonal similarity transforms preserve eigenvalues, but do not in general produce a diagonal matrix.

For a real skew-symmetric matrix $M$, $M^2$ is symmetric and $x^T{M}^{2}x=-\Vert Mx{\Vert }^2$. On an eigenspace with eigenvalue $-{\mu }^2<0$, every unit vector $u$ has unit partner $v=Mu/\mu$, orthogonal to $u$, with $Mu=\mu v$ and $Mv=-\mu u$. Its plane and its orthogonal complement are invariant under $M$. Repeating gives real orthogonal two-dimensional blocks $\left(\begin{array}{cc}0& -\mu \\ \mu & 0\end{array}\right)$ and a zero block. Thus every nonzero eigenvalue of $M^2$ has even multiplicity, the zero multiplicity has the parity of $n$, and the number of distinct eigenvalues is at most $n/2$ for even $n$ and $(n+1)/2$ for odd $n$. Distinct positive block parameters attain the bound, with one zero direction added when $n$ is odd.

Regard the real skew-symmetric matrix as acting on ${\mathbb{C}}^n$. Its Hermitian adjoint is $A^{\ast }=A^T=-A$. Parts (i) and (iii) show that its eigenvalues are purely imaginary and its complex minimal polynomial has no repeated roots.

Since $A$ has real entries, nonreal eigenvalues occur in conjugate pairs. A nonzero pair has the form $i\alpha ,-i\alpha$, with $\alpha >0$, and contributes the real quadratic polynomialZero, if present, contributes one factor $x$. Hence the real minimal polynomial isThe product annihilates $A$ after complexification of a real vector space, so it also annihilates the original real linear map; no factor can be removed because each displayed complex root is an eigenvalue. This proves both the asserted form and its minimality. The case $A=0$ has $\epsilon =1$ and an empty product.

The infinitesimal strain is $e_{ij}=(u_{i,j}+u_{j,i})/2$. A constant translation has zero gradient. For the remaining term, $u_i={ϵ}_{ikl}{\omega }_k{x}_l$ has $u_{i,j}={ϵ}_{ikj}{\omega }_k$, a skew-symmetric matrix. ThereforePhysically $\mathbf{a}$ is a translation and $\mathbf{\omega }\times \mathbf{x}$ is an infinitesimal rigid rotation, with axis along $\mathbf{\omega }$ and rotation angle $|\mathbf{\omega }|$. It is the linearized rotation displacement, not the exact displacement of a general finite rotation. This distinction matters because the infinitesimal strain omits quadratic displacement-gradient terms.

Write $V=H_0^1(\Omega ;{\mathbb{R}}^3)$. For any $v\in V$ and any real $t$, $u+tv$ is admissible. Expanding the functional givesSince the left side is nonnegative for positive and negative $t$, its derivative at zero vanishes. Thus the first variation gives the weak formulation

To identify its differential equation, define the stress tensorThis is a symmetric matrix field. The Frobenius inner product of a symmetric matrix with a skew-symmetric matrix is zero, so $\sigma (u):\nabla v=\sigma (u):\epsilon (v)$. Since $\mathrm{tr}\epsilon (v)=\mathrm{div}v$, we obtainFor smooth compactly supported test functions, integration by parts in each row givesHence $-\mathrm{div}\sigma (u)=f$ as a distributional identity, that is,Membership in $V$ supplies the zero Sobolev trace. This identifies precisely the required weak solution of the linear elasticity problem, with row-wise divergence.

For uniqueness, use the exact form of the Korn inequality supplied in the paper. Put $E=\epsilon (v)$ and $d=\mathrm{tr}E=\mathrm{div}v$. The deviatoric strain is $D=E-\frac{1}{3}dI$. Because $\mathrm{tr}D=0$ and $I:I=3$, orthogonality for the Frobenius inner product givesIf $C_K$ is the supplied Korn inequality constant and $K$ the permitted Poincaré inequality constant, thenConsequently,If $u_1,u_2$ are two weak solutions, their difference $d_u\in V$ satisfies $a(d_u,v)=0$ for every $v\in V$. Choosing $v=d_u$ and using this coercive bilinear form estimate forces $d_u=0$. The minimizer therefore gives the unique weak solution.

For later use, $|\epsilon (v){|}_F\le |\nabla v{|}_F$ and $|\mathrm{div}v|\le \sqrt{3}|\nabla v{|}_F$ also give the bounded bilinear form and linear functional estimatesTogether with the coercive bilinear form estimate and the Lax-Milgram theorem, these would establish existence independently of the assumed minimizer.

Let ${\rho }_3(P)=P\otimes P\otimes P$ act on the alternating coefficient tensor $\phi$, and setThe coefficient convention here is the one in the source's hint; using the usual covariant pullback gives the same stabilizer subgroup, since an invertible transformation preserves a differential form if and only if its inverse does. The identity matrix fixes $\phi$. If $P,Q$ fix it, then ${\rho }_3(PQ)\phi ={\rho }_3(P){\rho }_3(Q)\phi =\phi$. Multiplying ${\rho }_3(P)\phi =\phi$ by ${\rho }_3(P^{-1})$ shows that $P^{-1}$ fixes it as well. Thus $H$ is a subgroup of $SO(7)$. Its defining equations are polynomial, so it is closed and hence a Matrix Lie group.

For $P(t)=I+tT+O(t^2)\in H$, differentiating $P^{T}P=I$ gives $T^T=-T$. Differentiating the three factors in ${\rho }_3(P(t))\phi =\phi$ givesThe skew-symmetric matrix condition records the ambient special orthogonal group; it must be included when differentiating that group's definition.

These linear conditions are sufficient as well as necessary. On the tensor product, the infinitesimal action isIts three terms commute, so ${\rho }_3(e^{tT})=e^{tD(T)}$. If $D(T)\phi =0$, every positive power of $D(T)$ annihilates $\phi$, giving $e^{tD(T)}\phi =\phi$. Also $T\in \mathfrak{so}(7)$ implies $e^{tT}\in SO(7)$. Therefore $e^{tT}\in H$, proving the asserted Lie algebra description. For the given positive three-form this is the compact G2 Lie algebra ${\mathfrak{g}}_2$.