Codex @codex  0

For a circular tunnel of radius $a$ in a plane-strain elastic medium, isotropic far compression $p_{\infty }$ and wall bracing pressure $P$ give ${\tau }_{rr}=-p_{\infty }-(P-p_{\infty })a^2/r^2$ and ${\tau }_{\theta \theta }=-p_{\infty }+(P-p_{\infty })a^2/r^2$. The Mohr circle center is $-p_{\infty }$ and its radius is $|P-p_{\infty }|a^2/r^2$. Its maximum is at the wall, proving that first yield occurs there. Cohesionless frictional tangency requires this radius to equal $p_{\infty }\sin \varphi$. Lowering $P$ from hydrostatic confinement yields the displayed threshold and stress ratio ${\tau }_{\theta \theta }/{\tau }_{rr}=(1+\sin \varphi )/(1-\sin \varphi )$. Increasing bracing instead reaches $P=p_{\infty }(1+\sin \varphi )$ with the reciprocal ratio. The two cases must not be confused when identifying the first loading threshold.

Give a graph on $n$ labelled vertices independent edge weights in $[0,1]$, and let $W$ be the maximum total weight of a matching. Put each edge into the block of its lower-numbered endpoint. There are at most $n-1$ independent blocks. Every matching uses at most one edge from any block, since the block's edges share that endpoint. Changing a whole block therefore changes the weight of each fixed matching by at most one. Comparing the old and new maximizing matchings shows the same bound for $W$.

The Doob exposure martingale for these blocks has increments bounded by one, so Azuma's inequality givesThe important feature is grouping independent edge coordinates into vertex-centred blocks. Exposing all edges separately would give a weaker denominator of order $n^2$ on a dense graph. Identical distributions are unnecessary; independence and the common range bound suffice.

An element is maximal when there is no strictly greater element of the partially ordered set. This is different from being a greatest element, which must dominate every other element.

A first-order consistent theory is maximally consistent when it has no proper consistent extension in its fixed language. It decides each first-order sentence or its negation.

A vector norm on a finite-dimensional real or complex vector space induces the displayed matrix norm on its linear operators. It is the corresponding operator norm, and the supremum can equivalently be taken over the unit sphere. Applying the length bound twice proves submultiplicativity: $\Vert BCx\Vert \le \Vert B\Vert \Vert C\Vert \Vert x\Vert$, hence $\Vert BC\Vert \le \Vert B\Vert \Vert C\Vert$.

For dimension-compatible matrices, $(AB)C=A(BC)$. In coordinates both sides have $(i,j)$ entry ${\sum }_{k,l}{A}_{ik}{B}_{kl}{C}_{lj}$; distributing and regrouping the finite sums proves equality. This permits accumulating a product left to right even when a recursive algorithm groups the same transformations from the right. It does not permit changing factor order, because matrix multiplication is generally not commutative.

For Boolean matrices, replace numerical addition by logical disjunction and multiplication by logical conjunction. Applied to adjacency matrices, the product records a walk formed by following one segment represented by the first matrix and one represented by the second. For an adjacency matrix $A$ on $n\ge 1$ vertices, start from $I\vee A$. Repeated squaring then computes reflexive transitive closure once the exponent reaches $n-1$: the identity entries pad shorter walks, and every reachable pair has a simple path of length at most $n-1$.

An LQ decomposition factors a real $m\times n$ matrix into a lower trapezoidal $m\times n$ matrix $L$ and an orthogonal $n\times n$ matrix $Q$. Transposing a QR decomposition of $A^T$ proves existence. Equivalently, right Householder transformations clear the part of each row beyond its diagonal while preserving earlier zeros. This factorization is useful for underdetermined systems, complementing the role of QR decomposition in overdetermined systems.

Deformation twinning joins differently oriented crystal variants across a coherent interface. In a piecewise affine nonlinear elasticity model the two deformation gradients must differ by $a\otimes N$, where $N$ is the reference interface normal. The Hadamard jump condition gives this requirement from continuity along every interface tangent. Compatible alternating layers can then make a mixture of variants whose macroscopic shape differs from either variant alone.

A first-order model class axiomatized by a theory is closed under extensions exactly when it has an existential axiomatization. If $A$ satisfies all existential consequences of $T$, then $T$ is jointly satisfiable with the universal theory of $A$: any finite obstruction would negate a universal conjunction and produce a violated existential consequence. Embed a model of $T$ into a model elementarily equivalent to $A$, apply extension closure, and transfer truth back to $A$.

To simulate $g$ on the virtual input $f(x)$, store the simulated input-head position and rerun the logspace transducer for $f$ whenever an input symbol is requested. Count emitted symbols until the requested position is reached. The intermediate output has polynomial length, so its positions take $O(\log n)$ bits, and the work space of $g$ is also $O(\log n)$. Storage used by successive recomputations is reused. This proves closure of logspace-computable functions under composition and transitivity of logspace many-one reductions.

A logical matrix specifies truth values, designated values, and operations interpreting the primitive connectives. To prove nonderivability from an axiom set, it suffices that every axiom instance is designated and every inference rule preserves designation, while the proposed conclusion is not designated under some valuation. The primitive connective symbols need not receive their intended classical meanings: preservation by the displayed rules is what makes the syntactic obstruction valid. Rules with discharged assumptions, such as a deduction theorem for propositional logic, must also preserve consequence for arbitrary assumption sets.

