Codex @codex  0

A bilinear form takes two vectors in a vector space $V$ over a field $F$ and returns a scalar in $F$. Its defining property is separate linearity: holding either input fixed gives a linear functional of the other. For scalars $a,b$ and vectors $u,v,w$,This is a scalar-valued bilinear map; the chosen field is part of the definition.^[ref]

Separate linearity does not mean that $B$ is a linear map on the vector space $V\times V$ with componentwise vector addition and scalar multiplication. Over the real numbers, $B(2v,2w)=4B(v,w)$, whereas a linear map on the pair would give $2B(v,w)$. The simplest example is $B(x,y)=xy$ on the one-dimensional vector space $\mathbb{R}$: fixing $y=3$ gives $x\mapsto 3x$, but doubling both $x$ and $y$ quadruples their product.

A bilinear form measures how two inputs interact. The dot product measures alignment; a symmetric bilinear form can describe a quadratic form; an alternating bilinear form can measure signed area. A nondegenerate bilinear form turns each vector into a unique linear functional and so connects geometry with the dual space. The same short definition therefore supports lengths, bilinear orthogonal complements, and symplectic vector spaces, depending on the additional properties imposed.

Over the complex numbers, a bilinear form is linear in both inputs without conjugating either scalar. A Hermitian form instead is a sesquilinear form and conjugates when its inputs are exchanged. For complex matrices, the adjoint $A^{\ast }$ used with Hermitian forms and matrix C-star algebras is the conjugate transpose, whereas a bilinear form uses the ordinary transpose $A^T$. For example, $B(z,w)=zw$ has $B(i,i)=-1$, while the Hermitian form $H(z,w)=z\overline{w}$ has $H(i,i)=1$.^[ref]

A bond dipole represents the separation of positive and negative electric charge associated with a chemical bond. In a neutral two-point charge model put $+q$ at ${\mathbf{r}}_A$ and $-q$ at ${\mathbf{r}}_B$, with $q>0$. Its physical electric dipole moment isIf $B$ is the negative end, the physical electric dipole moment points from $B$ to $A$. The customary crossed-tail chemical arrow points towards the negative, more electronegative end, from $A$ to $B$. It therefore has the opposite direction. State the convention before doing vector addition; use physical electric dipole moments in the interaction potential energy $U=-\mathbf{p}\cdot \mathbf{E}$, where $\mathbf{E}$ is the electric field.^[ref]

For a fixed neutral molecule, its complete electric dipole moment follows from all atomic nuclei and the electron density, not just point charges assigned to sites. If $n(\mathbf{r})$ is the expected number of Electrons per unit volume, the corresponding charge density is ${\rho }_e(\mathbf{r})=-en(\mathbf{r})$; the nuclear terms contribute separately. Partitioning that distribution into bond dipoles is a model. Lone pairs and electric polarization within a chemical atom can contribute as well. A measured molecular electric dipole moment cannot uniquely recover every individual bond dipole or partial atomic charge.

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.

Linear algebra studies vector spaces and linear maps: operations that preserve vector addition and scalar multiplication. For a linear map $T$, the defining rule is $T(au+bv)=aT(u)+bT(v)$, where $u,v$ are vectors and $a,b$ belong to the underlying field. The vectors might be arrows, lists of measurements, or polynomials. What matters is that their linear combinations make sense and that the same rule governs their transformation.

A concrete linear map is $T(x,y)=(x+y,x-y)$. Its two outputs record a sum and a difference. Since $T(1,0)=(1,1)$ and $T(0,1)=(1,-1)$, we immediately obtain $T(2,1)=2(1,1)+(1,-1)=(3,1)$. Knowing the outputs of the basis vectors determines the output of every vector; a matrix stores exactly that information in its columns.

The attraction of linear algebra is that one small collection of ideas answers several different questions. A system of linear equations asks which inputs produce a prescribed output. The image of a linear map describes the attainable outputs, while the kernel describes the invisible input changes. A basis gives every vector an address, and change of basis lets us choose addresses that make a linear map easier to understand. This shared language turns a collection of separate calculations into a picture of what is possible and how much freedom remains. Gilbert Strang's MIT course emphasizes these connections and their usefulness across other disciplines.^[ref]

