Codex @codex  0

Absolute homogeneity is the norm axiom $\Vert av\Vert =|a|\Vert v\Vert$ for every scalar $a$ and vector $v$. It distinguishes a norm from a merely homogeneous expression of a different degree; for example the fourth root in the box norm converts a degree-four expression into a degree-one norm.

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]

The Brans-Dicke theory adds a dynamical scalar field $\Phi$ to a metric tensor theory of gravity, with constant dimensionless coupling $\omega$. In a $(+---)$ signature and the reversed-curvature convention used here, the displayed Lagrangian is supplemented by matter and integrated against the metric tensor volume density with prefactor $1/(16\pi G)$. Its scalar multiplier of the Ricci scalar lets the curvature coupling vary in spacetime. Both the metric tensor and scalar are varied; the scalar equation of Brans-Dicke theory follows by eliminating curvature between the scalar equation and the trace of the metric tensor equation. The original construction is described in Brans and Dicke's 1961 article.

In three-dimensional Euclidean space, a nonzero normal vector $\mathbf{n}=(a,b,c)$ determines the plane equationFor a point ${\mathbf{a}}_0$ on the plane, $d=\mathbf{n}\cdot {\mathbf{a}}_0$, so the equivalent point-normal form is $\mathbf{n}\cdot (\mathbf{x}-{\mathbf{a}}_0)=0$. The difference of any two points on the plane is orthogonal to $\mathbf{n}$, directly explaining its role as a normal vector.

Multiplying $a,b,c,d$ by the same nonzero scalar preserves the set of solutions. Thus $2x-y+2z=3$ and $-6x+3y-6z=-9$ describe the same plane. Their normal vectors point in opposite directions, so a signed distance from a point to a plane changes sign, while the distance from a point to a plane is unchanged. If $a=b=c=0$, the linear equation describes either all of space when $d=0$, or the empty set when $d\ne 0$; it does not select a plane.

Write $D(t)=|A+tA|/|A|$ and suppose some nonzero $b$ has $D(b)\le K$. The mixed-set Plünnecke-Ruzsa inequality gives $|3A-2A|\le K^5|A|$ and $|A+A|\le K^2|A|$. The Ruzsa covering lemma covers $tA$ by at most $D(t)$ translates of $A-A$. Covering two dilates proves the addition bound. First covering $sA$, then both copies of $rA$ in $r(A-A)$, proves the multiplication bound. The Ruzsa triangle inequality also gives $D(-r)\le K^{2}D(r)$. These bounds transfer controlled additive expansion through a bounded-complexity expression in scalars.

A scalar multiplying a specified term in a linear combination, polynomial or power series. When the term family has linear independence, the coefficients are unique; uniqueness of finite Laurent polynomial coefficients follows after multiplying by a sufficiently large power to obtain an ordinary polynomial.

The scalar multiplying a specified monomial in a polynomial. Relative to the powers $1,t,t^2,\dots$, the polynomial coefficients are unique. Coefficients at powers beyond the degree of a polynomial are understood to be zero.

Points are collinear when they lie on a single line. Two vectors are collinear when their linear span has dimension at most one. For a nonzero vector $v$, this means that the other vector is $\lambda v$ for some scalar $\lambda$. This algebraic convention includes the zero vector; the directional use of “parallel” sometimes assumes both vectors are nonzero.

A contravariant vector has coordinate components obeying the displayed transformation law. A tangent vector to a parametrized curve provides the basic example: the chain rule transforms $d{x}^a/ds$ in precisely this way. Pairing it with a covector produces a coordinate-independent scalar. Conversely, if an array pairs invariantly with every contravariant vector, coefficient comparison forces the covector transformation law for that array.

Control theory studies how to choose control inputs for a dynamical system so that its plant output follows a reference signal, despite control disturbances and imperfect knowledge of the controlled plant. A controller turns the available information into a control signal. The design must consider both the resulting response and stability theory: a rule that corrects a small mismatch can still produce growing deviations if the interconnection is badly chosen. ^[ref]

The central distinction is informational. Open-loop control executes planned commands; feedback control uses the measured output of the actual controlled plant to update those commands. A reference signal can describe a destination, while control disturbances describe influences that the controller did not command. A model can predict where the controlled plant should be; measurement tells the controller what actually happened. The authors provide a free full-book PDF through ^[ref].

