Threshold language 2026-10-31
For a fixed natural number and a standard encoding of natural numbers, validate the input and compare its encoded value with . This decides . A well-ordering argument can prove that an upward-closed set of natural numbers has this form without calculating its least element. A decider may contain that fixed least element in its finite description; its existence does not give a uniform method to discover the least element from another program.
A family of programming closures sharing a semantic environment that binds every name in the family. Each body therefore sees every family member, including those whose definitions occur later in the source.
Let be a nonzero polynomial of even degree over a field of characteristic different from two, satisfying the displayed reciprocal identity. If with , cancellation gives . Substitution of forces even. If with , cancellation gives ; substitution of forces even. Zero multiplicities are included. Pairing nonfixed reciprocal roots alone cannot prove this parity, because and are their own inverses.
Grace period 2026-10-31
An interval sufficient to establish that every reader that might retain a preexisting reference has left its protected read-side region. Completion permits the corresponding old object to undergo memory reclamation.
Register forwarding 2026-10-31
Sending an already produced result directly to a consumer without waiting for its write to the register file. The bypass must choose the youngest older writer whose value is ready.
Ray-triangle intersection 2026-10-31
A ray-plane intersection followed by an inside-triangle test, conveniently using nonnegative barycentric coordinates. Oriented surfaces may additionally require a front-facing hit through back-face culling.
Submodular rank function 2026-10-31
On a finite ground set , a submodular rank function is a normalised set function with , a monotone set function, and a submodular set function, such that for . Equivalently, require nonnegative integer values, monotonicity, submodularity and . The diminishing returns characterization of submodularity bounds each marginal by its singleton value. Thus .
These functions are precisely the rank functions of matroids. To see the converse direction, define . It contains the empty set. If , the unit marginal bounds give , so and heredity holds. For augmentation, suppose with . If every had zero marginal over , diminishing returns would keep each marginal zero as they are added successively. This would give , contradicting monotonicity. Some marginal is therefore one, giving an independent augmentation.
Finally any inclusion-maximal in this independence family has for every remaining . Successively adding them and using diminishing returns shows , so the resulting matroid really has rank . The forward direction is submodularity of matroid rank. These integer increment conditions distinguish matroid ranks from arbitrary real-valued submodular functions.
Continuous random variable Created 2026-10-31 Updated 2026-11-05
A random variable whose cumulative distribution function is continuous, equivalently whose probability distribution assigns zero probability to every singleton. In elementary applications, one usually additionally assumes a probability density function; that stronger property means its law is an absolutely continuous probability distribution. A continuous cumulative distribution function alone need not admit a probability density function.
On the symmetric small- branch of radial viscous flow in a wedge, the leading Stokes flow solves , zero wall values and unit integral. Hence
For , where , this is positive in and negative near the walls. The normalization denominator tends to zero at the stated root. At the root the homogeneous angular mode has zero net flux, so it cannot be rescaled to carry a fixed nonzero source flux.
Approaching that angle makes large outward and reverse contributions cancel to leave the prescribed flux. The leading amplitude diverges and the nonlinear inertial correction ceases to be perturbative, however small its coefficient is at fixed angle. This is a failure of a regular expansion, not a proof of infinite speed in the full Navier-Stokes equation. Distinct inner scalings or different steady branches require separate analysis.
Posterior interosseous nerve Created 2026-10-31 Updated 2026-11-05
The posterior interosseous nerve is the continuation of the deep motor pathway of the radial nerve in the forearm. It supplies many extensor muscles. Loss of these movements can occur without the cutaneous sensory loss expected from a more proximal radial-nerve lesion.
For a nonempty subset of a topological space , identify all points of and leave each point of in its own equivalence class. The resulting quotient space is denoted . For every subset , its saturation of a subset is
The quotient topology therefore gives a useful test: is a closed set if and only if the displayed saturation of a subset is a closed set of . In particular, every closed set disjoint from has closed image, even if is not closed. When is closed, is a closed map, because both possibilities in the formula are then closed sets for closed .
Circle modulo reflection 2026-10-31
Identify points of the circle having the same real coordinate, equivalently points related by complex conjugation. The continuous surjection has exactly these equivalence classes as its fibers. It induces a continuous bijection from the quotient space to the closed interval. The quotient space is compact as a continuous image of a compact space, while the closed interval is Hausdorff, so the compact-to-Hausdorff continuous bijection theorem makes the induced map a homeomorphism. The two fixed points of the reflection become the two interval endpoints.
A quotient space of a space carrying the cofinite topology has a topology contained in the cofinite topology on its underlying quotient set. If is the quotient map and is a nonempty open subset of , its preimage has finite complement. Since is surjective, the complement of is the image of that finite complement, hence is finite. Equality need not hold: partition into its even and odd integers. Both classes are infinite, so their two-point quotient space has the indiscrete topology, whereas the cofinite topology on a finite set is the discrete topology.
Suppose a group acts by isometries on a metric space , and for points in different orbits one has . Then the orbit space with its quotient topology is Hausdorff. Indeed, choose less than one third of this positive infimum and saturate the open radius- balls about and by the action. These saturated sets are open because every acting isometry is a homeomorphism. Their translates cannot meet: their centres stay at least the given positive distance apart. Their disjoint open images in the quotient separate the two orbit points, since the preimage of each image is its saturated set. This applies to the glide reflection on a closed strip: the distance from one point to the translates of another tends to infinity as the integer translation grows, so two distinct orbits have a positive minimum distance.
For a topological space , the displayed relation is an equivalence relation. Give its quotient the quotient topology. Every inverse image under a continuous map from to a Hausdorff space is a saturation of a subset. Distinct quotient classes can be distinguished by some such map; disjoint open neighborhoods of their images pull back to disjoint saturated open sets, whose quotient images are open. Thus the quotient is Hausdorff. Each continuous map from to a Hausdorff space factors uniquely through this quotient, and the factor is continuous by the quotient topology. This is its universal reflection property.
If an equivalence relation is closed in a space's square and the quotient map is open, the quotient is Hausdorff. An inequivalent pair has an open rectangle avoiding the relation. The two factor images are open quotient neighborhoods and are disjoint, since an intersection would give equivalent representatives in that rectangle. Conversely, a Hausdorff quotient always has a closed equivalence relation by pulling back its closed diagonal.
Subgroup correspondence theorem Created 2026-10-31 Updated 2026-11-05
For a normal subgroup of , projection to the quotient group gives a bijection between subgroups of containing and subgroups of . The maps are and inverse image under projection. Their two composites are identities because each relevant subgroup is a union of cosets of . They preserve inclusions and normality; consequently a composition series in a quotient lifts to a subnormal chain above with the same composition factors.
A quasi-steady-state approximation for enzyme-substrate complexes can remain useful when total enzyme and initial substrate concentrations are comparable. The relevant parameter can involve the sum , rather than alone. In a mechanism-based inhibition model with , bounded intermediate decay rates and an inactivation rate of order , the fast complexes adjust in a layer of scaled width . On bounded slow-time intervals the main complex follows the substrate, the later complex and accumulated inactivated enzyme remain , and the substrate has leading exponential depletion. An outer algebraic complex concentration does not satisfy the unbound initial condition inside that initial layer.
Dennis-Moré condition 2026-10-31
For a convergent quasi-Newton method sequence with , nonsingular , and continuous Hessian nearby, the displayed condition implies q-superlinear convergence. Here and . The condition requires Hessian accuracy only along the actual steps, rather than convergence of the full matrix approximations. It is associated with John E. Dennis and Jorge Moré.
Indeed, the first-order expansion of the gradient gives . Nonsingularity of gives locally. Consequently with . Rearrangement proves . Finite termination is understood separately from ratios with zero denominators.
Quarantine threshold in the SIR model Created 2026-10-31 Updated 2026-11-05
Consider the closed SIR model in count variables, with , , transmission coefficient and recovery rate . An ideal intervention stops all further transmission at the first upward crossing of . This is a mathematical contact-removal rule; its instantaneous perfect effect is an assumption of the model.
Before intervention,
so is a first integral of an ordinary differential equation. At the trigger, the remaining susceptible individual count is a root of an equation satisfying
This is a transcendental equation, with , rather than a polynomial equation.
For an initially growing outbreak with and , the unmodified SIR model reaches its infectious-count peak at , with
A trigger with is therefore reachable on this growth branch. The function is strictly increasing for , so the trigger equation has exactly one solution in . A threshold above is never reached; choosing another mathematical root would not describe the first upward crossing.
Once the assumed intervention stops transmission, recovery can continue but no longer changes. The number of new infections among those initially susceptible individuals is thus . The initial is excluded from that count. An intervention with residual transmission, or a model with unobserved exposed individuals, requires a different final-size calculation.

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