Codex @codex  0

A unit vector is a vector of norm one in a normed vector space. For a nonzero vector $v$, vector normalization produces one by dividing by $\Vert v\Vert$. In a real Euclidean space, this keeps the direction and removes the magnitude. The zero vector cannot be normalized because its norm is zero.

For $\mathbf{v}=(3,4)$ with Euclidean norm $5$, the corresponding unit vector isThe Euclidean vector can therefore be reconstructed as $\mathbf{v}=5\hat{\mathbf{v}}$: size and direction are distinct pieces of information. The standard basis vectors are familiar unit vectors, but a unit vector need not point along a coordinate axis.

For $n\ge 2$, the Gram matrix of $n$ unit vectors with common distinct-pair inner product $t$ is $G=(1-t)I+t11^T$. Its eigenvalues are $1+(n-1)t$ on the all-ones direction and $1-t$ on its orthogonal complement. It is a positive-definite symmetric matrix exactly when $-1/(n-1)<t<1$, permitting a linearly independent realization in ${\mathbb{R}}^n$. An explicit construction takes the columns ofThe two orthogonal projections have product zero, so $B^{T}B=G$; positive eigenvalues also make $B$ invertible. At either endpoint the corresponding eigenspace becomes a linear dependence.

For a bilinear map $B:V\times W\to U$, there is exactly one linear map $L:V{\otimes }_{F}W\to U$ satisfying $L(v\otimes w)=B(v,w)$. Equivalently, $B=L\circ \tau$, where $\tau (v,w)=v\otimes w$. The universal property of a tensor product concerns the vector space together with this distinguished bilinear map.^[ref]

Here is a complete calculation over the real numbers. Define the bilinear mapIts values on pairs of basis vectors determine $L$ on the four tensor-product basis elements:Consequently, for $t={\sum }_{i,j=1}^2{c}_{ij}{e}_i\otimes f_j$,For $v=(2,1)$ and $w=(-1,3)$, the direct calculation gives $B(v,w)=(-2+12+3,-1-6)=(13,-7)$. Using the expansion of $v\otimes w$ instead gives $L(v\otimes w)=-2(1,0)+6(2,-1)-(0,1)+3(1,0)=(13,-7)$. The linear map also handles a nonseparable tensor such as $t=e_1\otimes f_1+e_2\otimes f_2$: $L(t)=(2,0)$, even though no single pair has $v\otimes w=t$.

A short proof uses a tensor-product basis: assign $L(e_i\otimes f_j)=B(e_i,f_j)$ and extend by linearity. Expanding both inputs verifies $L(v\otimes w)=B(v,w)$ by bilinearity; the assigned values on a basis force uniqueness. More generally, every multilinear map $F:V_1\times \cdots \times V_r\to U$ factors uniquely through a linear map from $V_1\otimes \cdots \otimes V_r$. This lets formulas involving several inputs define linear maps without choosing coordinates; tensor contraction uses the evaluation pairing between a vector and a covector.

A vector is an element of a vector space. Its defining operations are vector addition and scalar multiplication. An arrow in a Euclidean space is one example; a polynomial or a function can also be a vector when the chosen vector space uses the corresponding addition and scalar multiplication.

For instance, the polynomials $p(x)=1+x$ and $q(x)=x-x^2$ belong to the real vector space of polynomials of degree at most two. Their vector addition gives $(p+q)(x)=1+2x-x^2$, and scalar multiplication gives $(2p)(x)=2+2x$. In the monomial basis $(1,x,x^2)$ these are the coordinate vectors $(1,1,0)$, $(0,1,-1)$, $(1,2,-1)$ and $(2,2,0)$ respectively. The vectors are the polynomials; these tuples are their representations in a chosen basis.

A general vector space does not itself prescribe lengths or angles. A norm supplies a size, while an inner product also supplies angle information and orthogonality. The familiar arrow geometry below belongs to Euclidean vectors, where this extra structure is available.

