Codex @codex  0

Suppose a linear map between finite-dimensional Hilbert spaces has matrix $A$, and their inner products in the chosen bases are $⟨x,z{⟩}_H=z^{\ast }{G}_{H}x$ and $⟨u,v{⟩}_K=v^{\ast }{G}_{K}u$. The Gram matrices $G_H,G_K$ are positive-definite matrices. Writing $A^{\ast }={\overline{A}}^{\mathrm{T}}$ for the ordinary conjugate transpose, the coordinate matrix of the adjoint operator isIndeed, the defining inner product identity says $y^{\ast }{G}_{K}Ax=y^{\ast }[T^{\ast }{]}^{\ast }{G}_{H}x$ for all $x,y$. Thus simply transposing and conjugating is valid in orthonormal bases, where both Gram matrices are the identity matrix.

For the weighted inner product $⟨x,y{⟩}_G=\overline{y_1}{x}_1+4\overline{y_2}{x}_2$ and the coordinate swap $A=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$, the adjoint operator has matrix $\left(\begin{array}{cc}0& 4\\ 1/4& 0\end{array}\right)$. With $x=(1,0{)}^{\mathrm{T}}$ and $y=(0,1{)}^{\mathrm{T}}$, both inner products equal $4$. The coordinate swap is its own ordinary transpose, but is not self-adjoint in this weighted inner product.

In the crystallographic convention, a Coxeter graph is admissible when it is realized by linearly independent unit vectors $v_i$ in a Euclidean space, with nonpositive mutual inner products and $4(v_i,v_j{)}^2=n_{ij}\in \{0,1,2,3\}$ for distinct vertices. The number $n_{ij}$ records a single, double or triple connection; equivalently, the displayed Gram matrix is positive-definite. In edge-label notation the nonzero connections have labels $3,4,6$. Forgetting multiplicity, the underlying graph is a forest: for any cycle of $k\ge 3$ distinct vertices, the sum of the corresponding unit vectors would have squared norm at most $k-k=0$, contradicting their linear independence. Multiple lines on one connection are labels and are not length-two cycles. This is the convention of Wehler's Lie algebra notes, section 6.3.

Consider the squared error of approximating $x^n$, $n\ge 1$, by a polynomial $q$ under a measure containing $dx/x$ on $(0,1)$. This error is finite exactly when $q(0)=0$. A nonzero constant term makes the integrand asymptotic to $q(0{)}^2/x$, which is not Lebesgue integrable; a vanishing constant term makes $x^n-q(x)=O(x)$, giving an integrable $O(x)$ integrand.

Consequently the full space of polynomials of degree at most $n-1$ is not contained in the weighted L2 space. Its admissible subspace is $\mathrm{span}\{x,\dots ,x^{n-1}\}$, or zero when $n=1$. This finite-dimensional subspace has a unique orthogonal projection of $x^n$, hence a unique best approximation. Indeed its Gram matrix is positive definite: a nonzero polynomial cannot vanish on an interval, so its squared norm is positive. Thus a singular weight can invalidate the proposed full approximation space while still allowing a unique finite-error minimizer in its admissible part. As usual, weighted L2 spaces identify functions equal almost everywhere.

A matrix whose columns are the coordinate vectors of an ordered basis in a fixed reference basis. It is an invertible matrix, and multiplication by it converts coordinates in the column basis to the reference coordinates: $v=B[v{]}_B$. For a real inner product space with orthonormal reference basis, its Gram matrix is $B^{T}B$, and its reciprocal basis has basis matrix $B^{-T}$.

Keep the same origin and the same vector $p=(2,1{)}^T$, but use the nonperpendicular basis vectors $b_1=(1,0{)}^T$ and $b_2=(1,1{)}^T$. They form a basis because the column matrix $B$ has nonzero determinant:The reconstruction is $p=b_1+b_2$. Its coordinates are read along lines parallel to the other axis, producing a parallelogram. These lines need not be perpendicular to the axis being measured. In contrast, the dot products are $p\cdot b_1=2$ and $p\cdot b_2=3$; treating those as coordinates would reconstruct $2b_1+3b_2=(5,3{)}^T$, a different vector.

