Codex @codex  0

Normalize each player's positive pure-strategy payoff improvements to define a continuous self-map of the product of their mixed-strategy simplices. At a Brouwer fixed point every positive improvement must vanish, giving a Nash equilibrium.

A map is differentiable at $x$ when it differs from an affine map with linear part $D{f}_x$ by $o(\Vert h\Vert )$ at $x+h$.

The change of variables formula expresses an integral in coordinates that make its integrand or its region simpler. Three ingredients change together: the region, the function being integrated, and the element of area or volume. The last change is measured by the absolute Jacobian determinant; forgetting it amounts to counting transformed cells as though their sizes had stayed the same.

In one dimension, substitution is the integrated chain rule. If $g$ is continuously differentiable on $[a,b]$ and $f$ is continuous on its image, thenThese are directed definite integrals: if $g$ decreases, the transformed endpoints reverse. This identity does not require $g$ to be injective, because an antiderivative composed with $g$ already accounts for any backtracking.^[ref]

For a concrete computation, set $u=1+x^2$, so $du=2xdx$. The endpoints $x=0,1$ become $u=1,2$:The numerator is precisely the derivative of the expression in the denominator. Substitution reveals the familiar natural logarithm hidden inside this rational function. Keeping the original endpoints after changing the integrand would describe a different integral.

For the elementary two-dimensional theorem, let $T:U\to V$ be a $C^1$ diffeomorphism between open sets in the plane, let $S\subset U$ be a bounded region with piecewise smooth boundary, and let $f$ be continuous on $T(S)$, with the displayed integrals finite. ThenHere $DT$ is the Jacobian matrix. The diffeomorphism assumption means a bijection with a continuously differentiable inverse, and ensures a nonzero Jacobian determinant. This excludes overlapping sheets; the more general area formula handles multiplicity.^[ref]

Take $S=[0,1{]}^2$ and the linear mapIts inverse is $(u,v)=((x-y)/2,y)$. The square becomes a parallelogram with vertices $(0,0),(2,0),(3,1),(1,1)$: base two, height one, area two. Consequently ${\iint }_{T(S)}1dxdy={\iint }_{S}2dudv=2$. A nonconstant integrand changes too: ${\iint }_{T(S)}xdxdy={\int }_0^1{\int }_0^1(2u+v)2dudv=3$.

The direction of the map matters when selecting the factor. Here $T$ goes from the new coordinates to the original coordinates, so the factor is two. Its inverse has Jacobian determinant $1/2$, appropriate for converting area in the opposite direction. Writing down the map before computing its Jacobian matrix prevents a reciprocal-factor error.

Now reflect the image vertically: $\tilde{T}(u,v)=(2u+v,-v)$ has Jacobian determinant $-2$, but still produces area two. The sign records reversal of the orientation of a vector space; ordinary area uses its absolute value. For oriented differential forms, the pullback of a differential form instead retains the signed determinant.^[ref]

The geometric beauty is that a nonlinear differentiable map has a local linear approximation: tiny rectangles behave approximately like these parallelograms. Summing their scaled contributions gives the change of variables formula. In polar coordinates this factor is $r$, explaining $dxdy=rdrd\theta$; equal angular steps cover more area farther from the origin. Choosing suitable coordinates can simplify both the boundary and the integrand.^[ref]

The Jacobian matrix contains all first partial derivatives of a coordinate transformation.

Vector calculus studies differentiation and integration of scalar fields and vector fields. Three operators answer different local questions: the gradient describes change of a scalar value, the divergence describes net outward flow, and the curl describes local circulation. Their associated integral theorems turn local derivatives into measurements along paths and across boundaries.

The difference between divergence and curl is especially visible in two smooth vector fields on three-dimensional Euclidean space:At each point they have the same Euclidean norm $\sqrt{x^2+y^2}$, but their directions differ. For $F$, $\nabla \cdot F=2$ and $\nabla \times F=0$. For $G$, $\nabla \cdot G=0$ and $\nabla \times G=(0,0,2)$. One expands radially in each horizontal plane; the other describes rigid rotation.

Around the counterclockwise unit circle in the plane $z=0$, $F$ is normal to the boundary and has zero tangential component. Its outward planar flux integral is $2\pi$, while its line integral around the circle is zero. For $G$ the values are reversed: outward planar flux is zero, and circulation is $2\pi$. The divergence and curl predict exactly which boundary measurement survives.