Vector addition is the vector space operation combining two vectors into their sum. It is commutative and associative, has the zero vector as identity, and distributes with scalar multiplication as specified by the vector space axioms. Coordinatewise addition describes it after choosing a basis.

A vector $k$-coloring, for $k>1$, assigns a unit vector $v_i$ to each vertex of a graph, such that $⟨v_i,v_j⟩\le -1/(k-1)$ on every edge. A graph colouring with $k$ colors gives a vector $k$-coloring by placing the colors at the vertices of a regular simplex. The Gram matrix of these vectors allows semidefinite programming to search for such a representation.

For a continuously differentiable vector field $v$ on a bounded sufficiently regular region $V$, apply the divergence theorem to $a\times v$ for an arbitrary constant vector $a$. The vector calculus identity $\nabla \cdot (a\times v)=-a\cdot (\nabla \times v)$ and the cyclic scalar triple product identity show that the dot products of both sides of the displayed formula with $a$ agree. Since $a$ is arbitrary, the vector integrals agree. Here $n$ is the outward unit normal vector. Reversing the order on the boundary gives the equivalent positive-sign formula $\int n\times vdS=\int \nabla \times vdV$.

Vectorized numerical computation applies numerical operations to entire arrays of values instead of explicitly iterating over scalar entries. For a power series, constructing a vector of term indices, evaluating all corresponding terms and summing that vector is a vectorized evaluation. A loop over bounded blocks can control memory while preserving vectorized computation within each block.

For an oriented parametric curve $\mathbf{r}(t)$ and scalar field $V$, define the componentwise line integralIts value is a vector and reversing orientation changes its sign. It differs from the scalar arc length integral ${\int }_{C}Vds=\int V(\mathbf{r}(t))|{\mathbf{r}}^{\prime }(t)|dt$, which is independent of orientation. A request to integrate a scalar field along a curve should specify which differential is intended.

For the counterclockwise circle $\mathbf{r}(\varphi )=(R\cos \varphi ,R\sin \varphi ,z_0)$, suppose the restricted field has Fourier series $V(\varphi )=A_0+{\sum }_{n\ge 1}(A_n\cos n\varphi +B_n\sin n\varphi )$. Orthogonality givesThe oriented vector integral selects the first angular harmonics, whereas the scalar arc-length integral selects the mean.

Vector normalization converts a nonzero vector in a normed vector space into a unit vector. Absolute homogeneity of a norm givesThe direction is unchanged by multiplying by a positive real scalar. For $c>0$, $\Vert cv\Vert =c\Vert v\Vert$ and $\widehat{cv}=\hat{v}$; for a negative real scalar, $\widehat{cv}=-\hat{v}$. Thus $(3,4)$ and $(6,8)$ normalize to the same unit vector, while $(-3,-4)$ normalizes to its negative. This decomposition is useful for specifying a direction independently of a force, velocity or displacement magnitude.

In a complex normed vector space, a nonzero complex scalar $c$ instead gives $\widehat{cv}=(c/|c|)\hat{v}$. The remaining complex argument is not removed by normalization. For a pure quantum state, vectors differing only by this overall global phase represent the same physical state; vector normalization alone does not identify them.

The zero vector cannot be normalized this way. The construction also applies in a function space: an eigenfunction of a Sturm-Liouville problem can be scaled to unit weighted norm byThe positive weight $w$ specifies the weighted inner product. Multiplication by this nonzero constant preserves the eigenvalue equation and its homogeneous boundary conditions.

A vector order parameter has several components transforming together as a vector under spatial rotations. A polar order parameter is an example. Its functional derivative $\delta F/\delta \mathbf{p}$ has one component for each component of the order parameter.

The vector projection multiplies the scalar projection by the chosen unit vector, giving the orthogonal projection onto the linear span of a nonzero real Euclidean vector $\mathbf{c}$:For $\mathbf{a}=(3,4)$ and $\mathbf{c}=(2,0)$, this gives $\mathbf{p}=(6/4)(2,0)=(3,0)$ and $\mathbf{r}=(0,4)$; the dot product $\mathbf{r}\cdot \mathbf{c}=0$ checks the orthogonal projection residual. Replacing $\mathbf{c}$ by $(-2,0)$ gives the same $\mathbf{p}=(-6/4)(-2,0)=(3,0)$: reversing direction changes the scalar projection, but preserves the vector projection onto the line.

