Horizontal lift Created 2026-09-24 Updated 2026-10-14
A horizontal lift is determined by the horizontal distribution of a principal connection or the corresponding connection on a vector bundle. A horizontal lift of a base curve is a curve in the bundle projecting to it and tangent to the horizontal distribution. In a local frame its fiber coordinate solves a linear ordinary differential equation.
Torsion-free connection Created 2026-09-24 Updated 2026-10-14
A connection on the tangent bundle is torsion-free when . Its Christoffel symbols are symmetric in their two lower indices.
Dual connection Created 2026-09-24 Updated 2026-10-14
The dual connection is induced by a connection on a vector bundle through the evaluation pairing. A connection on induces one on by
Its connection matrices are the negatives of the transposes of those for .
Curvature 2-form Created 2026-09-24 Updated 2026-10-14
The curvature two-forms are
Splitting sphere of a knot Created 2026-09-24 Updated 2026-10-14
A splitting sphere meets a knot transversely in two points. It is trivial when one of the resulting one-string tangles is boundary-parallel in its three-ball; otherwise it exhibits a nontrivial connected-sum decomposition.
Composite knot Created 2026-09-24 Updated 2026-10-14
One-particle-irreducible Feynman diagram Created 2026-09-24 Updated 2026-11-05
A one-particle-irreducible Feynman diagram is a connected Feynman diagram that remains connected after any one internal line is cut. The vertices of the quantum effective action generate precisely these diagrams.
Normalizer Created 2026-09-24 Updated 2026-10-14
For a subgroup of a group , the normalizer is
It is the stabilizer subgroup of under the conjugation action on subgroups. Its elements can permute members of ; they need not commute with them. For in the symmetric group , the cyclic subgroup has normalizer , although the centralizer of has only three elements, as illustrated in centralizer and normalizer.
Every element of preserves under conjugation, so . Moreover, is a normal subgroup of , and this is the largest subgroup of with that property. Indeed, any subgroup in which is a normal subgroup consists entirely of elements preserving under conjugation. In particular, exactly when is a normal subgroup of .[ref]
The orbit-stabilizer theorem counts distinct conjugate subsets of a subgroup by
For in , there is just one, since . For the subgroup , preserving forces its unique nonidentity element to stay fixed. Hence , and its three distinct conjugate subsets are , and . This is the subgroup counterpart of counting a conjugacy class with a centralizer: the object being stabilized determines which denominator belongs in the count.[ref]
The equality in the definition is essential. For a subgroup that is a finite group, an inclusion already gives equality by equal cardinalities. For an infinite subgroup, that inference can fail: conjugation might carry it onto a proper subgroup. The normal subgroup criterion is therefore, with the explicit hypothesis ,
No finiteness or commutativity assumption is needed. A normal subgroup is preserved as a set; its elements need not lie in the center of a group.
There is a second useful count, distinct from counting conjugate subgroups. The normalizer acts on itself by group automorphisms, giving the group homomorphism
Its group kernel is , so the centralizer of a subset is a normal subgroup of and the first isomorphism theorem gives
This quotient group records the different rearrangements of induced by the surrounding group. It gives a faithful group action on , but need not be the entire automorphism group of . For example, take the ambient group . Since is an abelian group, , so the quotient group is trivial; nevertheless is a nonidentity group automorphism of . Returning to the ambient symmetric group makes that group automorphism available through a reflection, and . Its two cosets are the three rotations and the three reflections.
The subgroup itself need not be contained in : their intersection is the center of a group . It is contained precisely when is an abelian group. Thus , which exists because is a normal subgroup of its normalizer, and answer different questions and should not be substituted for one another.
Finite termination of the conjugate gradient method Created 2026-09-24 Updated 2026-11-05
For a real symmetric positive-definite matrix , the conjugate gradient method reaches the exact solution in exact arithmetic after at most the number of distinct eigenvalues active in the initial error, hence after at most steps in dimension .
If those eigenvalues are , the polynomial satisfies and . This is an admissible error polynomial at step . Krylov-space minimization in the energy norm does at least as well, so its error must also be zero. Repeated eigenvalues and absent spectral components can make much smaller than .
The proof assumes exact arithmetic. Roundoff error can spoil exact conjugacy and create residual components absent in the ideal recurrence, so a numerical implementation needs an accuracy-based stopping criterion.
Krylov subspace Created 2026-09-24 Updated 2026-09-29
The order- Krylov subspace generated by and is
Objective time derivative Created 2026-09-24 Updated 2026-11-05
An objective time derivative transforms covariantly under time-dependent rigid changes of observer, so constitutive predictions do not depend on the observer's rotation.
Virasoro constraint Created 2026-09-24 Updated 2026-11-05
Residual conformal transformation Created 2026-09-24 Updated 2026-11-05
After conformal gauge fixing, independent reparameterizations and remain, accompanied by a compensating Weyl transformation.
Conditioned entropic Ruzsa distance of a summand Created 2026-09-24 Updated 2026-09-24
If are independent random variables in , then
Indeed, conditioning reduces entropy and independence give
In , , so conditional entropy under a deterministic change of variables shows that the left-hand side is unchanged when and are exchanged. Averaging the displayed bound with its exchanged version gives the result.
Simultaneous conditional entropic Ruzsa distance Created 2026-09-24 Updated 2026-09-24
The simultaneous conditional distance samples one value of the conditioning variable for both arguments:
It differs in general from , which uses two independently sampled conditioning values.
Rearrangement of a series Created 2026-09-24 Updated 2026-10-14
A rearrangement changes the order of a series without changing its multiset of terms. A conditionally convergent real series can be rearranged to approach any prescribed real limit or to diverge.
The Riemann series theorem specifies the possible sums of rearrangements of a conditionally convergent real series.
Alternating series test Created 2026-09-24 Updated 2026-10-14
If decreases to zero, then converges.
Sub-Gamma random variable in the right tail Created 2026-09-24 Updated 2026-11-05
A centered random variable is sub-Gamma in the right tail with variance parameter and scale parameter when
for .
Sub-Poisson random variable in the right tail Created 2026-09-24 Updated 2026-11-05
A centered random variable is sub-Poisson in the right tail with variance parameter when
for every .
Transport-entropy inequality Created 2026-09-24 Updated 2026-11-05
A transport-entropy inequality compares the cost of moving one probability measure to another with their relative entropy. For a nonnegative transport cost function and reference probability measure , define
where consists of couplings with those marginals. One common convention is for every probability measure ; the orientation of the relative entropy matters.
For a metric , with the measures having finite first moments, the convention is Wasserstein distance , while replaces by the second Wasserstein distance . The first convention bounds fluctuations of all 1-Lipschitz functions: . The choice of a squared distance or an unsquared transport cost function is part of the statement, rather than a universal normalization.[ref]

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