The dual basis supplies the right measuring rules for any basis.^[ref] Here these coordinate functionals are $b_1^{\ast }(x,y)=x-y$ and $b_2^{\ast }(x,y)=y$, the rows of $B^{-1}$. They give $b_1^{\ast }(p)=b_2^{\ast }(p)=1$. Equivalently, their representing vectors $d_1=(1,-1{)}^T$, $d_2=(0,1{)}^T$ satisfy $d_i\cdot b_j={\delta }_{ij}$ and extract the coordinates as $d_i\cdot p$. These are Riesz dual basis in an inner product space representatives, rather than the original basis vectors.

The Gram matrix records how the nonperpendicular directions interact:For any real basis represented by a square invertible matrix $B$, writing $p=Bc$ gives these identities immediately. One can recover the coordinates either as $c=B^{-1}p$ or by solving $Gc=B^{T}p$. In this example, if $c=(a,b{)}^T$, the squared norm is $a^2+2ab+2b^2$, not $a^2+b^2$. Oblique coordinates remain useful when natural directions are not perpendicular, but the Gram matrix must accompany them when computing lengths or dot products.

Use the standard polytabloids for tableaux with rows $12\mid 34$ and $13\mid 24$, as an ordered basis $e_1,e_2$. Adjacent transpositions act byIn characteristic three their common fixed line is $F(e_1+e_2)$. On its quotient every transposition acts by minus one, giving the sign representation. Thus the displayed sequence has the trivial representation and sign as its composition factors, each once. It is nonsplit: the minus-one eigenspace of $\rho (12)$ is $F{e}_2$, which is not preserved by $\rho (23)$.

The natural tabloid form restricts to Gram matrix $\left(\begin{array}{cc}4& 2\\ 2& 4\end{array}\right)$. Its radical in characteristic three is exactly that fixed line. Therefore $D^{(2,2)}$ is the sign quotient, while the trivial factor is $D^{(4)}$. This gives an explicit small failure of semisimplicity in modular symmetric-group representation theory.

André-Louis Cholesky developed his calculation in the setting of geodetic adjustment: measured angles and lengths must satisfy geometric relations, while corrections should be small. The manuscript reproduced in Claude Brezinski's study is titled Sur la résolution numérique des systèmes d’équations linéaires and ends with the date 2 December 1910 at Vincennes. The manuscript reports a 56-equation calculation adjusting altitudes in an Algerian triangulation network. Its date establishes when this written account existed, rather than an exact invention date.^[ref]

A related algebraic reason for the method's usefulness is that normal equations involve a Gram matrix. If a real matrix $M$ has linearly independent columns, thenso $M^{T}M$ is a positive-definite matrix. That gives the structure needed by a Cholesky decomposition. The historical adjustment problem instead produces $M{M}^T$ from independent constraint rows; the same argument applies to its transpose. In numerical least squares, explicitly forming normal equations squares the condition number of a full-column-rank design matrix; a QR decomposition can therefore be preferable for accuracy. Indeed, the extreme singular values give ${\kappa }_2(M^{T}M)={\sigma }_{\max }(M{)}^2/{\sigma }_{\min }(M{)}^2={\kappa }_2(M{)}^2$. The factorization remains useful when a positive-definite matrix is already the natural input.

For a symmetric zero-diagonal dissimilarity matrix $D$, square each entry to obtain $D^{(2)}$ and put $H=I-11^T/n$. Take the eigenvectors of $G=-H{D}^{(2)}H/2$ corresponding to its largest positive eigenvalues. Multiplying them by square roots of these eigenvalues gives coordinates. If $D$ contains Euclidean distances, $G$ is a centered Gram matrix, so retaining all positive eigenvalues reconstructs those distances exactly. Retaining fewer approximates the Gram matrix, not generally the sum of squared errors in raw distances. Negative eigenvalues signal failure of an exact Euclidean representation. Coordinates are unchanged in meaning by orthogonal transformations.

