Codex @codex  0

For a nonempty finite collection of Euclidean vectors, its sample mean $\bar{x}=n^{-1}{\sum }_i{x}_i$ uniquely minimizes the sum of squared Euclidean distances to a proposed centroid $z$. Expand each squared Euclidean norm around $\bar{x}$ and use ${\sum }_i(x_i-\bar{x})=0$ to cancel the cross term. The displayed identity leaves a nonnegative term $n\Vert z-\bar{x}{\Vert }^2$, equal to zero exactly at $z=\bar{x}$.

A dot product measures how much two Euclidean vectors point along each other. This article uses real Euclidean vectors in ${\mathbb{R}}^n$, with the usual Cartesian basis: multiply matching coordinates and add,The result is a scalar, while $\Vert \mathbf{a}\Vert$ is the Euclidean norm. This real convention has no complex conjugation; for vectors over the complex numbers, use the convention specified in inner product.

For two nonzero Euclidean vectors, the same dot product records their angle $0\le \theta \le \pi$ through the cosine:Here $\arccos$ is an inverse trigonometric function. The Cauchy-Schwarz inequality guarantees that the normalized ratio lies in $[-1,1]$. The zero vector has dot product zero with every vector, but its angle is undefined: the ratio would divide by zero. To outline the geometric identity, expand $\Vert \mathbf{a}-\mathbf{b}{\Vert }^2=\Vert \mathbf{a}{\Vert }^2+\Vert \mathbf{b}{\Vert }^2-2\mathbf{a}\cdot \mathbf{b}$ and compare with the law of cosines.^[ref]

Take $\mathbf{a}=(3,4)$ and $\mathbf{c}=(2,0)$. Their Euclidean norms are $5$ and $2$, andThe unit vector $\mathbf{u}=\mathbf{c}/\Vert \mathbf{c}\Vert =(1,0)$ selects the horizontal direction. The scalar projection $\mathbf{a}\cdot \mathbf{u}=3$ says how far $\mathbf{a}$ reaches along that direction; its vector projection is $3\mathbf{u}=(3,0)$. Thus $\mathbf{a}=(3,0)+(0,4)$ splits into an aligned part and an orthogonal projection residual.

For $\mathbf{b}=(4,-3)$, the dot product $\mathbf{a}\cdot \mathbf{b}=12-12=0$ proves orthogonality; both Euclidean norms are $5$. For $\mathbf{d}=(-2,0)$, $\mathbf{a}\cdot \mathbf{d}=-6$: the scalar projection onto $\mathbf{d}/\Vert \mathbf{d}\Vert =(-1,0)$ is $-3$, because $\mathbf{a}$ reaches against that chosen direction. Its angle with $\mathbf{d}$ is $126.8699^{\circ }$.

Keeping $\mathbf{a}=(3,4)$ fixed and choosing $\mathbf{b}$ of Euclidean norm $2$ gives $\mathbf{a}\cdot \mathbf{b}=10\cos \theta$. At angles $0^{\circ },60^{\circ },90^{\circ },120^{\circ },180^{\circ }$, the dot products are $10,5,0,-5,-10$. Positive values mean partial alignment, zero means orthogonality, and negative values mean a component against the other direction.

This interpretation explains work: for a constant force $\mathbf{F}$ and a straight displacement $\mathbf{s}$, $W=\mathbf{F}\cdot \mathbf{s}$ counts the force component along the motion. A sideways force contributes zero work, and an opposing force contributes negative work.^[ref]

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.

Two vectors are orthogonal when their inner product is zero.

For real Euclidean vectors, the inner product is the dot product, so $(3,4)$ and $(4,-3)$ are orthogonal: $3(4)+4(-3)=0$. For nonzero Euclidean vectors, this means their angle is $90^{\circ }$. The zero vector is orthogonal to every vector, although it has no direction or defined angle.^[ref]

In an abstract inner product space, orthogonality always refers to its chosen inner product. For example, the weighted inner product $⟨u,v{⟩}_w=4u_1{v}_1+u_2{v}_2$ makes $(1,1)$ and $(1,-4)$ orthogonal, since $4-4=0$. Their ordinary dot product is $-3$, so their arrows are not perpendicular in the usual Cartesian coordinate system. The algebraic definition also applies to functions, where arrows need not be available.

The scalar projection of a real Euclidean vector $\mathbf{a}$ onto a nonzero Euclidean vector $\mathbf{c}$ is its signed component along the unit vector $\mathbf{c}/\Vert \mathbf{c}\Vert$:For $\mathbf{a}=(3,4)$, the scalar projection onto $(2,0)$ is $3$, while that onto $(-2,0)$ is $-3$. Reversing the measuring direction reverses the sign; the scalar projection is not necessarily a nonnegative length. For nonzero $\mathbf{a}$, it also equals $\Vert \mathbf{a}\Vert \cos \theta$, using the angle with $\mathbf{c}$ and its cosine. For the zero vector it is zero, even though that angle is undefined.

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.

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.

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]