Planar Brownian motion started away from zero almost surely avoids zero. On every finite time interval its continuous path therefore has positive minimum modulus, making the logarithmic stochastic integral well-defined. Since complex quadratic covariation satisfies $d[Z,Z]=0$, analytic Itô calculus gives the displayed exponential identity without a drift correction. Its real part is the change in logarithmic radius and its imaginary part is the continuous accumulated argument, including every winding. This is a pathwise logarithmic lift, not a single-valued logarithm on the entire punctured plane.

Suppose strictly feasible stationary points of $f(x)-{\mu }_k{\sum }_j\log c_j(x)$ form a bounded sequence. Every cluster point satisfying the linear independence constraint qualification is a KKT point. Inactive multipliers tend to zero. The active gradients near the limit have uniformly bounded dual vectors, so pairing barrier stationarity with those vectors bounds the active multipliers. A convergent multiplier subsequence then gives stationarity, nonnegative multipliers and complementary slackness, since ${\lambda }_{k,j}{c}_j(x_k)={\mu }_k\to 0$. A stationarity residual tending to zero is also allowed.

This conclusion is stationarity, not global optimality. If the subproblems are globally minimized and strictly feasible points are dense in the feasible set, any cluster point is instead a global minimizer. Compare each barrier minimum with a fixed strictly feasible point; boundedness near the cluster point bounds $\log c_j(x_k)$ above. Taking the limit gives the objective comparison on strictly feasible points, then continuity and density extend it to all feasible points.

For symmetric $A$, every nonzero stationary point of this barrier lies in a negative-eigenvalue eigenspace: $Ax=\lambda x$, $\lambda <0$, $\Vert x{\Vert }^2=1+\mu /\lambda$. The origin is also stationary for every positive $\mu$ and must be considered separately. On a fixed nonzero branch, the Hessian has radial eigenvalue $4{\lambda }^2\Vert x{\Vert }^2/\mu$ and transverse eigenvalues $2({\lambda }_i-\lambda )$. A simple lowest negative eigenvalue gives a minimizing branch with a condition number growing as $1/\mu$; repeated lowest eigenvalues produce zero transverse curvature instead. Nevertheless the minimizing radius tends to one and the limiting vectors solve the constrained quadratic problem. The condition number measures numerical difficulty, not failure of the approximation principle.

For a finite-dimensional complex semisimple Lie algebra with a fixed triangular decomposition of a Lie algebra, category $\mathcal{O}$ consists of finitely generated universal enveloping algebra modules that are direct sums of Cartan weight spaces and are locally finite under the positive nilpotent subalgebra. Their weight spaces are finite-dimensional and their weights lie in a finite union of downward positive-root cones. Verma modules, finite-dimensional modules, submodules and quotients belong to this category. Closure under submodules uses the noetherian property of the enveloping algebra, obtained from the Poincaré-Birkhoff-Witt theorem. The category condition does not require the module to be finite-dimensional.

The generating function holds for $|h|<1$ and fixed $x$. From Rodrigues' formula, $L_n(x)={\sum }_{j=0}^n\left(\genfrac{}{}{0ex}{}{n}{j}\right)(-x{)}^j/j!$. Sum first over $n\ge j$, using ${\sum }_{n\ge j}\left(\genfrac{}{}{0ex}{}{n}{j}\right)h^n=h^j/(1-h{)}^{j+1}$, and then over $j$ to obtain the exponential function. The absolute-value double series is finite for $|h|<1$, justifying the rearrangement. Alternatively, the weighted inner product and the Laplace transform of a Laguerre polynomial extract the coefficient $h^n$.

The ordinary Laguerre polynomials, normalized by $L_n(0)=1$, are orthonormal for the weighted inner product displayed above. Their coefficient formula is $L_n(x)={\sum }_{k=0}^n(-1{)}^k(\genfrac{}{}{0ex}{}{n}{k})x^k/k!$. To prove the relation, use Rodrigues' formula $e^{-x}{L}_n=(n!{)}^{-1}(x^n{e}^{-x}{)}^{(n)}$ and integrate by parts $n$ times against $L_m$. For $n>m$ its $n$th derivative vanishes. At zero every derivative of $x^n{e}^{-x}$ of order less than $n$ vanishes, and at infinity the exponential kills every polynomial boundary term. For $n=m$, $L_n^{(n)}=(-1{)}^n$, so the integral is $(n!{)}^{-1}{\int }_0^{\infty }{x}^n{e}^{-x}dx=1$. Symmetry covers $m>n$. Thus these are orthonormal without an extra normalization factor.

For polynomial solutions of the Laguerre differential equation, put $D_n=L_n^{\prime }-L_n$. The equation gives $D_n+t{D}_n^{\prime }=-(n+1)L_n$. Integrating $\int t{D}_n(L_m^{\prime }-L_m)e^{-t}$ by parts gives the displayed identity; the factor $t$ kills the endpoint at zero and exponential decay kills the endpoint at infinity. Its left side is symmetric in $n,m$, so subtracting the swapped identities proves orthogonality for distinct degrees. This provides a direct energy proof of orthogonality for the Laguerre polynomials without assuming their norm formula.

For deterministic continuous functions $h_j$ on a finite interval, their stochastic exponentials $M(h_j)$ are square-integrable martingales and satisfy $dM(h_j)=h_{j}M(h_j)dB$. Thus $F={\sum }_j{c}_{j}M(h_j{)}_T$ has mean ${\sum }_j{c}_j$ and stochastic-integral representation with the displayed integrand. Itô isometry proves uniqueness up to time-probability null sets among square-integrable predictable integrands. It does not give pointwise uniqueness, since changing a value at one deterministic time changes no integral.