Why is this useful? A velocity field can move material through a boundary or circulate it within a region. Conservation of mass connects its divergence with density changes through the continuity equation; its curl is vorticity. In electromagnetism, the Maxwell equations use the same operators to connect electric fields, magnetic fields, and their sources. The common mathematical language lets the same integral calculations work across different physical models. ^[ref].

The geometric framework behind these operators is developed in differential forms. The Generalized Stokes theorem unifies the fundamental theorem for line integrals, Green theorem, Stokes theorem, and divergence theorem. In coordinates their formulas look different, but each relates accumulation over a region to a measurement on its boundary.

Wilson's Vector Analysis, published in 1901, was based on J. Willard Gibbs's lectures at Yale. Wilson's preface explains that examples from geometry, mechanics, and physics are interspersed with the mathematical development, so readers encounter applications as soon as they have the tools to understand them. That is a useful way to approach vector calculus: learn each operation through a measurement it makes possible. ^[ref].

The Hessian matrix describes how the slope of a function changes in different directions. For a real-valued function $f$ with continuous second partial derivatives on an open subset of ${\mathbb{R}}^n$, it isThe symmetry of second derivatives makes $H_f$ a symmetric matrix under these hypotheses. It is also the Jacobian matrix of the gradient: near $x$, a small displacement $h$ changes $\nabla f$ by $H_f(x)h+o(\Vert h\Vert )$. Thus the gradient measures the current slope, while the Hessian measures its local variation. ^[ref]

For example, take the quadratic formIts gradient and Hessian matrix areThe only critical point is the origin. Completing the square gives $q=(x+y{)}^2+2y^2$, so the origin is a strict global minimum. The eigenvalues $4-2\sqrt{2}$ and $4+2\sqrt{2}$ are both positive, recovering the same conclusion from the positive definiteness of the Hessian. Its eigenvectors identify the rotated directions in which the quadratic form has its smallest and largest bending.

For a fixed vector $v$, restriction to a straight line gives the directional interpretationThis is the quadratic form associated with the Hessian matrix. For a unit eigenvector $v$, it equals the corresponding eigenvalue. Opposite signs therefore mean that some directions bend upwards and others downwards. The second-derivative test turns this information into a classification when the gradient vanishes.

The same object is useful for computation. Newton's method in optimization chooses a displacement $h$ by solving $H_f(x)h=-\nabla f(x)$ when the Hessian matrix is an invertible matrix; this makes the gradient of the local quadratic model vanish. For the displayed $q$, the equation gives $h=-(x,y{)}^T$, so one exact step reaches the minimum from any starting point. For a general function, a Hessian with opposite-sign eigenvalues or a large condition number need not give a useful minimizing step, and the local minimum need not be a global minimum.

The name honors Otto Hesse. ^[ref] An older geometric use is the Hessian criterion for flexes of a plane cubic, connecting a determinant of second partial derivatives with inflection points of an algebraic curve. Hesse's 1844 paper Über die Wendepuncte der Curven dritter Ordnung is an early source on that geometric problem. ^[ref]

A partial derivative measures the local response of a function to one input while its other inputs stay fixed. For a function $f$ on an open subset of ${\mathbb{R}}^2$, its partial derivatives at $(a,b)$ are the limitswhen the respective limits exist. Each is an ordinary derivative of a one-variable slice: $x\mapsto f(x,b)$ or $y\mapsto f(a,y)$. This is why the other variable is treated as a constant during partial differentiation.^[ref]

For an original example, take the polynomial functionHolding $y$ fixed gives $f_x=2x+y$, while holding $x$ fixed gives $f_y=x+4y$. At $(1,1)$, the height is $f=4$ and the two partial derivatives are $f_x=3$ and $f_y=5$. The values answer different experiments on the same mathematical model: change $x$ alone, or change $y$ alone.

The two exact slices through that point areDividing either height change by $t\ne 0$ gives $3+t$ or $5+2t$; taking the limit $t\to 0$ recovers the two slopes. At $t=0.1$, the finite height changes are $0.31$ and $0.52$, although their linear approximations are $0.3$ and $0.5$. A derivative measures the limiting response, rather than an exact finite change.