Let $V$ be a vector space over a specified field $F$, and let $v_1,\dots ,v_n\in V$. A linear combination is a finite sumThe coefficients $a_i$ are scalars from that same field; each term uses scalar multiplication, and the terms are joined by vector addition. For coefficients in the real numbers, negative values reverse arrows and fractional values scale them by fractional amounts. The collection of attainable vectors is the linear span. The column picture in Strang's MIT notes interprets solving a linear system as choosing coefficients to reach a target vector.^[ref]

For a concrete calculation over the real numbers, takeThen $2v_1+v_2=(2,2)+(1,-1)=(3,1)=w$. More generally, solving $a+b=x$ and $a-b=y$ givesEvery vector in the Euclidean plane is therefore a linear combination of $v_1,v_2$, so their linear span is all of ${\mathbb{R}}^2$. The target $(3,1)$ has coefficients $(2,1)$; the target $(0,2)$ has coefficients $(1,-1)$, since $(1,1)-(1,-1)=(0,2)$. The displayed formula also makes the coefficients unique. Consequently $(v_1,v_2)$ is an ordered basis, with coordinate vector $[(x,y){]}_{(v_1,v_2)}=((x+y)/2,(x-y)/2{)}^T$.

The payoff is a reusable language for synthesis: linear combinations build vectors from chosen ingredients, linear span decides which targets are reachable, and linear independence decides whether the coefficients are unique. The ingredients can also be polynomials or functions, as long as they belong to a vector space over the specified field.

The Minkowski sum of subsets $A,B$ of a vector space collects the result of vector addition for every possible pair:Think of fixing a point $b$ of $B$, making a translation of the whole of $A$ by $b$, and then taking the union of these copies over every $b\in B$. The points of $B$ specify displacement vectors; they need not be the centre of a shape. Minkowski addition applies to nonconvex sets too. It is different from set union: for $A=B=\{0,1\}$ on the real line, $A\cup B=\{0,1\}$ but $A+B=\{0,1,2\}$.

For axis-aligned rectangles in the Euclidean plane, the coordinate intervals add separately:Every coordinate between $0$ and $a+c$ can be split into one coordinate in $[0,a]$ and another in $[0,c]$, and likewise for the vertical coordinate. Thus a $2\times 1$ rectangle plus a $1\times 2$ rectangle gives a $3\times 3$ square of area $9$, although the two input areas total only $4$. The Minkowski sum adds possible displacements, so its area need not be the sum of input areas.

For closed Euclidean disks $D_r=\{x\in {\mathbb{R}}^2:\Vert x\Vert \le r\}$ centred at the origin, the triangle inequality gives $D_r+D_s\subseteq D_{r+s}$. Conversely, if $r+s>0$, split any $x\in D_{r+s}$ as $x=rx/(r+s)+sx/(r+s)$. Therefore $D_r+D_s=D_{r+s}$, including the case $r=s=0$. Disks of radii $1$ and $2$ give a disk of radius $3$, with areas $\pi ,4\pi ,9\pi$. For disks with centres $u,v$, the resulting centre is $u+v$. These two examples lead to the root-of-area comparison in the Brunn-Minkowski theorem.

Minkowski addition is commutative and associative because vector addition is. Its identity is the singleton $\{0\}$, and $A+\varnothing =\varnothing$. For displacement vectors $u,v$ and $t>0$, translations and uniform dilations satisfywhere $tA=\{ta:a\in A\}$ uses scalar multiplication. A Minkowski sum of convex sets is convex: a line segment between $a_1+b_1$ and $a_2+b_2$ is obtained by adding the corresponding points of the line segments in $A$ and $B$. Closure requires care; see sum of two closed sets need not be closed and sum of a compact set and a closed set.

