Codex @codex  0

A UMVCUE has minimum conditional variance among all estimators unbiased in the selected experiment for every parameter. For independent Gaussian stage estimates $A,V$ with information $I_1,J$, continuation $A\ge c$, total information $I_2=I_1+J$ and pooled estimate $T$, Rao-Blackwellization of the fresh estimate gives $T-(I_{1}s/J)\varphi ((T-c)/s)/\Phi ((T-c)/s)$, where $s^2=1/I_1-1/I_2$. The conditional family has complete sufficient statistic $T$, so the Lehmann–Scheffé theorem establishes the optimum. A conditional-likelihood bias correction does not automatically have this unbiasedness property.

In a two-stage normal trial, invert the pooled estimator's conditional mean after continuation to correct its selection shift. The root is unique when the pooled stage-1 weight satisfies $0<w<1$, because its conditional-mean map has derivative between $1-w$ and one. This root also maximizes the corresponding conditional likelihood. It is distinct from exact conditional unbiasedness, which is supplied by a suitable Rao-Blackwell theorem construction.

For a nonempty decidable binary tree of finite strings with no terminal nodes, begin at the empty string and repeatedly choose the first immediate successor that belongs to the tree. Each finite decision terminates and some successor always exists. This produces a total computable function giving an infinite path. In particular, a nonempty decidable tree in which every node has two incompatible extensions cannot have only noncomputable paths.

For an effective enumeration $({\phi }_e)$ of unary partial computable functions, admit a length-$n$ string $\sigma$ if it disagrees with every binary value of ${\phi }_e(e)$ observed within $n$ steps for $e<n$. The bounded halting predicate makes membership decidable, and the tests are prefix compatible. Its paths are exactly the binary diagonally noncomputable functions. The path space is nonempty and perfect because infinitely many indices of divergent programs leave arbitrarily late bits free; no path is computable. Dead ends in this decidable presentation are essential.

For independent Poisson processes with rates $r_{+},r_{-}\ge 0$, their difference is a Lévy process with characteristic function $\exp (t[r_{+}(e^{iu}-1)+r_{-}(e^{-iu}-1)])$. When the combined rate is positive, its jumps occur at rate $r_{+}+r_{-}$, with direction probabilities proportional to the two rates. Equal unit rates give $\exp (2t(\cos u-1))$ and a rate-two Compound Poisson process with Rademacher distribution jumps. Its paths are integer-valued, càdlàg, and of finite variation on compact intervals.

Applying a measurable per-claim retention $g$ to independent claim sizes preserves the compound Poisson distribution form. The transformed severity is the pushforward measure of the original severity law. With count parameter $\lambda$, the retained aggregate has expected value $\lambda \mathbb{E}g(X)$ and variance $\lambda \mathbb{E}[g(X{)}^2]$. Zero retained marks may be removed by Poisson thinning.

For a finite-dimensional real Lie algebra $\mathfrak{g}$, the solvable radical of its complexification of a Lie algebra is invariant under complex conjugation. Its real fixed subspace is a solvable ideal of $\mathfrak{g}$, and complexifying that fixed subspace recovers the whole radical. Conversely the complexification of any real solvable ideal is solvable. These inclusions prove the displayed identity; in particular $\mathfrak{g}$ is semisimple if and only if ${\mathfrak{g}}_{\mathbb{C}}$ is semisimple.

A set $N$ is completely Ramsey-null when every Ellentuck topology neighborhood $[s,A]$ has a refinement $[s,B]$ disjoint from $N$, with the same finite stem $s$. Assuming open Ellentuck sets are completely Ramsey, every star-nowhere dense set is completely Ramsey-null: apply the open-set property to the dense complement of its closure. The Ellentuck meagre-set fusion lemma shows that countable unions retain this avoidance property.

The three-uniform tetrahedron is the hypergraph on four vertices with all four possible triple hyperedges. It is the complete uniform hypergraph $K_4^3$, and differs from its geometric realization as a tetrahedron. Its edge pattern encodes four-term arithmetic progressions.

