A point is generic for an invariant measure of a continuous map on a compact metric space if the displayed convergence holds for every continuous function . Its empirical probability measures converge against continuous test functions to . The same test-function condition may be used before invariance is known: the telescoping identity for then proves that the limiting Borel probability measure must be invariant. If almost every point is generic for the same measure, continuous approximation of invariant-set indicators proves that this measure is ergodic.
The colors here range over nonzero cardinals. The Erdős-Rado theorem for pairs makes this function total, and target and color monotonicity make it nondecreasing, with . If an uncountable cardinal is closed below itself under , then it is strong limit. Indeed, coloring distinct binary strings of length by their first differing coordinate uses colors and has no monochromatic triangle, so . If also has the tree property, the end-homogeneous tree for any has levels of size below and a cofinal branch; regularity makes one color occur times. Thus . This distinguishes function closure plus the tree property from the tree property alone.
For a coloring of -subsets of an ordinal, route a vertex through the least earlier vertices matching its colors on every -subset of previously chosen ancestors. The path stops when the vertex itself is selected. Common path prefixes agree, yielding a set-theoretic tree; a node at level is determined by its color table on . Along a branch, the color of an -tuple is independent of its last entry. If the domain has size and , levels below have size at most ; counting all those levels forces a branch of length . If the domain is a regular strong-limit cardinal , those levels instead have size below , and the tree property supplies a cofinal branch when needed.
Put for an infinite cardinal . Choose of size , containing all ordinals below , and closed under externally given sequences of length at most . Such a model is built by successive Skolem hull closures, since . For a coloring of with at most colors in , put . Recursively choose for , above all earlier points, so that every earlier -tuple has the same color with as with . There are at most constraints, their code belongs to by closure, and witnesses their consistency. The elementary embedding supplies the required witness in . The resulting sequence is end-homogeneous, providing the induction step in the Erdős-Rado theorem for finite arities.
On for compact Hausdorff , any complete norm making every point evaluation functional continuous is equivalent to the uniform norm. If converges in the new norm to and uniformly to , evaluation gives for every , so the identity map between the two Banach spaces has closed graph. The closed graph theorem and open mapping theorem make the identity and its inverse bounded. Completeness of the proposed norm is essential to this argument.
Bounded distortion of a Banach space Created 2026-10-14 Updated 2026-11-05
For equivalent norms and on an infinite-dimensional closed linear subspace , define its relative distortion on a further infinite-dimensional closed linear subspace by
The equivalent norms condition makes the denominator positive and the numerator finite. A Banach space has bounded distortion if one constant works for every such and every among the equivalent norms on : there is a further infinite-dimensional closed linear subspace with . The constant is uniform over renormings and starting subspaces; may depend on both.
This convention is expressed by saying that, for some finite distortion threshold, no subspace is distortable beyond that threshold. A block-subspace formulation additionally assumes a specified Schauder basis and tests further block subspaces; the basis must be stated rather than silently assumed.[ref]
The ratio is unchanged by multiplying by a positive scalar. Equivalently, on the selected there is such that . For , the distortion is exactly one, not one hundred. Allowing that rescaling is essential: distortion compares relative geometry rather than the arbitrary unit of length.
Relative to a Schauder basis, take the supremum over successive finite intervals whose minima belong to a specified hereditary family , and signs . If this supremum is bounded above by a multiple of the original norm and the family contains all singletons, it gives an equivalent norm. Composing two admitted signed interval projections costs at most a factor of two in this norm: split their nonempty intersections according to which interval supplies the later left endpoint. In each of the two resulting families the minima form a subset of one original list, so heredity preserves admissibility. This estimate lets bounded distortion of a Banach space give a uniform bound independent of the complexity of .
Two norms on a vector space give the same topology if and only if for some positive constants. Indeed, continuity of the identity at zero gives . For , apply this to to obtain . Reverse the roles of the norms for the lower bound. Conversely the two inequalities compare every translated open ball. This proof uses absolute homogeneity of a norm, not finite dimension.
Suppose a finite-horizon market has a strictly positive numéraire and an equivalent measure under which all prices are local martingales. The discounted wealth of a self-financing strategy is a stochastic integral against those prices. If it is bounded below by a deterministic constant, that wealth is a supermartingale: add the lower-bound constant to obtain a nonnegative local martingale, then apply conditional Fatou to a localizing sequence. A zero-cost admissible portfolio therefore has expected discounted terminal wealth at most zero. Nonnegative terminal wealth with positive probability of a strict gain would have strictly positive expectation under the equivalent measure, a contradiction. Thus there is no admissible arbitrage. True martingales are not needed for this implication.
Equivalence closure 2026-10-14
The equivalence closure of a binary relation is the least equivalence relation containing it. Add diagonal and reversed pairs, then connect points by finite chains. Constant chains prove reflexivity, reversed chains prove symmetry, and concatenated chains prove transitivity. Any equivalence relation extending contains every such chain endpoint by induction.
For two equivalence relations on the same set, their composite contains each and is reflexive. It is symmetric exactly when the relations commute. It is transitive exactly when , which by inversion is also equivalent to commutation. Under these conditions the composite is the smallest equivalence relation containing both. For congruences modulo on the integers, their composite is congruence modulo .
// Target: combinatorics.bigb
Composition of commuting equivalence relations Created 2026-10-14 Updated 2026-10-31
Using the left-to-right convention for composition of relations, two equivalence relations have an equivalence-relation composite exactly when . Its inverse is . Commutation gives , proving transitivity. Every equivalence relation containing contains their two-step composite, so this is their least common extension.
// Destination: combinatorics.bigb
New better than used in expectation Created 2026-10-14 Updated 2026-11-05
A nonnegative lifetime or claim law is new better than used in expectation if its mean residual life at every age with positive survival is at most its original mean. The displayed equivalent inequality says that its equilibrium claim-size distribution is no larger in stochastic order than the original law. For an Erlang distribution of shape two and rate one, the two survival functions are and , so the condition holds.
Equatorial wave velocity polarization Created 2026-10-14 Updated 2026-11-05
In dimensionless equatorial wave units with gravity wave speed and beta plane coefficient one, a Fourier mode obeys and . Inverting this two-by-two linear system gives the displayed wave polarization, provided . Inserting it in the meridional momentum equation gives the Hermite differential equation after a Gaussian factor is removed. At singular values the original equations, rather than these quotient formulae, determine whether a trapped mode exists.
For , adding exchanges the two outcomes of the same projective measurement. At an angle , the choices and therefore specify the same unordered pair of projectors: their labels differ by . An adaptive choice between these signs can be replaced by a fixed measurement and a classical label exchange. Together with Pauli-frame propagation along a measurement wire, this permits simultaneous measurements when all adaptive sign changes occur at these Clifford gate angles.
Extremal epimorphism 2026-10-14
An epimorphism is extremal when a factorization with a monomorphism forces to be an isomorphism. Every regular epimorphism is extremal: its coequalizer property factors back through , giving an inverse to . In a regular category, the converse follows by applying extremality to the regular-epi/mono image factorization.
Axisymmetric incompressible epicyclic wave Created 2026-10-14 Updated 2026-11-05
For and , pressure elimination gives and , where . The inviscid frequency is the radial epicyclic frequency times . With , is conserved when viscosity vanishes. In a Keplerian flow it bounds kinetic-energy amplification by four, whereas with zero rotation the same system has the algebraic lift-up effect.
// Target: turbulence.bigb
Class number one for discriminant minus sixty-seven Created 2026-10-14 Updated 2026-11-05
For negative discriminant , a reduced positive definite binary quadratic form satisfies and odd with . Checking leaves only under the boundary convention. The reduction algorithm for a positive definite binary quadratic form therefore puts every form in this one proper equivalence class. Its unimodular shears give infinitely many distinct forms .
Reduced forms of discriminant minus thirty-two Created 2026-10-14 Updated 2026-11-05
The reduced-form bound leaves . Checking and the boundary sign convention gives precisely the displayed forms. The middle one is imprimitive and represents the prime two. Odd represented primes are or modulo eight by the discriminant criterion for prime representation by a binary quadratic form. The first form represents only modulo eight among odd integers, and the last only , so a prime is represented by exactly when it is modulo eight.

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