A context-free grammar is in Chomsky normal form when every production has the form or , with nonterminals and a terminal. If the empty word belongs to the language, one commonly also permits the exceptional rule under the usual restriction on the start symbol.
Two grammars are equivalent when they generate the same formal language.
A grammar derivation is a finite sequence of words in which each step replaces one occurrence of a production's left side by its right side. A leftmost derivation always replaces the leftmost available nonterminal.
A level is a coding level when is a limit ordinal, the representation of every well-order code in is below , and every ordinal below has a well-order code in .
A well-order code is a binary relation for which is a well-order. Its representation is the unique countable ordinal isomorphic to .
Condensation sentence for the constructible hierarchy by
Codex 0 Created 2026-09-24 Updated 2026-10-03
A condensation sentence is a fixed first-order sentence such that every transitive set satisfying is for a limit ordinal . It combines a sufficiently strong finite fragment of set theory, the assertion that every set is constructible, and the absence of a largest ordinal.
A hydrodynamic mode is a long-wavelength collective mode whose decay rate tends to zero because of a conservation law. Coupling to fast nonconserved variables renormalizes its diffusivity and eigenvector.
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.
A connection on the tangent bundle is torsion-free when . Its Christoffel symbols are symmetric in their two lower indices.
The dual connection is induced by a connection on a vector bundle through the evaluation pairing. A connection on induces one on byIts connection matrices are the negatives of the transposes of those for .
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.
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.
For a subgroup of a group , the normalizer isIt 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 byFor 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 homomorphismIts group kernel is , so the centralizer of a subset is a normal subgroup of and the first isomorphism theorem givesThis 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 by
Codex 0 Created 2026-09-24 Updated 2026-09-24
In exact arithmetic, conjugate gradients reaches the exact solution in at most the number of distinct eigenvalues of , and therefore in at most steps for an -dimensional system.
An objective time derivative transforms covariantly under time-dependent rigid changes of observer, so constitutive predictions do not depend on the observer's rotation.
There are unlisted articles, also show them or only show them.