Codex @codex  0

The $k$th correlation function is the density of the $k$th factorial moment measure: integrating a nonnegative test function against $R_k$ gives the expectation of its sum over ordered $k$-tuples of distinct points. For exactly $m$ exchangeably labelled points with symmetric joint density $f_m$, it is $m!/(m-k)!$ times the marginal density of $k$ labels. It is not normalized to have total mass one.

In a countable language, an ultraproduct over a nonprincipal ultrafilter on $\omega$ realizes every countable finitely satisfiable type, including types over countably many parameters. Enumerate the type ${\phi }_1,{\phi }_2,\dots$, and let $A_n$ be the ultrafilter-large set of coordinates where the first $n$ first-order formulas have a simultaneous witness. Put $B_n=\{i:i\ge n\}\cap {\bigcap }_{j\le n}{A}_j$. At coordinate $i$, choose a witness for the largest $n\le i$ with $i\in B_n$, or an arbitrary element when there is none. For each fixed $n$, the resulting function satisfies the first $n$ first-order formulas on $B_n$. The Łoś theorem then realizes the entire type. Countability of the language and parameter set makes the enumeration possible.

Let a fixed simple three-uniform hypergraph $F$ have $m$ hypergraph edges, with one host vertex of a hypergraph class $V_i$ for each vertex of a hypergraph. Assume each hypergraph edge triple has indicator $h_e$, subset density $p_e$, and balanced three-dimensional box norm at most ${\alpha }^{1/8}$. The normalized labelled hypergraph copy count is $\mathbb{E}{\prod }_{e\in E(F)}{h}_e$. Telescope this product against ${\prod }_e{p}_e$. In each error term, fix all variables outside the three vertices of a hypergraph of its balanced hypergraph edge. Every other hypergraph edge intersects that triple in at most two vertices of a hypergraph, so the remaining factors group into three pair functions bounded by one. The pair-factor correlation bound for the three-dimensional box norm bounds the error by ${\alpha }^{1/8}$. Summing givesFor the three-uniform tetrahedron, $m=4$. The same argument with a common host set counts homomorphisms; excluding collisions of distinct abstract vertices of a hypergraph changes the count by at most $\left(\genfrac{}{}{0ex}{}{|V(F)|}{2}\right)|V{|}^{|V(F)|-1}$.

Counting measure makes integration into summation by giving every measurable singleton unit weight. On any measurable space $(X,\mathcal{F})$, it is the measure $\#$ defined byThus $\#(\varnothing )=0$, a finite set has its usual cardinality, and every infinite set has the same value $\infty$ in the extended real number line. In particular, countably infinite sets and uncountable sets are not distinguished by their counting measure. Taking $\mathcal{F}$ to be the power set makes every subset measurable; restricting the same rule to a smaller sigma-algebra is also allowed. ^[ref]

Why is this a countably additive measure? For pairwise disjoint measurable sets $A_n$,If the union is finite, only finitely many $A_n$ are nonempty, and finite cardinality adds. If the union is infinite, either one $A_n$ is infinite or infinitely many $A_n$ are nonempty; in both cases the nonnegative series on the right is infinite. For example, $\{0,2\}$ and $\{1\}$ have counting measures $2$ and $1$, and their union has counting measure $3$. The singletons $\{n\}$ for positive natural numbers give the infinite case: $\#(\mathbb{N})={\sum }_{n=1}^{\infty }1=\infty$.

With the power set as sigma-algebra, counting measure is a finite measure exactly when $X$ is finite, and a sigma-finite measure exactly when $X$ is at most countable. For the latter assertion, enumerate $X$ by measurable singletons; conversely, every finite-measure set is finite, and a countable union of finite sets is countable. Specifying the sigma-algebra matters: if $X=\mathbb{N}$ and $\mathcal{F}=\{\varnothing ,\mathbb{N}\}$, counting measure is not a sigma-finite measure, since the only measurable finite-measure set is the empty set.

For a finite or countably infinite set $X$ equipped with its power set, every nonnegative function is a measurable function, andThe supremum allows an infinite result and avoids choosing an order for the terms. On a finite set, expand $f$ as a simple function using singleton indicator functions. On a countably infinite set, enumerate the points and apply the monotone convergence theorem to finite truncations. Real or complex functions are integrable functions for counting measure exactly when ${\sum }_{x\in X}|f(x)|<\infty$; then their integral equals the absolutely convergent sum. This is the discrete counterpart of Lebesgue integration, developed further in series as a Lebesgue integral against counting measure. ^[ref]

