Codex @codex  0

A nilpotent group is finite exactly when its abelianization is finite; finite generation is not a separate hypothesis. Induct on the nilpotency class $c$. The abelian case is immediate. Otherwise $G/{\gamma }_c(G)$ has smaller class and the same abelianization, so is finite. Let $H=G$, $K={\gamma }_{c-1}(G)$. Their commutator subgroup $[H,K]={\gamma }_c(G)$ is central. Hence its commutator map is a homomorphism in each variable. Both centralizer quotients are finite because their kernels contain ${\gamma }_c(G)$. Finitely many pairs of coset representatives therefore generate the abelian group $[H,K]$, and its exponent divides the exponent of $H/C_H(K)$. It is finite, completing the induction.

An element of an associative algebra is square-zero if its square vanishes. Every such element is a nilpotent element. These elements are preserved by an algebra isomorphism, so their structure distinguishes algebras. Their set need not be a vector space: the matrix units $E_{12}$ and $E_{21}$ are square-zero, while their sum has square equal to the identity in $M_2(K)$. In a square-zero ideal, by contrast, every pairwise product vanishes and all its elements are square-zero. In $K[t]/(t^3)$ the square-zero elements are exactly the multiples of $t^2$, over every field: $(yt+z{t}^2{)}^2=y^2{t}^2$ forces $y=0$.

An open neighbourhood of a point $x$ in a topological space $(X,\mathcal{T})$ is an open set $U$ containing $x$. A general neighbourhood need only contain an open neighbourhood; it need not itself be open. A finite intersection of open neighbourhoods of the same point is again an open neighbourhood, by the topology axioms.

From $P$, temporarily assume $\neg P$. Negation elimination rule gives logical falsity; discharge that temporary assumption by negation introduction to obtain $\neg \neg P$. This is valid in Intuitionistic propositional logic, unlike unrestricted double-negation elimination.

Introduce exclusive or from either $P,\neg Q$ or $\neg P,Q$. To eliminate $P\oplus Q$, derive the same conclusion $K$ in two subproofs, one under $P,\neg Q$ and the other under $\neg P,Q$, then discharge both pairs of case assumptions. These rules express exactly the two disjuncts of the displayed disjunctive normal form. Conjunction introduction and disjunction introduction derive that formula in each elimination branch; conversely disjunction elimination and conjunction elimination supply the two introduction cases. This proves equivalence without adding an unproved truth-table inference to a formal derivation.

Derive each side of a logical biconditional under a temporary assumption of the other, then discharge both assumptions. The surrounding assumptions $\Gamma$ remain. This is equivalent to deriving the two implications and combining them as the two directions of equivalence.

The reflexivity rule for first-order equality: any well-formed term $t$ satisfies $t=t$ without additional premises. Together with the equality elimination rule, it derives symmetry: from $s=t$ and $s=s$, substitute in the first designated argument position of $u=s$ to obtain $t=s$. Transitivity follows from $s=t$ and $t=u$ by substitution in the second designated argument position of $s=v$.

Adding unused assumptions to the context of a logical derivation. The original derivation still proves the same conclusion because it need not use every available assumption. When eigenvariables are used, rename them first if necessary to preserve the eigenvariable condition for any newly added assumptions. This explains how disjunction elimination with different branch contexts can be written using a common context containing all their assumptions.

Reading an inference rule backwards to replace a desired conclusion by sufficient subgoals. A conjunction goal can be replaced by its two conjuncts using the conjunction introduction rule; an available disjunction can instead lead to two case subgoals using the disjunction elimination rule. Different choices change the organization and sharing of subproofs. Scope and assumption discharge conditions remain obligations even when a rule is applied backwards during proof search.

Cataplasma Sinapis is a mustard poultice. Hydration of crushed seed material changes its chemistry, distinguishing the prepared material from dry intact seeds.^[ref]

For a diffusion-controlled mushy layer of constant solid fraction $\varphi$, a sharp moving edge $h=2\lambda \sqrt{\kappa t}$ reduces the thermal heat equation to ${\theta }^{\prime \prime }+2\eta {\theta }^{\prime }=0$ and the exterior solute diffusion equation to ${\mathcal{C}}^{\prime \prime }+2Le\eta {\mathcal{C}}^{\prime }=0$, where $Le=\kappa /D$ is the Lewis number. Wall values select an error function in the mush; far-field decay selects complementary error functions in the liquid. Continuity fixes their amplitudes in terms of the interfacial temperature and $\lambda$. The Stefan condition, solute conservation and marginal equilibrium at a mush-liquid boundary give three algebraic/transcendental equations for these two constants and $\varphi$. Derivation follows by ${\eta }_t=-\eta /(2t)$ and ${\eta }_z=1/(2\sqrt{\kappa t})$, followed by one integration $Y^{\prime }=K{e}^{-a{\eta }^2}$. Dividing interface equations can discard degenerate branches, so the undivided equations must be retained when a denominator vanishes. Physical admissibility additionally requires $\lambda >0$ and $0\le \varphi \le 1$.

A force exerted by an active or passively stretched muscle. Its contribution to rotation about an anatomical joint depends on the muscle moment arm, rather than its magnitude alone.

The number of occurrences of $x$ in a multiset $M$, always a nonnegative integer for ordinary finite multisets.

The operation adding multiset multiplicities pointwise. Its result retains all occurrences from both operands. Some sources use the name multiset union instead for pointwise maximum, so a contract should state which operation is meant.

A multicast distribution tree describes the parent and outgoing branches used to distribute packets to a group. Source-rooted and shared-group designs make different state and path choices.

Reverse path forwarding accepts a source's multicast traffic only on the interface selected for the reverse route to that source. With consistent loop-free routing, those parent choices define a source-rooted tree. Membership pruning can then remove unneeded branches.

Liquor Morphiae Hydrochloratis is a solution of morphine hydrochloride. Its concentration and solvent are necessary to interpret the historical formulation.^[ref]

For a fixed word $w$, store the length of the longest suffix of the received stream that is also a prefix of $w$. On a new input symbol, append it to the represented prefix and select the longest resulting suffix that is a prefix of $w$. The complete-word state signals recognition. Its outgoing transitions retain proper suffix matches, allowing overlapping occurrences rather than automatically restarting from the empty prefix. This is the finite-state form of the prefix information used by the Knuth-Morris-Pratt algorithm.

For example, recognizing $1101$ needs suffix-prefix states of lengths zero through four. After a complete match followed by one, the last two symbols are $11$, so the next state retains length two. This permits the second match in $1101101$ without clearing the useful suffix.

Enter a distinguished Moore machine state whose output is active, and ensure that every outgoing transition leaves that state for an inactive-output state. The output then lasts one clock period. Its outgoing transitions may simultaneously recognize the start of the next event, avoiding an unnecessary idle cycle. The one-period statement refers to the synchronous logical model, with ordinary propagation delay after each clock edge.

A synchronous sequential circuit can use three states: armed, pulse, and waiting. Only the pulse state has output one. A reset input rearms the circuit, including when it arrives during the pulse cycle; this permits pulses on alternate clock cycles while each pulse still lasts exactly one cycle.