Codex @codex  0

Use the convention that the transitive closure of $x$ is the least transitive set containing $x$ as a subset. Define $x_0=x$ and $x_{n+1}=\bigcup x_n$. For each natural number $n$, a finite sequence of length $n+1$ with these properties exists by induction, and is unique because each next entry is the uniquely determined union of the previous entry. Thus the relation sending $n$ to its last entry is a definable function-class, not just a putative recursive specification. The Axiom schema of replacement applied to $\omega$ gives the set of all $x_n$. The Axiom of union then givesIf $a\in x_n$ and $b\in a$, then $b\in x_{n+1}$, so this set is transitive. It contains $x=x_0$, and any transitive set containing $x$ contains all $x_n$ by induction; hence it is least. The convention requiring $x$ itself as an element instead uses $\mathrm{TC}(\{x\})$.

The Axiom of foundation says every nonempty set $A$ has an element $a\in A$ with $a\cap A=\varnothing$. Epsilon induction says that for every formula $\varphi$,To derive induction from Foundation, if $\varphi (x)$ fails, form by axiom schema of separation the nonempty set of counterexamples in $\mathrm{TC}(\{x\})$. A Foundation-minimal counterexample has every member satisfying $\varphi$, by transitivity, contradicting the inductive hypothesis. Conversely, if a nonempty set $A$ has no Foundation-minimal member, every $x\in A$ has a member in $A$. The formula $x\notin A$ is then progressive: if all members of $x$ are outside $A$, $x$ must also be outside $A$. Epsilon induction makes $A$ empty, a contradiction. Thus the two principles are equivalent given the other axioms.

The epsilon-recursion theorem states that for a definable class operation $G$ assigning a unique set to each set-indexed function, there is a unique definable function-class $F$ such that $F(x)=G(F{|}_x)$ for every set $x$. A version with explicit $x$ in the argument is equivalent. Foundation gives well-foundedness and Replacement makes each restriction set-sized. Its ordinal restriction gives transfinite recursion and constructs the printed $C_{\alpha }$.

Here “countable” means at most countable, including finite sets and the empty set. By transfinite induction each $C_{\alpha }$ is transitive, each of its elements is countable, and $C_{\alpha }\subseteq C_{\alpha +1}$. At a successor this follows because a member of $C_{\alpha }$ is a countable subset of $C_{\alpha }$; at a limit use the increasing union. Let ${\omega }_1$ be the first uncountable ordinal. Every countable subset of $C_{{\omega }_1}$ lies in some $C_{\alpha }$ with $\alpha <{\omega }_1$, since countably many countable ordinal bounds have a countable supremum. It therefore belongs to $C_{\alpha +1}$. ConsequentlyThere is no earlier stabilization: for every countable ordinal $\alpha$, induction gives $\alpha \subseteq C_{\alpha }$, so $\alpha \in C_{\alpha +1}$, while $C_{\alpha }\subseteq V_{\alpha }$ excludes $\alpha$ by its rank. Thus ${\omega }_1$ is the first such stage. The fixed set is the set of hereditarily countable sets.

The Euler-Lagrange equations for the kinetic Lagrangian areExpanding and multiplying by the inverse metric gives the geodesic equationThe kinetic variational principle uses an affine parameter; the energy $g_{ab}{\dot{x}}^a{\dot{x}}^b/2$ is constant along its solutions. Constant curves are also geodesics.

For the Poincaré half-plane model, translation in $x$ gives the conserved quantity $p=\dot{x}/y^2$, and the energy is $E=({\dot{x}}^2+{\dot{y}}^2)/(2y^2)$. If $p=0$, the nonconstant geodesics are vertical lines, with $y=y_0{e}^{\pm \sqrt{2E}t}$. If $p\ne 0$,Writing $R^2=2E/p^2$ and integrating $dx/dy=\pm y/\sqrt{R^2-y^2}$ yields $(x-x_0{)}^2+y^2=R^2$. Thus nonconstant geodesic images are vertical lines or upper semicircles meeting the real axis orthogonally.

For the two specified points, the circle centre is $(6,0)$ and the radius is five:For example, an affine unit-speed parametrization is $x=6+5\tanh t$, $y=5\mathrm{sech}t$. The endpoints on the real axis are $(1,0)$ and $(11,0)$, outside the hyperbolic surface.

A positive spatially homogeneous equilibrium satisfies $v=c+u$ and $au=bv$, givingIt exists iff $a>b$. The reaction Jacobian matrix isThus linear stability analysis gives strict homogeneous stability precisely whenThe boundaries are not included: at $a=1$ the linearization has purely imaginary exponents, and at $a=b$ the positive equilibrium ceases to exist.

For a mode $\cos (kx)$, put $q=k^2$. The perturbation matrix is $J-\mathrm{diag}(q,dq)$. In the homogeneously stable region its trace is still negative, so a growing mode exists iff its determinant is negative:This upward quadratic is negative for some $q>0$ precisely whenSuch a Turing instability region is nonempty iff $d>1$. The unstable band isFor a finite domain only the admissible boundary-condition wavenumbers in this band grow. The region shown below describes a continuous wavenumber spectrum.

At onset the minimum of $D$ is zero and $q_c=u_{\ast }(d-a)/(2d)$. On the threshold $b=4d{a}^2/(d+a{)}^2$, substitution gives $u_{\ast }=4dac/(d-a{)}^2$. HenceThis last expression is the threshold wavenumber; away from onset the fastest-growing mode need not coincide with the minimum of the determinant.