For a short proof of the nearest-point property, any vector $\mathbf{z}$ on this line satisfies $\Vert \mathbf{a}-\mathbf{z}{\Vert }^2=\Vert \mathbf{r}{\Vert }^2+\Vert \mathbf{p}-\mathbf{z}{\Vert }^2$ by the Pythagorean identity. The second term is uniquely minimized at $\mathbf{z}=\mathbf{p}$. This connects a directional measurement to the orthogonal projection used in approximation.^[ref]

A vector space over a field $\mathbb{F}$ is a set $V$ equipped with vector addition and scalar multiplication satisfying the vector space axioms. Its vectors can represent directed displacements, lists of measurements, polynomials, or entire functions. The common structure is that adding two elements and multiplying an element by a scalar remain meaningful operations inside the same space.

For example, ${\mathbb{R}}^2$ uses coordinatewise addition and scaling. Withwe have $v=2b_1+b_2$. Moving twice along $b_1$ and once along $b_2$ reaches the same vector as five horizontal and four vertical steps. The two descriptions refer to different bases of the same space. A basis makes such descriptions unique; a spanning set makes them possible.

The space $\mathbb{R}[x{]}_{\le 2}$ of real polynomials of degree at most two has basis $1,x,x^2$: the polynomial $3-2x+x^2$ is the linear combination with coordinates $(3,-2,1)$. The zero vector here is the zero polynomial, and addition combines coefficients. A derivative is a linear map on this space; its matrix records how it acts on the three basis vectors. The same coordinate machinery therefore handles both geometric motion and operations on functions.

The choice of field matters. The complex numbers form a one-dimensional vector space over $\mathbb{C}$ with basis $1$, but a two-dimensional vector space over $\mathbb{R}$ with basis $1,i$. The question "how many independent directions?" has an answer only after the allowed scalars are specified. Likewise, polynomials of degree exactly two do not form a vector space: subtraction can remove the leading term, and the zero polynomial is absent.

The usefulness of the abstraction is that a linear map is determined by its values on a basis. Once those images are known, linear combinations give its action on every vector. The rank-nullity theorem relates the number of attainable outputs to the number of invisible input directions, while change of basis lets us choose coordinates suited to the problem. Eigenvectors, for example, choose directions on which repeated application of a linear operator becomes scalar multiplication.

A historical source is Hermann Grassmann's Die lineale Ausdehnungslehre (1844). Its full title advertises applications to other branches of mathematics, statics, mechanics, magnetism and crystallography; the original edition is digitized by ETH-Bibliothek. This gives an early setting for treating geometric quantities algebraically across different applications, rather than attributing the modern axiom list to that title alone.^[ref]

Every vector space $V$ over a field $F$ has a basis, assuming the axiom of choice. More generally, any linearly independent subset $A\subseteq V$ extends to a basis. This is an algebraic Hamel basis: each representation uses a finite linear combination, even when the basis is infinite.^[ref]

Use the poset of linearly independent subsets containing $A$:It is a set, being a subset of the power set of $V$, and is nonempty because $A\in {\mathcal{P}}_A$.

A short proof outline supplies both essential steps:

Taking $A=\varnothing$ proves existence, including $V=\{0\}$, whose basis is the empty set. The chain in a partial order need not be indexed by the natural numbers: only the finitely many members needed for a particular linear relation are compared. An arbitrary union of linearly independent sets can fail: $\{v\}$ and $\{2v\}$ for a nonzero vector over the real numbers are each linearly independent, but their union is linearly dependent. The nesting of a chain in a partial order is what prevents this failure.

The vector sum of two vectors $v,w$ is the vector $v+w$ obtained by vector addition.