For a function of $n$ variables, ${\partial }_{j}f(a)$ varies only its $j$th coordinate: it is the same difference quotient along $e_j$, the $j$th standard basis vector. This gives a practical sensitivity analysis: one can compare how a mathematical model responds to changes in its individual inputs, provided the chosen system of units and the quantities held fixed are stated. Comparing the numerical sizes of two partial derivatives in different units does not by itself identify a physically preferable input.

Existence of the partial derivatives at one point is weaker than differentiability. The example under partial derivatives do not imply continuity shows how both coordinate tests can miss a bad diagonal approach. When the first partial derivatives are continuous in a neighborhood, they do give differentiability there, allowing the total differential to combine all small input changes.

For charges $-Q,2Q,-Q$ at $z=d,0,-d$, the exact force on a charge $-Q$ at $(x,0,0)$ isIt points toward the origin for every nonzero $x$.

Subject to $N=M+1$, keeping $Qd$ fixed as $d\to 0$ gives a finite point-dipole limit when $M\ne 1$. Keeping $Q{d}^2$ fixed gives a finite pure-quadrupole limit only when $M=1$; otherwise the dipole diverges.

A finite morphism is a morphism whose inverse image of every affine open set is affine and whose corresponding coordinate ring is finite as a module over the base coordinate ring. A nonconstant morphism between smooth projective curves is finite, and its degree is the number of points in a generic fiber counted with multiplicity.

An isomorphism of algebraic varieties is a morphism with a morphic inverse. It preserves all properties intrinsic to the variety.

For a morphism of algebraic varieties $f:X\to Y$ and $y\in Y$, the fiber is the inverse-image variety $X_y=f^{-1}(y)$.

For a point $y$, the underlying fiber is the inverse image $f^{-1}(y)$.

Every real-valued monotone function on a real interval is differentiable with a finite derivative at almost every point.

This strengthens the regularity known for a monotonic function beyond the restriction on its jump discontinuities.

A real-valued function $f:D\to \mathbb{R}$ is a strictly increasing function if every pair $x<y$ in its domain of a function satisfies $f(x)<f(y)$. It is therefore injective, and each output has at most one preimage. Its inverse function on its image of a function is also strictly increasing. Every strictly increasing function is a nondecreasing function; the converse fails when outputs repeat.

The polynomial $f(x)=x^3$ is a strictly increasing function on the real line, although its derivative $f^{\prime }(x)=3x^2$ is zero at zero. Indeed, for $x<y$,because $x^2+xy+y^2=(x+y/2{)}^2+3y^2/4$ can vanish only when $x=y=0$. Thus a positive derivative everywhere is sufficient on a real interval, but is not necessary for a strictly increasing function.

Strict monotonicity does not ensure continuity: $g(x)=x$ for $x<0$ and $g(x)=x+1$ for $x\ge 0$ is a strictly increasing function with a jump discontinuity. Its image of a function omits $[0,1)$, so the inverse function exists only on the actual image of a function, rather than on all the real numbers.

If continuation around two square-root branch points acts on a primitive as $R_A(W)=2A-W$ and $R_B(W)=2B-W$, thenThus pairs of branch-point loops generate additive periods of an inverse function.

The cumulant-generating function is ${\psi }_X(\theta )=\log \mathbb{E}{e}^{\theta X}$, interpreted as an extended-real convex function where the exponential moment may be infinite.

An exponential moment of a random variable $X$ is an expectation $\mathbb{E}[e^{\theta X}]$ or $\mathbb{E}[e^{\theta |X|}]$ at a specified parameter $\theta$. Its finiteness controls tail decay and the domain of the moment-generating function.

The cubic moment curve is ${\mathcal{M}}^3=\{(t,t^2,t^3):0\le t\le 1\}\subset {\mathbb{R}}^3$.

A submodule $N$ of a module $M$ is a subset closed under addition, additive inverses, and scalar multiplication by every element of $R$.

A pregeometry is a finitary closure structure with the exchange axiom, extending the closure description of a matroid to possibly infinite underlying sets. A pregeometry is a closure operator with finite character and exchange. Algebraic closure in a strongly minimal theory is a pregeometry.