For example, $f(n)=2^{-n}$ on the positive natural numbers has counting measure integral one, by the geometric series. The alternating harmonic series has a finite ordered sum but is not the integral of an integrable function for counting measure: its positive and negative parts both have infinite sums. Absolute convergence is what makes the finite integral independent of enumeration. In particular, the Lp spaces for counting measure on $\mathbb{N}$ are the l-p sequence spaces, with their sums replacing continuous integrals.

Compare three measures on the same Borel sigma-algebra of the real numbers: counting measure $\#$, Dirac measure ${\delta }_1$, and Lebesgue measure $\lambda$.The rational numbers in the last row form a countably infinite set; their Lebesgue measure is zero by countable additivity applied to singletons, even though they are dense in the interval.

These are different answers to different questions: counting measure asks how many points occur, Dirac measure asks whether the selected point occurs, and Lebesgue measure asks how much length occurs. A null set therefore depends on its measure. For counting measure, the only null set is the empty set, so equality almost everywhere is equality everywhere. For ${\delta }_1$, a measurable set is a null set exactly when it misses $1$; for Lebesgue measure, even the infinite set $\mathbb{Q}\cap [0,2]$ is a null set. Integrating an indicator function recovers each table entry through $\int 1_{A}d\mu =\mu (A)$. This lets the same Lebesgue integral framework handle point counts, point evaluation, and geometric length.

For a smooth function $f:U\to \mathbb{R}$ on an open set $U\subseteq {\mathbb{R}}^n$, a critical point is an input $x_{\ast }$ where the gradient vanishes: $\nabla f(x_{\ast })=0$. Equivalently, every first partial derivative is zero. Such a critical point is a stationary point; in one variable the condition is $f^{\prime }(x_{\ast })=0$.

There is a broader convention in elementary one-variable calculus: a "critical number" is an interior input where the derivative is zero or does not exist, provided the function itself is defined there. Thus a corner can be a critical number without being a stationary point. Here the smooth meaning of critical point is used unless the broader convention is explicitly stated. ^[ref]

For the polynomial $f(x)=x^4-2x^2$ on the real line,The stationary points at $x=\pm 1$ are strict local minima and attain the global minimum; the stationary point at $x=0$ is a strict local maximum. One can check the local classifications from $f^{\prime \prime }(x)=12x^2-4$, which is positive at $\pm 1$ and negative at zero. The identity $f(x)=(x^2-1{)}^2-1\ge -1$ proves the global minimum directly. Since $f(x)\to +\infty$ as $|x|\to \infty$, there is no global maximum on $\mathbb{R}$.

A zero derivative alone does not guarantee an extremum. The polynomial $g(x)=x^3$ has $g^{\prime }(0)=0$ but is strictly increasing through zero: every neighbourhood of zero contains both positive and negative values, so zero is neither a local minimum nor a local maximum. Conversely, the absolute value function $h(x)=|x|$ has a strict local minimum and a unique global minimum at zero, but its left and right derivatives are $-1$ and $+1$. It is not differentiable there, so zero is a critical number under the broader convention and is not a stationary point.

The usefulness of critical points is that they reduce the search for smooth interior extrema to equations. Every local minimum or local maximum of a differentiable function at an interior point has zero gradient; this condition is necessary, and $x^3$ shows that it is not sufficient. The striking feature is that all the first directional derivatives must vanish together, even though the surrounding values can form a valley, a peak, or a saddle point of a scalar function. ^[ref]

Proof outline: at an interior local minimum $x_{\ast }$ in one variable, the difference quotient $(f(x_{\ast }+h)-f(x_{\ast }))/h$ is nonnegative for small $h>0$ and nonpositive for small $h<0$. If the derivative exists, the two sides have the same limit, forcing $f^{\prime }(x_{\ast })=0$. Reverse the inequalities for a local maximum. In several variables, apply this argument along each coordinate line to obtain zero partial derivatives and hence zero gradient. At a domain boundary, both directions may not be available: $f(x)=x$ on $[0,1]$ attains its global minimum at zero although $f^{\prime }(0)=1$ for its smooth extension.

For a twice continuously differentiable function, the curl of its gradient vanishes. In components, ${ϵ}_{ijk}{\partial }_j{\partial }_{k}f=0$ because the second derivatives are symmetric in $j,k$ while the Levi-Civita symbol is antisymmetric. Thus adding a gradient to a vector potential preserves the represented curl. No topological assumption is needed for this identity, unlike the converse assertion that every curl-free vector field has a global potential.

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.

For $h\in L_0^2(P)$, truncate $h$ to $h_m=\max (-m,\min (h,m))$ and subtract $P{h}_m$. Dominated convergence gives $h_m\to h$ in L2 space, and the Cauchy-Schwarz inequality gives $P{h}_m\to 0$. Thus bounded centered directions are dense in the mean-zero L2 space. The measure defining the L2 norm is essential: density-weighted L2 space can contain functions outside the unweighted Lebesgue space.