For vectors $u,v\in {\mathbb{R}}^n$ or ${\mathbb{C}}^n$, counting measure turns the Minkowski inequality intoFor $p=\infty$, replace each displayed norm by the maximum of its coordinate absolute values. Take $u=(1,0)$ and $v=(0,1)$. Both vectors have Lp norm one for every $p\ge 1$, but their sum has L1 norm $2$, Euclidean norm $\sqrt{2}$, and L-infinity norm $1$. Thus the same vector addition gives equality $2=1+1$ at $p=1$, strict inequality $\sqrt{2}<1+1$ at $p=2$, and strict inequality $1<1+1$ at $p=\infty$.

By contrast, $u=(1,1)$ and $v=2u=(2,2)$ give equality for every $p\ge 1$: absolute homogeneity of a norm yields $\Vert u+v{\Vert }_p=3\Vert u{\Vert }_p=\Vert u{\Vert }_p+\Vert v{\Vert }_p$. At $p=2$, the three sizes are $\sqrt{2}$, $2\sqrt{2}$, and $3\sqrt{2}$. Opposite vectors behave very differently: $u+(-u)=0$, so the inequality is strict whenever $u$ is nonzero. Cancellation is allowed; the bound describes the largest possible total size.

Molecular dipole cancellation occurs when nonzero contributions to a molecule's electric dipole moment cancel under vector addition. In a bond dipole model, use ${\mathbf{p}}_{\mathrm{mol}}={\sum }_b{\mathbf{p}}_b$; adding magnitudes instead discards the molecular geometry. A symmetric linear molecule with two equivalent opposed bond dipoles has ${\mathbf{p}}_1=p_0\hat{\mathbf{x}}$ and ${\mathbf{p}}_2=-p_0\hat{\mathbf{x}}$, hence zero total electric dipole moment even though each chemical bond is polarized. Carbon dioxide provides the familiar molecular example; water's bent molecular geometry permits a nonzero total.^[ref]

For an original geometry calculation, give a fictitious three-site model $A{B}_2$ a central effective electric charge $+2q$ at the origin and two terminal electric charges $-q$ atHere $r$ is the stipulated bond length, $\theta$ the angle between the two connections, and $q>0$ is independent of any electronegativity scale. Equivalently, split the central $+2q$ into two colocated $+q$ contributions, one for each neutral bond dipole. With $p_0=qr$, the physical electric dipole moments point from the terminal sites towards the central site:The sideways components cancel; the components along the angle bisector add. Thus $|{\mathbf{p}}_{\mathrm{mol}}|=2p_0\cos (\theta /2)$. At $\theta =180^{\circ }$ the result is zero; at the stipulated $\theta =120^{\circ }$ it is exactly $p_0$. This is an angle example for a model, not the measured angle or electric dipole moment of water.

Opposition alone is insufficient: a linear molecule with unequal opposed bond dipoles of magnitudes $p_1$ and $p_2$ retains magnitude $|p_1-p_2|$. Conversely, symmetry can enforce exact cancellation beyond a particular bond dipole partition. If the complete charge density invariant under point reflection about the origin satisfies $\rho (\mathbf{r})=\rho (-\mathbf{r})$, contributions to $\int \mathbf{r}\rho (\mathbf{r})d^{3}r$ cancel in pairs. That proof uses the whole electric charge distribution, including lone pairs and atomic nuclei. It explains why molecular symmetry is stronger evidence for zero permanent electric dipole moment than a rule based only on tabulated electronegativity differences.

A permanent molecular electric dipole moment is specified relative to the molecule's orientation. An ensemble with random orientations can have zero mean laboratory vector while each molecule is polar. That orientational average differs from internal molecular dipole cancellation. The Stark effect and molecular beam electric resonance probe molecular electric dipole moments through state-dependent responses to an electric field.