For a concrete comparison, all examples below use the same ideal scalar controlled plant:Here $x$ is an illustrative position, $u$ the control input, $w$ a control disturbance, and $y_m$ the measured output. Both $x$ and $t$ are dimensionless quantities; the numbers are chosen to expose the mechanism, with no empirical interpretation. The ordinary differential equation says that the present control input and control disturbance accumulate into $x$. The measured output equals the entire state only in this ideal example; a general plant output need not reveal the entire state.

Suppose performances on fixed tasks $A$ and $B$ are $f_A(r)$ and $f_B(r)$, where both functions are nondecreasing in the same scalar resource $r$. If patient $P$ performs strictly better than $Q$ on $A$, then $r_P>r_Q$: the reverse ordering would contradict monotonicity. If $Q$ performs strictly better on $B$, the same argument gives $r_Q>r_P$, a contradiction. Thus a genuine crossover rejects this single-resource model.

The conclusion depends on the fixed mappings and task comparability. It does not prove isolated anatomical stores, and it need not apply when patients differ in strategy, sensory access or other task parameters.

A definite integral accumulates an integrand between specified endpoints, retaining the sign of each contribution. For a real-valued function on a finite real interval, a finite definite integral is a scalar; an indefinite integral describes a family of antiderivatives. The lower and upper limits of integration $a,b$ specify where accumulation starts and ends. The integration variable is a placeholder: ${\int }_a^{b}f(x)dx={\int }_a^{b}f(u)du$.

This is useful whenever a varying rate must be converted into a total change. For motion along a straight line with continuous velocity $v(t)$ and position $s(t)$ satisfying $s^{\prime }(t)=v(t)$, the fundamental theorem of calculus gives displacement, while accumulating speed gives the distance traveled from velocity:Negative velocity reduces displacement while adding to the distance traveled from velocity. The physical dimension of a definite integral is the product of the integrand's physical dimension and the integration variable's physical dimension: here $(\mathrm{m}/\mathrm{s})\mathrm{s}=\mathrm{m}$. An area on a rate graph need not be a spatial area.^[ref]

As an explicitly synthetic motion model, let $v(t)=(2\mathrm{m}{\mathrm{s}}^{-2})t-2\mathrm{m}{\mathrm{s}}^{-1}$ for $0\le t\le 3\mathrm{s}$, with $s(0)=0$. Using numerical values in seconds and metres, an antiderivative gives $s(t)=t^2-2t$. The velocity changes sign at $t=1$: the model first moves $1$ m in the negative direction, then $4$ m in the positive direction. Its displacement is $-1+4=3$ m, and its distance traveled from velocity is $1+4=5$ m. The initial position fixes the constant of integration, but does not change either accumulated quantity.

Orientation matters independently of whether the integrand is positive or negative. For a function integrable on the interval containing the endpoints, use the conventionsFor the preceding velocity model, accumulation from $3$ seconds back to $0$ seconds gives $-3$ m. Reversing the bounds of the speed integral gives $-5$ m, which is an oriented integral, not a negative distance traveled from velocity; physical elapsed-time totals use the earlier endpoint first. The splitting rule holds even when $b$ is outside the interval between $a$ and $c$, provided integrability holds on the interval containing all three endpoints.^[ref]

Existence needs hypotheses. For a bounded function $f$ on $[a,b]$ with $a<b$, a finite Riemann integral exists when every tagged Riemann sum approaches the same value as the largest cell width tends to zero:The limit must be independent of both the partition of an interval and the tags. Merely making the number of cells large can leave a wide cell unresolved. On a finite closed interval, every continuous function, and every bounded function that is continuous except at finitely many points, is Riemann integrable.^[ref] Boundedness alone is insufficient: the Dirichlet function on $[0,1]$ is $1$ on the rational numbers and $0$ on the irrational numbers. Tags can all be chosen rational or all irrational, giving Riemann sums of $1$ or $0$ at arbitrarily small cell widths.^[ref]

For a finite signed Lebesgue integral, the condition is instead that $f$ be a measurable function for Lebesgue measure and ${\int }_{[a,b]}|f|dx<\infty$. A measurable function for Lebesgue measure that is also a bounded function on a finite interval satisfies this condition since $|f|\le M$ gives $\int |f|\le M(b-a)$. The Dirichlet function therefore has Lebesgue integral zero: the rational numbers form a null set, so it equals zero Lebesgue almost everywhere. The Riemann integral and Lebesgue integral agree for the continuous functions used in the diagrams.^[ref] An unbounded integrand or infinite endpoint requires further analysis, for example the limits defining an improper integral; the notation alone does not establish convergence.

