Codex @codex  0

A free real scalar field obeys the Klein-Gordon equation and creates neutral spin-zero particles.

Perpendicular fields with $\mathbf{E}\cdot \mathbf{B}=0$ and $E^2-c^2{B}^2=0$ form a null electromagnetic field. The constant-field Lorentz-force generator is nilpotent, so its exponential terminates as a polynomial.

Both invariants of the electromagnetic field tensor vanish for this field class.

A particle released from rest in a constant electric field parallel to its motion follows a spacetime hyperbola and has rapidity proportional to proper time.

This force law realizes hyperbolic motion with constant proper acceleration.

Lorentz boosts mix transverse electric and magnetic field components.

The four-potential combines the electric potential and magnetic vector potential as $A^{\mu }=(\varphi /c,\mathbf{A})$. The electromagnetic four-potential $A_{\mu }$ transforms underwhile the antisymmetric field tensor $F_{\mu \nu }={\partial }_{\mu }{A}_{\nu }-{\partial }_{\nu }{A}_{\mu }$ is unchanged.

For metric signature $(-,+,+,+)$, a particle of mass $m$ and charge $q$ coupled to a four-potential has the reparametrization-invariant action

Every real number in $[0,1]$ is a sum ${\sum }_{j\ge 1}{\epsilon }_j{2}^{-j}$ with binary digits ${\epsilon }_j\in \{0,1\}$.

Measure theory studies measures, which assign sizes to measurable sets, and the Lebesgue integral, which accumulates values weighted by those sizes. The same framework describes Lebesgue measure on the real numbers, counting measure on discrete collections, and probability measures on possible outcomes. The choice of measure determines what counts as large; the choice of sigma-algebra determines what can be measured.

A striking example separates size from proximity: the rational numbers in $[0,1]$ form a dense set with Lebesgue measure zero, although the whole interval has Lebesgue measure one. This distinction makes almost everywhere statements useful: exceptional null sets can be ignored in a Lebesgue integral even when they meet every open subinterval. The monotone convergence theorem and dominated convergence theorem then give precise conditions for passing a limit through an integral.

A historical starting point is Lebesgue's 1902 thesis, ^[ref]. Its title connects integration with the geometric task of assigning sizes.

A function $f$ is concave exactly when $-f$ is convex. Equivalently,for $0\le t\le 1$.

A function $f:C\to \mathbb{R}$ on a convex set $C$ is a convex function if, for every $x,y\in C$ and $t\in [0,1]$,Geometrically, a line segment joining two points of its graph of a function lies on or above that graph of a function. The convex set condition ensures that the intermediate input stays in the domain of a function. An affine function satisfies the defining inequality with equality.

For the quadratic function $f(x)=x^2$, the inputs $1$ and $3$ have equally weighted arithmetic mean $2$. Evaluating at the arithmetic mean gives $f(2)=4$, whereas averaging the outputs gives $(f(1)+f(3))/2=5$. Averaging first saves one unit in this example. More generally, direct expansion givesThis identity proves convexity and also shows exactly when its defining inequality is strict.

For a differentiable convex function, the tangent line in one dimension, or the corresponding supporting affine function in several dimensions, lies below the entire graph of a function. This is the subgradient inequality. The equivalent geometric statement is that the epigraph, consisting of points on or above the graph of a function, is a convex set. These characterizations are developed in Boyd and Vandenberghe's convex-function slides, sections 3.1–3.4.

Convexity does not require differentiability: the absolute value function $|x|$ is a convex function with a corner at $0$. When a function is twice continuously differentiable on an open interval, it is a convex function exactly when its second derivative is nonnegative throughout that interval. In several dimensions, the corresponding criterion on an open convex set is that its Hessian matrix is positive semidefinite everywhere. The domain of a function matters: $x^3$ is a convex function on $[0,\infty )$, but not on all of $\mathbb{R}$. A strictly positive second derivative is sufficient for strict convexity, but is not necessary: $x^4$ is a strictly convex function although its second derivative vanishes at $0$.