The derivative measures the instantaneous rate at which a function changes. For a real function $f$ defined near $a$, it exists when the difference quotient has a finite two-sided limit:The quotient is the slope of the straight line joining two nearby points of the graph. Its limit is the slope of the tangent line. Thus a derivative describes a local rate without choosing a particular finite measurement interval.

For $f(x)=x^2$, expanding the numerator givesAt $a=1$, the increments $h=1$, $1/2$ and $1/10$ give secant line slopes $3$, $2.5$ and $2.1$. The limit is $2$, and the tangent line is $y=1+2(x-1)$. The picture makes the limiting process visible.

The same calculation shows why the derivative is useful for approximation:This is a local linear approximation. Near $a=1$, replacing $(1+h{)}^2$ by $1+2h$ makes the exact error $h^2$, smaller than the leading change when $h$ is small. A curved graph can therefore be studied locally using a straight line.

If the function records position against time, its derivative is velocity. If it records an objective function, its derivative tests local changes that matter in optimization; in several variables, the gradient collects these directional rates and guides gradient descent. The interpretation comes from the function and its units, rather than from a new rule for each application.

Existence matters. For the absolute value function $f(x)=|x|$, the one-sided derivatives at zero are $-1$ and $1$, so there is no single tangent line described by a finite derivative there. Nor does a zero derivative alone identify a maximum or minimum: $f(x)=x^3$ has $f^{\prime }(0)=0$ but keeps increasing through zero.

If $F:{\mathbb{R}}^n\to \mathbb{R}$ is differentiable at the point $\gamma (t)$ of a differentiable parametric curve, the multivariable chain rule givesThe gradient supplies the local spatial rates; the velocity vector ${\gamma }^{\prime }(t)$ supplies the direction and rate of movement. Their dot product is the change in the sampled scalar field per unit parameter. If the parameter is time, this is a rate per unit time; a directional derivative per unit distance instead uses a unit vector.

Take $F(x,y)=x^2+2y^2$ and the unit circle path $\gamma (t)=(\cos t,\sin t)$. Along the path,At $t=\pi /4$, the gradient is $(\sqrt{2},2\sqrt{2})$, the velocity vector is $(-1/\sqrt{2},1/\sqrt{2})$, and their dot product is $-1+2=1$. The sampled value is $3/2$ and increases at rate one, even though one coordinate is decreasing. This is why a moving observation must combine every coordinate's contribution.

For a level curve, $F(\gamma (t))$ is constant, so the derivative along a curve is zero and its velocity vector is orthogonal to the gradient. Along other paths, the same formula combines a field's geometry with the observer's motion. ^[ref].

Let $I$ be a real interval, and let $f:I\to \mathbb{R}$ be differentiable in its interior and continuous at any endpoints belonging to $I$. If the derivative satisfies $f^{\prime }(x)\ge 0$ throughout the interior, then $f$ is a nondecreasing function on $I$. For $x<y$ in $I$, the mean value theorem supplies $c\in (x,y)$ withChanging $\ge 0$ to $\le 0$, $>0$, or $<0$ gives a nonincreasing function, strictly increasing function, or strictly decreasing function, respectively. The endpoint continuity assumption lets the mean value theorem apply even when $x$ or $y$ is an endpoint. ^[ref].

Conversely, if a nondecreasing function on a real interval is differentiable at an interior point $x$, then $f^{\prime }(x)\ge 0$: the difference quotient $(f(x+h)-f(x))/h$ is nonnegative for either sign of $h$. A differentiable nonincreasing function has derivative $f^{\prime }(x)\le 0$. Strict monotonicity still only forces these weak signs: the strictly increasing function $x^3$ has derivative zero at zero. The sign of the derivative helps locate intervals of monotonicity when sketching a graph. ^[ref].

The real interval hypothesis matters because a connected subset of the real line contains every point between its inputs. On a disconnected domain of a function, positive derivatives need not give a nondecreasing function. For example, takeHere $f^{\prime }(x)=1$ everywhere in $D$, but $-3/2<3/2$ while $f(-3/2)=-3/2>-17/2=f(3/2)$. Each component has a strictly increasing function, yet their outputs are ordered the wrong way across the gap. This function is neither a nondecreasing function nor a nonincreasing function on all of $D$; the mean value theorem cannot cross the missing interval.