At $\omega =-3/2$, the combined scalar equation of Brans-Dicke theory becomes the matter consistency condition $T=0$. It does not determine $\square \Phi$ by division, since the wave coefficient has vanished. The original metric tensor and scalar Euler-Lagrange equations must be retained. Introducing scalar-dependent matter or a scalar potential changes the consistency condition.

The determinant assigns a scalar to a square matrix. For a linear map on the real plane, it measures signed area scaling: its absolute value tells how much area grows, and its sign records whether the orientation of a vector space is preserved or reversed. In three dimensions, the same idea measures signed volume. Over a field, a square matrix is an invertible matrix exactly when its determinant is nonzero. These are two views of one phenomenon: losing an independent direction collapses full-dimensional volume and makes the original input impossible to recover uniquely.^[ref]

Start with an explicit matrix and its action on a vector:The columns are the images of the standard basis vectors: $A{e}_1=(2,1{)}^T$ and $A{e}_2=(1,3{)}^T$. Consequently the unit square with corners $(0,0),(1,0),(1,1),(0,1)$ becomes the parallelogram with corners $(0,0),(2,1),(3,4),(1,3)$. Its area is five. Every small patch of this square undergoes the same linear map, so the factor describes the whole deformation, rather than just one specially chosen boundary. The matrix mixes horizontal and vertical components, but its determinant compresses that combined effect into one area factor.^[ref]

Now exchange the columns:The parallelogram occupies exactly the same region, but its generating vectors arrive in the opposite order. Moving from the first column to the second now turns clockwise rather than counterclockwise. Ordinary area remains five; the oriented volume in two dimensions changes sign. A negative determinant therefore signals reversed orientation of a vector space, not a negative amount of material. Keeping the sign makes successive reversals calculable: two reversals restore the original orientation of a vector space.

Compare a singular matrix:Its columns are linearly dependent: the second is twice the first. The unit square collapses onto the segment from $(0,0)$ to $(3,6)$, which has zero area despite nonzero length. Since $C(-2,1{)}^T=0$, the kernel of a linear map contains a nonzero vector; inputs differing by that vector have identical outputs. The collapsed picture explains why an inverse matrix cannot exist.

For $A$, recovery is possible, and the complete matrix multiplication check isHere $I$ is the identity matrix. The inverse matrix restores the original square, shrinking its area by $1/5$. Generally, the adjugate identity gives $A^{-1}=\mathrm{adj}(A)/\det A$ whenever the determinant is nonzero over a field; this is why the denominator matters.^[ref]

The multiplicativity of the determinant describes two successive deformations. Matrix multiplication means that $AB$ applies $B$ first, then $A$. TakeThe first linear map doubles area; the second multiplies the resulting area by five. Thus the unit square passes through areas $1,2,10$, with the last parallelogram bounded by $(0,0),(2,1),(4,7),(2,6)$. Direct calculation agrees:This explains physically why area factors multiply instead of adding. The general identity holds for square matrices of the same size, including singular matrices. If either stage loses a direction, later processing cannot recover the discarded information.^[ref]

The same interpretation works in three dimensions without drawing a new picture. The diagonal matrixsends the unit cube to a rectangular box with side lengths two, three, and one. Its ordinary volume is six. The minus sign comes from reversing the third direction, so the oriented volume is minus six. Replacing the last diagonal entry by zero flattens the cube into a planar region: its area may be positive, but its three-dimensional volume is zero. This distinction matters whenever a linear map changes shape: the determinant measures size in the full input dimension, rather than the size of whichever lower-dimensional object remains.

The determinant measures neither trace nor perimeter. For $A$, the trace happens also to be five, but the identity matrix in two dimensions has trace two and determinant one. The first parallelogram above has perimeter $2(\sqrt{5}+\sqrt{10})$, compared with four for the unit square; boundary length follows a different rule. Nor does determinant one require every length to stay fixed: the diagonal matrix $\mathrm{diag}(2,1/2)$ preserves area while stretching one direction and compressing the other.

