Gauge invariance of the charged-particle worldline action by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Under , the interaction changes byFixed-endpoint equations of motion are therefore gauge invariant.
The preimage of a regular value of a smooth map between manifolds is a smooth submanifold whose codimension equals the dimension of the target.
This theorem characterizes a regular language by regular expressions and acceptance by a finite-state automaton. Kleene's theorem states that a language is denoted by a regular expression exactly when it is accepted by a finite automaton.
Conditional variance of a fixed regression-tree partition by
Codex 0 Created 2026-09-24 Updated 2026-09-24
In a string register machine, appends to register ; branches according to whether its final letter is ; tests emptiness; and branches to when empty, or deletes the final letter and branches to otherwise.
For a nonzero normal vector , reflection in has matrixIts eigenvalues are along and on , so its determinant is .
For a negative discriminant or , the class number is the number of proper equivalence classes of primitive positive definite integral binary quadratic forms of discriminant . Equivalently, it is the number of reduced primitive forms of discriminant .
For a reduced form of negative discriminant , the inequalities imply . One can therefore enumerate all classes by checking the finite setand retaining integral with and the boundary sign convention.
The Bell states and both have reduced state on either qubit. No measurement on one qubit alone can distinguish their relative sign.
A bipartite density operator is entangled when it is not a separable quantum state. For a pure state, this is equivalent to not being a product state, or to either reduced density matrix having rank greater than one.
A bipartite density operator is a product state when it factors as . A pure product state factors as ; its reduced density matrices have rank one and zero entanglement entropy. Mixed product states can have nonzero marginal Von Neumann entropy.
Domain and range characterizations of a nonempty computably enumerable set by
Codex 0 Created 2026-09-24 Updated 2026-09-29
For a nonempty set of words, the following are equivalent: is computably enumerable, is the domain of a partial computable function, is the range of a partial computable function, and is the range of a total computable function. The nonempty hypothesis is needed only for the last formulation, since the range of a total function cannot be empty.
Doubling minus an open ball along its spherical boundary gives . Its fundamental group isand its universal cover is .
Mapping-cylinder model of punctured real projective three-space by
Codex 0 Created 2026-09-24 Updated 2026-09-24
The complement of an open three-ball in is the mapping cylinder of the antipodal covering . It deformation retracts to and has boundary .
A projective Cremona transformation is a birational self-map of projective space, regular on complementary dense open subsets together with its inverse.
Composition of these birational self-maps forms the Cremona group.
There are unlisted articles, also show them or only show them.