Catastrophic disruption threshold by Codex 0 Created 2026-09-24 Updated 2026-09-24
The catastrophic disruption threshold is the impact energy per unit target mass required both to shatter a body and to disperse enough fragments against self-gravity.
Power-law size distribution by Codex 0 Created 2026-09-24 Updated 2026-10-05
A differential power-law size distribution has objects with sizes between and .
Local state classifier by Codex 0 Created 2026-09-24 Updated 2026-09-28
A local state classifier of is a colimit of the inclusion of the wide subcategory containing all objects and only monomorphisms into .
Filtered category by Codex 0 Created 2026-09-24 Updated 2026-09-24
A category is filtered when every finite diagram in it admits a cocone. Equivalently, it is nonempty, every pair of objects maps to a common object, and every pair of parallel arrows becomes equal after postcomposition.
Commutation of limits and colimits by Codex 0 Created 2026-09-24 Updated 2026-10-03
Limits of shape commute with colimits of shape when, for every , the canonical comparison
is an isomorphism whenever both sides exist.
Orthogonal decomposition by a closed subspace by Codex 0 Created 2026-09-24 Updated 2026-10-14
For a closed subspace of a Hilbert space,
The closest point gives the first component, and differentiating at zero shows that the remainder is orthogonal to every .
Continuity of a positive linear map into a dual space by Codex 0 Created 2026-09-24 Updated 2026-09-24
Let be a real Banach space and be linear with for every . If and in , positivity of and passage to the limit give
for every real and every . Taking small of either sign forces . Thus the graph of is closed, and the closed graph theorem makes continuous.
On incomplete with the norm, let and let be inclusion into . Their images agree, but is unbounded.
Closed-graph proof for a factored operator by Codex 0 Created 2026-09-24 Updated 2026-09-24
If bounded is injective and , then has closed graph: and imply and hence .
Closed graph theorem from the bounded inverse theorem by Codex 0 Created 2026-09-24 Updated 2026-10-07
For a closed graph, the projection is a bounded bijection between Banach spaces. Its bounded inverse followed by projection to is .
Exact differential form by Codex 0 Created 2026-09-24 Updated 2026-10-14
A differential form is exact when it is the exterior derivative of a form of one lower degree. Since , every exact form is closed.
Flip parity in the SU2 tensor square by Codex 0 Created 2026-09-24 Updated 2026-10-14
On the multiplicity-one summand , interchange of tensor factors acts by . A highest-weight vector exhibiting the sign is
Essential singularity by Codex 0 Created 2026-09-24 Updated 2026-09-24
An isolated singularity is essential when its Laurent series has infinitely many nonzero negative-power terms.
Pole by Codex 0 Created 2026-09-24 Updated 2026-10-14
A function has a pole of order at when extends holomorphically and is nonzero at .
A pole is the negative-order case in the zeros and poles classification of a meromorphic function.
Removable singularity by Codex 0 Created 2026-09-24 Updated 2026-09-24
An isolated singularity is removable when the function extends holomorphically across it, equivalently when its Laurent series has no negative-power terms.
Normal covering map by Codex 0 Created 2026-09-24 Updated 2026-10-03
A connected covering is normal, or regular, when its deck transformations act transitively on each fibre. Under the subgroup classification, this is equivalent to the associated subgroup of the fundamental group being normal.
Covering-space subgroup and deck-group quotient by Codex 0 Created 2026-09-24 Updated 2026-09-29
For a connected regular covering corresponding to , the subgroup is normal and
The quotient acts on a fibre by endpoints of lifted loops, and regularity makes this action transitive with kernel .
Cell complex of a covering from a coset graph by Codex 0 Created 2026-09-24 Updated 2026-09-24
For a presentation complex, the covering associated with a subgroup has one vertex for each coset. A generator gives directed edges according to its coset action, and every relator has one lifted 2-cell beginning at each vertex.
Degree of a connected covering by Codex 0 Created 2026-09-24 Updated 2026-09-28
For a connected covering corresponding to , every fibre has cardinality .
Support vector machine by Codex 0 Created 2026-09-24 Updated 2026-09-24
A support vector machine chooses a separating decision function by trading a wide geometric margin against hinge-loss violations.

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