Here $C^{\infty }([0,1])$ means the real- or complex-valued functions continuous on $[0,1]$, smooth on $(0,1)$, with every interior derivative having a continuous extension to the endpoints; endpoint values of derivatives are these extensions. On this space of smooth functions on a compact interval, defineThese finite-valued seminorms increase with $k$ and separate points. In fact every $p_k$ is a norm, since it includes $p_0(f)=\Vert f{\Vert }_{\infty }$. The terminology seminorm includes norms; it does not assert that every measurement has a nontrivial kernel of a seminorm. Smooth convergence means $p_k(f_n-f)\to 0$ for every fixed $k$, equivalently uniform convergence of every derivative separately. It does not demand one tolerance or one convergence index that works for all orders simultaneously. The maximum convention is equivalent to the derivative supremum norm convention using a finite sum, since $p_k(f)\le {\sum }_{j=0}^k\Vert f^{(j)}{\Vert }_{\infty }\le (k+1)p_k(f)$.

For a worked example, $f(t)=t^3$ gives $p_0(f)=1$, $p_1(f)=3$, $p_2(f)=6$, and $p_k(f)=6$ for $k\ge 3$. The linear functional $\ell (f)=f^{\prime \prime }(1/2)$ obeys $|\ell (f)|\le p_2(f)$ and is continuous. Similarly, differentiation is a continuous linear operator $D:f\mapsto f^{\prime }$ for smooth convergence, because $p_k(Df)\le p_{k+1}(f)$.

The space of smooth functions on a compact interval is complete for this seminorm topology. A Cauchy sequence has uniform limits $g_j$ for its derivatives of each order. Passing to the limit in the fundamental theorem of calculus identitygives $g_j(t)-g_j(0)={\int }_0^t{g}_{j+1}(s)ds$, so $g_j^{\prime }=g_{j+1}$ and $g_0$ belongs to the same space. This is the completeness of the smooth-function metric argument; the metric there and the increasing-$p_k$ metric above induce the same smooth topology and the same Cauchy sequences.

A deterministic finite automaton has exactly one automaton transition for every automaton state and input symbol. Formally, a DFA is a tuple $(Q,\Sigma ,\delta ,q_0,F)$: $Q$ is a nonempty finite set of automaton states, $\Sigma$ a finite alphabet, $\delta :Q\times \Sigma \to Q$ a function, $q_0$ the initial automaton state, and $F\subseteq Q$ the accepting automaton states. Its unique path on a word accepts if it ends in $F$ after consuming the entire input. Visiting $F$ earlier does not suffice.

For a concrete binary divisibility automaton, recognize the words whose values in the binary numeral system are divisible by three. Choose $Q=\{0,1,2\}$, $\Sigma =\{0,1\}$, $q_0=0$, and $F=\{0\}$. Each automaton state names the congruence class of the integer read so far. Appending a binary digit $b$ changes its value $n$ to $2n+b$, so the automaton transition isThe modular arithmetic therefore needs only three automaton states, whatever the input length. The full function is $\delta (0,0)=0$, $\delta (0,1)=1$, $\delta (1,0)=2$, $\delta (1,1)=0$, $\delta (2,0)=1$, and $\delta (2,1)=2$.

For $110_2=6$, the successive automaton states are $0\to 1\to 0\to 0$, so the word is accepted. For $101_2=5$, they are $0\to 1\to 2\to 2$, so it is rejected. Leading zeros are allowed: they leave the initial automaton state unchanged. We explicitly assign value zero to the empty word, which is accepted because the initial automaton state is accepting. This is a convention for a formal language, rather than a claim that ordinary written numerals include a blank numeral.

The generator checks every word of up to eight binary digits, comparing the final automaton state with the integer value modulo three. Each length $n$ includes all $2^n$ words, preserving leading zeros as distinct inputs:

All 511 checks agree. They are useful for catching a reversed arrow or mistaken label, but the reason the DFA works at every length is its invariant: after reading any word of value $n$, its automaton state is $n\mathrm{mod}3$. The update $n\mapsto 2n+b$ preserves that statement by mathematical induction. Through the extended transition function of a deterministic finite automaton, this becomes $\hat{\delta }(0,w)=\mathrm{value}(w)\mathrm{mod}3$.

If a real function has a finite derivative at $x$, its difference quotient tends to $f^{\prime }(x)$ and is bounded for sufficiently small nonzero increments. Multiplying it by the increment shows $f(x+h)-f(x)\to 0$, proving continuity at $x$. The converse fails: the absolute value function is continuous but not differentiable at zero.

Differential calculus studies derivatives: how a function changes near an input and how that local information describes its graph or evolution. Its tools include linear approximation, higher derivatives, and Taylor series; applications include finding velocity from position and studying optimization through critical points.