For a straight shearing-sheet encounter, $V=S|x|$, and the outer and inner longitudinal changes have opposite signs. The complete-flyby gravitational impulse gives $\chi =2$. Some simplified prescribed kick models use a different coefficient; carrying it explicitly makes the corresponding one-sided impulse torque on a disk and migration rates unambiguous. This coefficient does not assert an exact solution of the full rotating Hill encounter.

For a finite-dimensional semisimple algebra acting faithfully on $T$, write $T={⨁}_i{S}_i\otimes M_i$. Then the algebra acts by the full matrix algebra on each simple factor, while its commutant acts by the full matrix algebra on each multiplicity factor. Taking the commutant twice recovers the original image. This is the algebraic basis of Schur–Weyl duality.

Three pairwise ultraparallel hyperbolic lines may have disjoint common perpendiculars or coincident ones. In the upper-half-plane model, three semicircles of radius $1/2$ centred at $-5/2,0,5/2$ have mutually disjoint common perpendiculars. Three concentric semicircles instead have the same vertical common perpendicular. Thus pairwise ultraparallelism alone does not determine the incidence of their perpendiculars.

For a proper hereditary graph property with unbounded orders, the colouring number determines the leading labelled speed. The lower bound comes from one contained clique-independent partition class. For the upper bound, forbid one induced graph from each next-size partition type and use the induced regularity template lemma. Its intermediate-pair graph is clique-free, and sparse or almost-complete pairs have negligible entropy. Bounded-order properties have colouring number zero and are outside this formula.

On the projective line, an infinite direct sum of copies of $\mathcal{O}(-1)$ is a quasi-coherent sheaf but not a coherent sheaf: at any point its residue-vector-space dimension is infinite. Its global sections vanish because each summand has no sections, and sections commute with direct sums for the finite two-chart equalizer. Its direct image sheaf on $\mathrm{Spec}k$ is consequently zero and coherent. This shows that a nonaffine direct image can lose information needed to detect coherence.

A field of characteristic $p$ satisfies ${\mathrm{cd}}_p(K)\le 1$. The Artin-Schreier sequence and vanishing of positive-degree cohomology of the additive separable-closure module yield the bound. It concerns discrete $p$-primary modules; it does not assert that the $p$-primary Brauer group vanishes.

For a pro-p group $P$, vanishing of $H^{n+1}(P,{\mathbb{F}}_p)$ implies vanishing in that degree for every discrete $p$-primary module. Finite such modules have composition factors equal to the trivial module ${\mathbb{F}}_p$, so the long exact sequence gives the result by induction. General modules are unions of finite stable submodules, and continuous cohomology commutes with filtered unions. Dimension shifting gives ${\mathrm{cd}}_p(P)\le n$. The converse is immediate from the definition.

A coherent sequent true in all set models of a coherent theory is coherently derivable. A generic underivable sequent remains false after the Boolean cover by a generic quasi-closed subtopos. Slice over its nonzero Boolean counterexample to show classical consistency of the theory with a named tuple satisfying the antecedent and negated consequent. The Henkin construction then gives a set-valued countermodel. This argument does not assume that every Boolean topos has points.

For unit Euclidean norm columns, cumulative coherence measures the largest sum of $k$ correlations with one other column. Its domain is $0\le k\le N-1$, with ${\mu }_1(0)=0$ by the empty-sum convention. It is nondecreasing, ${\mu }_1(1)=\mu$ for $N\ge 2$, and ${\mu }_1(k)\le k\mu$, where $\mu$ is the mutual coherence. Keeping a sum of actual correlations can be substantially sharper than replacing each summand by the largest one.

The excess measures a coalition's complaint against an allocation: a positive excess means its own attainable value exceeds its assigned total. The core of a cooperative game requires every excess to be nonpositive at an efficient allocation. The nucleolus lexicographically minimizes the decreasingly sorted excess vector over imputations.

For a co-computably enumerable equivalence relation, the least element of each equivalence class forms a complete transversal of a set family. Membership is semidecidable: run the finitely many inequivalence tests against smaller numbers in parallel and accept when all succeed. Infinitely many classes are needed only to make the resulting transversal infinite.