At a point on a plane curve, or on a hypersurface with unit normal $\mathbf{n}$, a vector $\mathbf{w}$ splits into a normal component and a tangential component:The terms are orthogonal projections, and ${\mathbf{w}}_T\cdot {\mathbf{w}}_N=0$. Changing $\mathbf{n}$ to $-\mathbf{n}$ reverses the scalar coefficient $\mathbf{w}\cdot \mathbf{n}$, but leaves the normal component vector unchanged.

For a plane curve, a unit tangent vector $T$ and a unit normal $N$ form an orthonormal basis, givingAt $(1,1)$ on the parabola $y=x^2$, choose $T=(1,2{)}^T/\sqrt{5}$ and $N=(-2,1{)}^T/\sqrt{5}$. For $\mathbf{w}=(3,1{)}^T$,Their sum is $(3,1{)}^T$ and their inner product is zero. A negative normal coefficient means that the normal component points opposite the chosen $N$, rather than giving it a negative Euclidean norm.

These are local directions: being tangent at a point does not mean that a straight displacement stays on the curve. For a space curve, the normal part can have both principal normal vector and binormal vector components; projecting onto one chosen unit normal alone does not recover the entire normal plane.

Given a nonempty family $\mathcal{P}$ of finite-valued seminorms on a real or complex vector space $E$, its seminorm topology has basic open zero neighbourhoodsTheir translates form a basis of a topology. Only finite intersections are required: an infinite intersection might impose a stronger topology. Equivalently, put $q(x)={\max }_i{p}_i(x)/{\epsilon }_i$; then $q$ is a seminorm and $U=\{q<1\}$. See Günther Hörmann, Advanced Functional Analysis, section 4, neighbourhood systems from seminorms for the general construction.

Each defining seminorm is continuous, since $|p(x)-p(y)|\le p(x-y)$. A sequence satisfies $x_n\to x$ precisely when $p(x_n-x)\to 0$ for every $p\in \mathcal{P}$; the same criterion holds for nets. Finitely many measurements can each meet a prescribed tolerance after a common index.

The seminorm axioms also establish the required joint continuity of vector addition and scalar multiplication:For a basic neighbourhood, apply these estimates to its finitely many seminorms; near ${\lambda }_0$ the absolute value $|\lambda |$ is bounded. This gives a locally convex space even when some directions are invisible to every measurement.

At a fixed point $p$ of an $n$-dimensional smooth manifold $M$ without boundary, the tangent space $T_{p}M$ is the real vector space of all tangent vectors at $p$. In manifold charts $x=(x^1,\dots ,x^n)$ and $y=(y^1,\dots ,y^n)$, a tangent vector has componentsThe coordinate basis transforms inversely, so the tangent vector is unchanged. This invertible Jacobian matrix also preserves vector addition and scalar multiplication, giving a vector space of dimension $n$ independently of coordinates. ^[ref]

For example, at $(x,y)=(1,0)$ in ${\mathbb{R}}^2$, use the alternative manifold chart $u=x$, $w=y+x^2$. The Jacobian matrix sends $(v_x,v_y)=(2,3)$ to $(v_u,v_w)=(2,7)$. Indeed, the smooth curve $(x(t),y(t))=(1+2t,3t)$ gives $w(t)=1+7t+4t^2$. Conversely, ${\partial }_u{|}_p={\partial }_x{|}_p-2{\partial }_y{|}_p$ and ${\partial }_w{|}_p={\partial }_y{|}_p$, so $2{\partial }_u{|}_p+7{\partial }_w{|}_p=2{\partial }_x{|}_p+3{\partial }_y{|}_p$. The numbers change; their action on every smooth function does not.

For an embedded submanifold $M\subseteq {\mathbb{R}}^N$, the tangent space can be identified with the vector subspaceA proof outline explains why every coordinate vector is possible: in a manifold chart $x$, lift the short straight path $x(p)+ta$ using $x^{-1}$. Its tangent vector has components $a$. For a regular local parametrization $X:U\subseteq {\mathbb{R}}^n\to M$, the same chain rule gives $T_{p}M=\mathrm{im}D{X}_q$, where $X(q)=p$. This is the tangent space from a local parametrization.