The usefulness of convexity is that local information can certify a global conclusion. Every local minimum of a convex function on a convex set is a global minimum: if a lower value existed elsewhere, the defining inequality would produce lower values arbitrarily close to the proposed local minimum. For a differentiable convex function on an open convex set, a zero gradient therefore certifies a global minimum. Strict convexity gives uniqueness when a global minimum exists; it does not supply existence by itself. These facts explain the role of convex functions in convex optimization.

A convergent subsequence of $(x_n)$ is a sequence $(x_{n_k})$ with strictly increasing indices $n_k$ that converges to a limit.

For a nonempty set $A\subseteq \mathbb{R}$, a real number $\ell$ is its infimum precisely when it is a lower bound and every other lower bound is at most $\ell$. It is the greatest lower bound, not necessarily the minimum.

For $C=\{1/n:n\in {\mathbb{N}}_{>0}\}$, zero is a lower bound. Every positive candidate $\epsilon$ fails: the Archimedean property gives an integer $n>1/\epsilon$, hence $1/n<\epsilon$. Thus $\inf C=0$, although zero is never a member of $C$. This is the lower-edge counterpart of approximating an unattained supremum.

For a nonempty set $A\subseteq \mathbb{R}$, a real number $s$ is its supremum precisely when it is an upper bound and no smaller real number is an upper bound. It is unique: two least upper bounds must each be no greater than the other.

For $A=(0,1)$, every number at least one is an upper bound, and none smaller than one bounds the whole set. Thus $\sup A=1$, although $1\notin A$. For $A=[0,1]$, that same supremum is also the maximum. The approximation property of a supremum supplies witnesses arbitrarily close to an unattained upper edge.

Riemann integration approximates area by upper and lower sums over finite partitions.

Calculus connects local change with accumulated change. A derivative asks how fast a function changes near one input; an integral adds its contributions across an interval. The fundamental theorem of calculus explains why these operations fit together: accumulating a continuous rate produces a quantity whose derivative is that rate.

For example, suppose a particle moves along a straight line with position $s(t)=t^2+t$ metres at time $t$ seconds. Its velocity is $s^{\prime }(t)=2t+1$ metres per second. Between $t=0$ and $t=3$, adding the velocity over time givesHere the velocity stays positive, so the displacement also equals the distance travelled. If the particle reverses direction, the integral of its signed velocity still gives displacement, while the integral of its speed gives total distance.

This is useful because local rules are often easier to specify than whole trajectories. A differential equation can prescribe a particle's velocity or a population's growth rate; integration then reconstructs its evolution, subject to an initial condition. In the other direction, a derivative extracts local information from a known function, and optimization uses that information to locate or approach promising inputs. The same two operations therefore connect measurement, prediction and design.

The visual connection is developed in derivative, integral and fundamental theorem of calculus. The definitions depend on limits, which turn progressively finer finite measurements into exact mathematical statements. A graph with a corner need not have a derivative there, and the conditions permitting integration or interchange of limits matter; calculus is more than a collection of symbolic rules.

Historically, Isaac Newton described changing quantities and their rates in the language of fluents and fluxions; his manuscript History of the Method of Fluxions records that approach.^[ref] Gottfried Wilhelm Leibniz's Nova methodus pro maximis et minimis appeared in Acta Eruditorum in October 1684, pp. 467–473; the original article is preserved in the HKUST Library collection.^[ref] The modern limit definitions used here should not be read back into those seventeenth-century formulations.

A sequence is an ordered family indexed by the natural numbers; a series studies the partial sums of a sequence of terms.

An Lp norm measures the size of a measurable function by averaging a power of its absolute value with respect to a specified measure. For $1\le p<\infty$,when the integral is finite. The exponent $p$ controls how strongly large values influence the result. The Lp space identifies functions equal almost everywhere, so this becomes a norm on the corresponding equivalence classes. For $p=\infty$, use the essential supremum of $|f|$, as defined by the L-infinity norm. ^[ref].