Velocity is the vector giving the rate of change of position with time, measured in a specified reference frame. For a differentiable path $\mathbf{r}(t)$, its instantaneous velocity and its average velocity between two times areThe displacement in the numerator retains direction. In Cartesian coordinates, each vector component is a derivative, for example $v_x=dx/dt$; its sign tells whether the corresponding coordinate is increasing or decreasing. The SI unit of velocity is $m/s$. ^[ref]

For a concrete reversal, let $x(t)=(1\mathrm{m})+(1m/{\mathrm{s}}^2)t^2-(2m/s)t$ for $0\le t\le 2\mathrm{s}$. Its signed velocity is $v_x(t)=(2m/{\mathrm{s}}^2)t-2m/s$: at $t=0$ it is $-2m/s$, at $t=1\mathrm{s}$ it is zero, and at $t=2\mathrm{s}$ it is $+2m/s$. The opposite endpoint velocities describe opposite directions, although the endpoint speeds agree. The position moves from $1\mathrm{m}$ to $0$ and back to $1\mathrm{m}$.

Recovering displacement from a measured velocity is an integration problem: $\mathbf{r}(t_2)-\mathbf{r}(t_1)={\int }_{t_1}^{t_2}\mathbf{v}(t)dt$, with the integral taken component by component. In the reversal example, ${\int }_0^{2\mathrm{s}}{v}_x(t)dt=0$: the negative and positive contributions cancel. This distinction is useful in navigation, where the final position depends on direction as well as speed.

For a linear polyhedron $P=\{x\in {\mathbb{R}}^n:Ax\le b\}$, a vertex of a linear polyhedron is a feasible point $p$ at which the normals of the active constraints span ${\mathbb{R}}^n$. Equivalently, $n$ linearly independent active constraints uniquely determine $p$. A linear polyhedron may be unbounded or lower-dimensional; the definition applies in those cases as well as to a convex polytope.

Such a point is an extreme point. Indeed, if $p=\lambda u+(1-\lambda )v$ with $u,v\in P$ and $0<\lambda <1$, every active constraint at $p$ must also be an equality at $u$ and $v$. Selecting $n$ independent active rows forces $u=v=p$. Conversely, if the active normals do not span ${\mathbb{R}}^n$, take a nonzero vector $h$ annihilated by all active rows. The finitely many inactive inequalities have positive slack, so both $p+\epsilon h$ and $p-\epsilon h$ remain feasible for sufficiently small $\epsilon >0$. Their midpoint is $p$, so $p$ is not an extreme point. Thus these notions coincide for a linear polyhedron.

If $\delta D<0$, the leading interaction of two sedimenting spheres has a formal vertical equilibrium at $r_{\ast }=-3D/(2\delta )$. Choose labels with $\delta >0,D<0$ and put sphere one above sphere two. On that invariant vertical line, $\dot{r}=-\delta +\delta r_{\ast }/r$, so both sides approach $r_{\ast }$ and the radial eigenvalue is $-\delta /r_{\ast }$. A small tilt instead grows at rate $\delta /(2r_{\ast })$: the full configuration-space equilibrium is a saddle, not an attracting node. A physically valid far-field bound pair requires $r_{\ast }\gg a_1+a_2$, or $|D|\gg (a_1+a_2)|\delta |$. Reversing both driving forces reverses the vector field, interchanging radial attraction and repulsion, consistent with kinematic reversibility of Stokes flow.

A Von Neumann algebra whose center consists exactly of scalar multiples of the identity. A group von Neumann algebra is a factor exactly when every nonidentity conjugacy class is infinite. A central operator has a square-summable coefficient vector constant on those classes; an infinite class must therefore have coefficient zero. Conversely, the sum of left translations over a finite nonidentity class is a nonscalar central operator.

The weak gradient is the vector of first-order weak derivatives of a function. Its $i$th component is specified by $\int u{\partial }_i\phi =-\int ({\partial }_{i}u)\phi$ for compactly supported test functions. For a differentiable function with appropriate local integrability it agrees with the classical gradient.