For the sphere $S_R^2=\{p\in {\mathbb{R}}^3:p\cdot p=R^2\}$, differentiating that equation gives $p\cdot v=0$. Conversely, for any nonzero $v$ with $p\cdot v=0$, the smooth curvelies on the sphere and has ${\gamma }_v^{\prime }(0)=v$; use a constant smooth curve for $v=0$. Thus $T_p{S}_R^2=\{v:p\cdot v=0\}$, not merely a subset of that plane. At $p=(0,0,R)$ this vector subspace is $v_z=0$, while the affine tangent plane drawn through $p$ is $z=R$.

This also explains a mechanical constraint without requiring a force calculation. In the ideal mathematical model of a particle confined to a stationary sphere, its allowed velocities at $p$ are exactly $T_p{S}_R^2$: the radial component must vanish, but either independent tangential direction is available. For a general stationary holonomic constraint $F(q)=0$ with independent equations, the regular level set theorem gives $T_{q}M=\ker D{F}_q$. These are instantaneous kinematic possibilities; they do not determine the actual subsequent motion. On a general smooth manifold, tangent spaces at different base points cannot be identified canonically; an affine connection supplies parallel transport when such comparisons are needed.

A tensor product turns a bilinear map into a linear map. For vector spaces $V,W$ over the same field $F$, its elements are finite sums of pure tensors $v\otimes w$, subject to bilinearity:The scalar $a$ belongs to $F$; writing $V{\otimes }_{F}W$ makes this choice explicit. These rules preserve separate linearity while allowing arbitrary linear combinations of products.^[ref]

For a concrete example, take $V=W={\mathbb{R}}^2$, with basis vectors $e_1,e_2$ in the first copy and $f_1,f_2$ in the second. The four tensor-product basis elements areThe pure tensor made from $v=2e_1+e_2$ and $w=-f_1+3f_2$ expands toEach basis vector in one factor can interact with each basis vector in the other. This is why dimensions multiply; the tensor-product coefficient matrix displays these four interactions as a two-by-two grid.

The tensor product is different from the Cartesian product $V\times W$. With componentwise vector addition and scalar multiplication, the latter contains pairs and has dimension $\dim V+\dim W$. The map $\tau (v,w)=v\otimes w$ is bilinear, generally neither linear on that Cartesian product nor injective nor surjective. In our example, $\tau (2v,2w)=4\tau (v,w)$, and $\tau (2v,w/2)=\tau (v,w)$; the separability of a tensor explains why some outputs cannot be reached at all. Both spaces happen to have dimension four when $V=W={\mathbb{R}}^2$, but this coincidence does not identify their structures.

A topological vector space is a vector space $E$ over $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, equipped with a topology such that vector addition and scalar multiplication are jointly continuous:The domains carry the product topology, and the scalar field carries its usual topology. Joint continuity permits both inputs to vary at once. Here the definition does not impose the Hausdorff condition; we state it separately when needed. ^[ref].

Every normed vector space is a topological vector space: the triangle inequality gives $\Vert x+y\Vert \le \Vert x\Vert +\Vert y\Vert$, whilecontrols scalar multiplication near any $({\lambda }_0,x_0)$. More generally, a seminorm topology supplies many measurements of smallness, rather than one norm. Translation by any vector is a homeomorphism, so a neighbourhood basis at zero determines all neighbourhoods by translation.

The compatibility matters: on a nonzero real vector space, the discrete topology makes vector addition continuous, but not scalar multiplication. For $x\ne 0$, the sequence of scalars $1/n$ tends to zero, whereas the sequence $x/n$ never enters the open set $\{0\}$. Thus choosing a topology arbitrarily need not respect the linear algebra.

This framework lets functional analysis choose the appropriate notion of limit of a sequence. Norm topology measures one global error, weak topology tests linear functionals, and the Fréchet space of smooth functions controls every order of derivative. In each case the operations forming linear combinations are continuous, making approximation compatible with the underlying equations.

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.