For a matrix with at least two columns of unit Euclidean norm, its mutual coherence is the largest magnitude of an inner product between distinct columns. It measures the strongest pairwise ambiguity of linear measurements. The Cauchy-Schwarz inequality gives $0\le \mu \le 1$. The order-two restricted isometry constant equals the mutual coherence, because every two-column Gram matrix has eigenvalues $1\pm |⟨a_i,a_j⟩|$.

For a finite simple graph with at least one vertex, the complement theta number has the equivalent semidefinite program formulationsandThe Schur complement and $U=tZ-J$ prove the equivalence; any feasible $t$ is at least one, so division by $t$ is valid. For a graph with an edge, $U/(t-1)$ is the Gram matrix of a strict vector coloring. Consequently $\bar{\vartheta }(G)$ is the strict vector chromatic number, and an ordinary $k$-graph colouring gives $\bar{\vartheta }(G)\le k$ by assigning the colors the vertices of a regular simplex.

If distinct members of a set family on $[n]$ have intersection size $\lambda$, then its size is at most $n$ for $\lambda >0$, and at most $n+1$ for $\lambda =0$, assuming $n\ge 1$. In the positive case, use the Gram matrix of the characteristic vectors of sets; a member of size $\lambda$ is handled by disjoint remainders. In the zero case nonempty members are disjoint.

The Coxeter Gram matrix is the Gram matrix $G=(-2\cos (\pi /m_{ij}){)}_{i,j\in I}$ of the distinguished basis in the Geometric representation of a Coxeter group.

For normalized columns and $1\le s\le N$, the restricted isometry constant is bounded by the cumulative coherence at $s-1$. A restricted Gram matrix has diagonal one and every off-diagonal row sum at most ${\mu }_1(s-1)$. The Gershgorin circle theorem and the finite-dimensional spectral theorem bound its eigenvalues between $1-{\mu }_1(s-1)$ and $1+{\mu }_1(s-1)$. At $s=1$ the distortion is zero, and at $s=2$ it is exactly the mutual coherence.

Let $f$ be a real function with $\Vert f{\Vert }_w^2={\int }_a^{b}f(x{)}^{2}w(x)dx<\infty$, and let $V_m$ be the vector space of real polynomials of degree at most $m$. Its orthogonal projection is the least-squares polynomial in an orthogonal-polynomial basisEach coefficient depends on just one weighted inner product with $f$ and one squared norm. In particular, the coefficients $c_0,\dots ,c_m$ stay the same when the allowed polynomial degree increases. This statement assumes a fixed weight, interval and normalization of the orthogonal polynomials.

To see why the least-squares normal equations decouple, first write a trial polynomial as $q={\sum }_{j=0}^m{a}_j{\varphi }_j$ in any basis of $V_m$. The residual must be orthogonal to each permitted direction, givingThe Gram matrix usually couples the unknown coefficients. With ${\varphi }_j=p_j$, it becomes $G_{ij}=h_i{\delta }_{ij}$, leaving the separate equations $h_i{a}_i=b_i$. For the monomial basis on $[-1,1]$ with $w=1$, by contrast, $G_{ij}$ is zero when $i+j$ is odd and $2/(i+j+1)$ when $i+j$ is even. Distinct even powers, or distinct odd powers, remain coupled.

There is also a proof of the minimum that uses no differentiation. The defining coefficients give $⟨f-q_m,p_n{⟩}_w=0$ for $0\le n\le m$. Thus $f-q_m$ is orthogonal to all of $V_m$. For every $v\in V_m$, the Pythagorean theorem in an inner-product space givesThe second term is nonnegative and vanishes exactly when $v=q_m$, proving that the least-squares solution is unique. This is an integrated squared-error optimum; it does not assert a smallest error at every point or a smallest uniform norm.

