Uniformly Cauchy sequence Created 2026-09-24 Updated 2026-10-03
A sequence of functions is uniformly Cauchy when, for every , all sufficiently late pairs satisfy
Uniform limit theorem for uniformly continuous functions Created 2026-09-24 Updated 2026-09-24
A uniform limit of uniformly continuous maps between metric spaces is uniformly continuous. Approximate the limit at both endpoints by one fixed member of the sequence and use its uniform continuity between them.
Heine-Cantor theorem Created 2026-09-24 Updated 2026-09-25
Every continuous map from a compact metric space to a metric space is uniformly continuous.
Random unfriendly partition of a countable infinite-degree graph Created 2026-09-24 Updated 2026-10-14
Independently colour the vertices of a countable graph red or blue with equal probabilities. If every vertex has infinite degree, then each fixed vertex has infinitely many neighbours of each colour almost surely. A countable union of the exceptional null events is null, so such a colouring exists.
Unfriendly partition theorem for a countable locally finite graph Created 2026-09-24 Updated 2026-10-14
Take unfriendly partitions of an exhaustion by finite induced subgraphs and use a diagonal subsequence to stabilize the colour of each vertex. Local finiteness makes every neighbourhood stabilize after finitely many steps, so each unfriendly inequality passes to the limit.
Unfriendly partition theorem for a finite graph Created 2026-09-24 Updated 2026-10-14
Every finite graph has an unfriendly partition. In a maximum cut, moving any vertex to the other side cannot increase the number of crossing edges, which is exactly the required neighbour inequality.
Stone-Čech compactification of the natural numbers Created 2026-09-24 Updated 2026-10-14
The Stone-Cech compactification can be identified with the space of ultrafilters on . Its basic clopen sets are .
Nonprincipal ultrafilter Created 2026-09-24 Updated 2026-10-06
Principal ultrafilter Created 2026-09-24 Updated 2026-10-03
The principal ultrafilter at is . An ultraproduct by a principal ultrafilter is isomorphic to the factor indexed by .
Vertical normal modes of two equal suspended masses Created 2026-09-24 Updated 2026-09-24
For equal masses and spring constants , vertical displacements from equilibrium have stiffness and mass matrices
The two squared frequencies and displacement ratios are
Gravity shifts the equilibrium but does not enter these vertical frequencies.
Semiclassical action integral Created 2026-09-24 Updated 2026-09-24
The semiclassical action integral
is strictly increasing for a confining one-dimensional potential. Consequently the two-turning-point WKB quantization condition has at most one energy at each quantum number.
Normal ordering Created 2026-09-24 Updated 2026-10-14
Holomorphic stress-energy tensor Created 2026-09-24 Updated 2026-09-24
The holomorphic stress-energy tensor generates infinitesimal holomorphic conformal transformations through its operator product expansions.
Operator product expansion Created 2026-09-24 Updated 2026-10-14
An operator product expansion expresses the short-distance product of local operators as a sum of local operators multiplied by singular coefficient functions.
Rhombus-free edge bound Created 2026-09-24 Updated 2026-10-14
A graph-theoretic rhombus is two triangles sharing an edge. Every rhombus-free graph on vertices has at most
edges. If the graph is triangle-free this is Turán's theorem. Otherwise remove a triangle: every remaining vertex has at most one neighbor in it, and induction bounds the edge count by
.
Quadratic Turan edge bound Created 2026-09-24 Updated 2026-10-14
Every -vertex graph containing no satisfies
Positive-Fourier-transform L1 bound Created 2026-09-24 Updated 2026-09-24
If and , testing against triangular frequency cutoffs and using monotone convergence gives .
Triangle-free graph Created 2026-09-24 Updated 2026-10-06
Integrality of the transportation problem Created 2026-09-24 Updated 2026-09-24
Integer supplies and demands admit an integer optimum because an integer initial basis and every cycle pivot remain integer.
Transportation simplex algorithm Created 2026-09-24 Updated 2026-10-03
The transportation simplex computes row and column potentials, enters a negative-reduced-cost cell, and pivots around its induced alternating cycle.

There are unlisted articles, also show them or only show them.