In ZF, an injection yields an injective nonsurjective self-map by shifting to and fixing the complement. Conversely, if an injection omits , the natural-number recursion theorem defines . Any repetition would, after cancellation, put in the image of . Thus is injective. The argument uses no axiom of choice, even when some infinite sets are Dedekind-finite sets.
A database query has the same result when its ambient domain is extended while all input database relations are unchanged.
A decomposition of a relational schema whose component relational projections always reconstruct the original database relation by natural join, without extra database tuples.
Dependency-preserving decomposition Created 2026-10-31 Updated 2026-11-05
A decomposition in which the database integrity constraints can be enforced using constraints on individual component database relations, without computing their relational join.
Let map the unit disk conformally to a planar Darcy flow region, with at a point source of flux . With zero velocity potential on the boundary, the logarithmic source potential becomes . Differentiating the inverse map at fixed physical position gives , while . The boundary law therefore gives the displayed equation, for nonzero .
The vector is outward normal times arclength on . Consequently the equation gives the area growth law . For a circular map , it reduces to , and hence .
Cyclic operator has equal minimal and characteristic polynomials Created 2026-10-31 Updated 2026-11-05
On a -dimensional vector space, a cyclic vector gives a basis . Write and set . Then . Since polynomials in commute with , kills every basis vector, so . No nonzero polynomial of degree less than can kill , by linear independence. Hence the minimal polynomial is . The matrix in this basis is , and the characteristic polynomial of a companion matrix is as well.
CRC generator polynomial Created 2026-10-31 Updated 2026-11-05
The CRC generator polynomial is the agreed divisor used in a cyclic redundancy check. In the basic binary convention it is a monic polynomial of polynomial degree with . A nonzero error polynomial goes undetected exactly when .
This algebra gives useful detection guarantees. A single changed bit has and cannot be divisible by when . More generally, suppose the first and last changed bits span at most consecutive positions. Write with and . Since and are coprime polynomials, would imply , contradicting the polynomial degree bound. Every such error pattern is therefore detected.
If divides , every error changing an odd number of bits is also detected: its error polynomial satisfies , whereas every multiple of has value zero at .
Scalar action obstructs a cyclic module generator Created 2026-10-31 Updated 2026-11-05
If an algebra acts on a vector space only by scalar multiples of the identity, every vector generates at most a one-dimensional submodule. A higher-dimensional such module is therefore not cyclic. For example upper triangular -by- matrices act by the first diagonal entry on their first-row ideal. For this ideal is a noncyclic submodule of the cyclic regular module. Thus a submodule of a cyclic module need not be cyclic, even over a finite-dimensional algebra.
Along the antipodal two-cycle of , the Jacobian matrix is at both points. Its two-step periodic-orbit multipliers are squares of the roots of . The Jury criterion makes the cycle attracting precisely in the displayed interval, and repelling for . This stable family is distinct from the always unstable nonzero-sum cycles.
The nonzero-sum two-cycles of the cubic swap map exist for . Their two-step characteristic polynomial has trace and determinant as displayed. Since , one periodic-orbit multiplier exceeds one, proving instability throughout. The other crosses minus one at ; the cycles are saddles before that threshold and repelling afterwards. At they meet the fixed branches in an unstable subcritical-flip branch.
The alphabets assigned to participants determine their shared CSP events. An event in both assigned alphabets requires both participants; one assigned only to a single participant advances that participant. Replicated composition synchronizes all participants whose assigned alphabets contain the event.
CSP stable state 2026-10-31
A state with no outgoing CSP internal action. A CSP stable failure records a refusal only after such a state has been reached.
CSP external choice 2026-10-31
The first visible CSP event resolves the choice; the environment can select an event offered by only one branch. CSP internal actions can advance a branch without selecting it.
CSP internal choice Created 2026-10-31 Updated 2026-11-05
The process may internally choose either branch, independently of the environment's offered CSP events. Consequently it can have more CSP stable failures than the corresponding CSP external choice, despite having the same CSP traces.
Water of crystallization 2026-10-31
Water incorporated into the structure of a crystalline hydrate. Loss on drying can test hydration or excess moisture.
Recrystallization 2026-10-31
Purification by dissolving a crystalline chemical substance and forming new crystals under conditions that leave impurities in the mother liquor or permit their prior removal.
Linimentum Crotonis Created 2026-10-31 Updated 2026-11-05
Linimentum Crotonis is a croton-oil liniment. The diluted external formulation is distinct from the expressed seed oil itself.[ref]
Croton tiglium 2026-10-31
The botanical source of croton oil.

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