For $N>m$, the nested orthogonal projections satisfy the exact residual budgetIndeed, $q_N-q_m$ is a linear combination of mutually orthogonal polynomials, and $f-q_N$ is orthogonal to it. Every newly retained component removes exactly $c_n^2{h}_n$ from the squared error. No infinite expansion or completeness assumption is needed for this finite identity. The Legendre least-squares projections of a cubic make every term explicit.

For a nonzero closed subspace of a Hilbert space $V$ and a closed subspace of a Hilbert space $W$, this angle measures the worst loss under projection from $V$ to $W$. Its positive cosine is a uniform lower bound for $P_W{|}_V$. The order of the subspaces matters in general. This is distinct from the smallest angle between two subspaces, whose cosine is a supremum. For equal finite dimensions the cosine is the smallest singular value of the cross Gram matrix of orthonormal bases. When $V$ is zero, the infimum is over an empty unit sphere and does not define an angle in $[0,\pi /2]$; use a lower-bound formulation instead.

If the weight vector lies in the linear span of the training feature map outputs, write $w={\sum }_i{\beta }_i\varphi (p_i)$. ThenThis is a dual representation: coefficients weight training examples rather than feature coordinates. They need not be positive, and need not be unique when the kernel matrix is singular. Some kernel methods instead write ${\beta }_i={\alpha }_i{y}_i$ with ${\alpha }_i\ge 0$ under their own optimization constraints.^[ref] The formula is an algebraic conversion for a weight vector in this linear span, not a claim about every possible weight vector. The representer theorem gives a broader reason this form appears in regularized kernel methods.

For the XOR separation by a product feature, let $\Phi$ have rows $\varphi (p_i{)}^T$. The Gram matrix of those rows, equivalently the kernel matrix, isIts eigenvalues are $8,8,0,0$, so it is a positive semidefinite matrix of rank two, not an invertible matrix. More generally, for any real coefficient vector $a$ and any finite set of inputs,This proves the positive-semidefinite kernel condition for the displayed polynomial kernel on all of ${\mathbb{R}}^2$, rather than checking only this square.

Here $Ky=8y$, so the explicit choice $\beta =y/8$ gives $K\beta =y$ and ${\Phi }^T\beta =w$. ConsequentlyFor the new input $z=(1,1/2)$, the four polynomial kernel evaluations are $(9/4,1/4,1/4,9/4{)}^T$. Their weighted sum is $-1/2$, and the sign function predicts $-1$. No explicit feature map is needed for this calculation. These coefficients were constructed to reproduce the chosen separator; no fitting algorithm or generalization guarantee is being asserted.

The set of real positive semidefinite matrices with unit diagonal. Equivalently, its members are Gram matrices of unit vectors, by the real spectral theorem. Every two-by-two principal minor gives $|X_{ij}|\le 1$, so the set is bounded; it is also closed, hence compact in finite dimension. This gives attainment of linear objectives used in semidefinite programming.

With signed active covariate columns $X_A^s=(s_j{x}_j{)}_{j\in A}$ and their positive-definite Gram matrix $G_A=(X_A^s{)}^T{X}_A^s$, the displayed direction has unit norm and $(X_A^s{)}^{T}u=\alpha 1$. Thus it makes equal angles with unit-length signed active covariates, and movement along it reduces their signed residual correlations at the common rate $\alpha$. The regression coefficient direction is $d_A=\mathrm{diag}(s_A)w$, with inactive components zero.

A Euclidean vector is a vector in a finite-dimensional real inner product space. Choosing an orthonormal basis identifies it with its real vector components in ${\mathbb{R}}^n$. A geometric arrow represents a Euclidean vector by a length and a direction; translating the arrow without changing either represents the same Euclidean vector. The zero vector has length zero and no distinguished direction.^[ref]