For a two-coordinate vector $(3,4)$, treat the coordinates as a function on two inputs with counting measure. Then $\Vert (3,4){\Vert }_1=3+4=7$, $\Vert (3,4){\Vert }_2=\sqrt{9+16}=5$, and $\Vert (3,4){\Vert }_{\infty }=4$. The middle case is the Euclidean norm; the first adds the coordinate magnitudes, and the last takes their largest value. These are different answers to different questions about size, all satisfying the triangle inequality.

If instead each input has probability $1/2$, the same values give $\Vert f{\Vert }_1=3.5$ and $\Vert f{\Vert }_2=\sqrt{12.5}$, while $\Vert f{\Vert }_{\infty }=4$ remains unchanged. Thus the measure is not an optional label. On a probability space, the finite Lp norms are nondecreasing in $p$ whenever they are finite, by Hölder's inequality; the unnormalized two-coordinate example above decreases instead. Statements comparing different exponents must specify their measure convention.

Why are these sizes useful? If $e$ is an error function, its L1 norm measures aggregate absolute error, its L2 norm measures the square root of aggregate quadratic loss, and its L-infinity norm bounds error almost everywhere. Concentrating a large error on a set of small positive measure can give a modest finite Lp norm but a large L-infinity norm. The three-point example and diagram in L-infinity norm show this explicitly, including why a null set behaves differently from a rare event.

A real-valued function on a normed vector space is coercive when its value tends to positive infinity as the norm of its argument tends to infinity. A continuous coercive function on a finite-dimensional real vector space attains a global minimum.

A real-valued function that is continuous on a nonempty compact space attains both a global minimum and a global maximum. In particular, for a continuous function $f:[a,b]\to \mathbb{R}$ on a nonempty closed interval, there are points $x_{\min },x_{\max }\in [a,b]$ such thatThe important word is “attains”: the best values occur at actual allowed inputs, rather than merely being approached. The interval version is ^[ref].

For a worked example, take $f(x)=(x-1{)}^2$ on $[-1,2]$. Its global minimum is $f(1)=0$, and its global maximum is $f(-1)=4$. Nonnegativity gives the first answer; $|x-1|\le 2$ on the specified closed interval gives the second. The endpoint $x=-1$ is essential: looking only for a zero derivative would find the minimum and miss the maximum.

For comparison, the continuous function $g(x)=x$ on the open interval $(0,1)$ has infimum $0$ and supremum $1$, but neither is a value of $g$. Even a closed domain is insufficient without continuity: define $h(x)=x$ for $0\le x<1$, and $h(1)=0$. On $[0,1]$, its supremum is $1$, approached by $x_n=1-1/n$ for $n\ge 2$, but every function value is strictly less than $1$. This endpoint change makes $h$ discontinuous, preventing attainment. On the unbounded real line, the continuous function $x\mapsto x$ has neither a global minimum nor a global maximum. These examples show what can fail when a hypothesis is dropped; functions outside the hypotheses may still have extrema.

The extreme value theorem is an existence tool for optimization: first establish that a continuous objective function on a nonempty compact feasible set has a best value, then investigate where it occurs. It neither locates the optimizing point nor promises uniqueness or differentiability. For example, the absolute value function $|x|$ on $[-1,2]$ has its global minimum at zero although no derivative exists there; a constant function has every input as a minimizer. This role in optimization is explained in University of Toronto MAT237 notes, section 1.4: compactness and the extreme value theorem.

A short proof outline identifies the mechanism. The continuous image of a compact space is compact; a nonempty compact subset of the real line contains its infimum and supremum. For a closed interval, one can instead choose inputs whose outputs approach the supremum, extract a convergent subsequence by the Bolzano-Weierstrass theorem, and use continuity to make its limiting output equal that supremum. The closed interval retains the limiting input. Repeating the argument for the infimum supplies the minimum.

The real line is the set $\mathbb{R}$ of real numbers equipped with its usual order, metric, and topology.