These properties make the determinant useful when coordinates obscure what a deformation does. A nonzero determinant certifies that linearly independent input directions remain distinguishable; its magnitude counts the area or volume represented by a transformed cell. That second role reappears in the change of variables formula, where the Jacobian determinant corrects the sizes of small cells. Signed volume also separates a deformation that reverses the orientation of a vector space from one that merely stretches it, even when both give identical ordinary volume factors.^[ref]

For general $n$, regard the columns $v_1,\dots ,v_n$ as ordered arguments. The determinant is the unique alternating multilinear map to the scalar field normalized by $\det I=1$. The multilinearity of the determinant means linearity in each column separately, with all others held fixed:Alternation means equal columns give zero; exchanging columns negates the result. Normalization sets the oriented volume of the standard basis to one. These properties also hold in rows. For real three-dimensional columns, their determinant is the scalar triple product, and its absolute value is the enclosed volume. Over other fields, the algebraic definition still works even without a geometric notion of positive volume.^[ref]

Separate linearity does not mean the determinant is a linear map on the whole matrix. Scaling every column of an $n$-by-$n$ matrix by $t$ gives $\det (tA)=t^n\det A$. For our two-dimensional example, $\det (2A)=4\det A=20$: doubling both directions quadruples area. The power records how many independent directions are being scaled together.

The properties suggest practical computations. Adding a multiple of one column to another preserves the determinant: the extra term has repeated columns and vanishes. This is the algebra behind an area-preserving shear mapping. Alternatively, expansion along a row uses cofactors, each a matrix minor multiplied by a sign:where $A^{(ij)}$ deletes row $i$ and column $j$. The Leibniz formula for determinants supplies the general entry formula. Both calculations encode the same geometric invariant; the defining properties explain their structure without requiring memorization of a separate recipe for every size.^[ref]

The dimension of a vector space is the cardinality of any of its bases. In finite dimension this counts the scalars needed to specify an arbitrary vector once an ordered basis is chosen. The exchange argument behind the basis extension theorem shows that any two finite bases have the same size: an independent family cannot be larger than a spanning family.

Thus ${\mathbb{R}}^2$ has dimension two even with an oblique basis, $\mathbb{R}[x{]}_{\le 2}$ has dimension three, and the homogeneous plane in vector subspace has dimension two. This count concerns independent freedom, so an embedded plane remains two-dimensional while sitting in a three-dimensional ambient vector space. Dimension also depends on the field, as the two interpretations of $\mathbb{C}$ in vector space illustrate.

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]

The algebraic double dual of a vector space is the dual space of its algebraic dual. An element assigns a scalar linearly to each linear functional on the original space. The bidual evaluation map sends $v$ to the rule $\ell \mapsto \ell (v)$. It is a canonical linear isomorphism in finite dimension, unlike an identification of $V$ with $V^{\ast }$, which generally requires an additional choice. For spaces with topology, using the continuous dual space instead defines the topological bidual; that is a distinct construction in infinite dimension.

Dynamo quenching is the reduction or modification of magnetic-field generation by magnetic feedback on the generating flow and its correlations. The Lorentz force can change shear or turbulence, while magnetic helicity affects mean-field regeneration. A phenomenological scalar example is $\alpha (B)={\alpha }_0/(1+B^2/B_{\ast }^2)$. In the illustrative amplitude equation $\dot{B}=[c\alpha (B)-d]B$ with $c,d>0$, a growing field saturates at $B^2=B_{\ast }^2(c{\alpha }_0/d-1)$ when $c{\alpha }_0>d$. This demonstrates the negative feedback mechanism without claiming that algebraic quenching is a complete solar closure.

An eigendirection is the one-dimensional vector subspace spanned by an eigenvector. Multiplying the eigenvector by a nonzero scalar leaves this direction unchanged. In a planar linear dynamical system, a negative real eigenvalue gives a direction of exponential approach to the equilibrium point, while a positive one gives exponential departure. For a hyperbolic saddle equilibrium, the nonlinear stable manifold and unstable manifold are tangent to the corresponding eigendirections.

An eigenline is a one-dimensional vector subspace spanned by an eigenvector. If $Av=\lambda v$ with $v\ne 0$, then $A(av)=\lambda av$ for every scalar $a$, so the line is an invariant subspace. It can be contained in an eigenspace of larger dimension; an eigenline need not be the whole eigenspace.