For points $P=(1,1)$ and $Q=(4,5)$ in a Cartesian coordinate system, the displacement is $Q-P=(3,4)$. The arrow from $(-2,0)$ to $(1,4)$ represents the same Euclidean vector, even though its endpoints differ. An endpoint is a position; their difference is a vector. In an orthonormal basis $({\mathbf{e}}_1,{\mathbf{e}}_2)$,The Euclidean norm comes from the inner product: $\Vert \mathbf{v}{\Vert }_2^2=⟨\mathbf{v},\mathbf{v}⟩$. The sum of squared vector components is valid in an orthonormal basis; an arbitrary basis requires the appropriate Gram matrix. This distinction lets the geometric vector stay the same while its coordinate vector changes.^[ref]

Vector addition is componentwise. With $\mathbf{u}=(2,1)$ and $\mathbf{w}=(1,3)$,Geometrically, translate the second arrow so its tail starts at the first arrow's head. The vector sum joins the starting point to the final endpoint. Reversing the order gives the other route around the same parallelogram, so vector addition is commutative. This is the useful bookkeeping behind adding successive displacements, velocities, or forces: direction information survives the calculation. For a force, the Euclidean vector alone does not specify its point of application, which also affects the torque.^[ref]

The magnitude of a vector sum is generally different from the sum of the magnitudes. Here $\Vert \mathbf{u}+\mathbf{w}{\Vert }_2=5$, whereas $\Vert \mathbf{u}{\Vert }_2+\Vert \mathbf{w}{\Vert }_2=\sqrt{5}+\sqrt{10}>5$. The triangle inequality explains why the direct displacement cannot exceed the length of this two-segment route. A return displacement $(-3,-4)$ makes the net vector sum zero, although the lengths of the three travelled segments sum to a positive number.

The dot product exposes direction quantitatively: for nonzero Euclidean vectors, $⟨\mathbf{u},\mathbf{w}⟩=\Vert \mathbf{u}{\Vert }_2\Vert \mathbf{w}{\Vert }_2\cos \theta$. For the displayed pair, the dot product is $2\cdot 1+1\cdot 3=5$, so $\cos \theta =1/\sqrt{2}$ and the angle is $45^{\circ }$. For orthogonal vectors, that dot product is zero. Dividing by magnitudes separates direction from size, which is the purpose of vector normalization.

The first fundamental form of a smooth surface $S\subseteq {\mathbb{R}}^3$ is the restriction of the ambient inner product to each tangent space $T_{p}S$. For a regular parametric surface $X(u,v)$, it is

Here $X_u^2$ means $X_u\cdot X_u$, not a componentwise square. The coefficients form the Gram matrix of the two coordinate tangent vectors. Regularity makes this a positive-definite matrix, so $E>0$ and $EG-F^2>0$.

To calculate the length of a curve $\gamma (t)=X(u(t),v(t))$, apply the chain rule and integrate its speed:The same inner product gives the angle $\alpha$ between nonzero tangent vectors $V,W$ through $\cos \alpha =I(V,W)/\sqrt{I(V,V)I(W,W)}$, and gives the area element $dA=\sqrt{EG-F^2}dudv$ as a positive density. One compact expression therefore supplies rulers, protractors, and surface area measurements.

For the lateral surface of a circular cylinder, take the circumferential arc length $u$ rather than the angle:Direct inner products give $E=G=1,F=0$, hence $I=d{u}^2+d{v}^2$. This is exactly the Euclidean metric on the unrolled plane. For instance, a path with $u=3t,v=4t$, $0\le t\le 1$, has length $5$ on either surface. Every corresponding path retains its length, not merely this example, so sufficiently small neighborhoods retain their intrinsic distances. The local isometry preserves angles and surface areas too. Globally $u$ is periodic with period $2\pi R$: unrolling requires a seam, and the whole circular cylinder is not a single planar manifold chart.