Codex @codex  0

Each row sum is a sum of $k$ independent random signs. For $s>0$, its moment generating function isFor example, $\log \cosh s\le s^2/2$ follows by integrating $\tanh s\le s$ for $s\ge 0$. Markov's inequality yields $\mathbb{P}(Y_j\ge t)\le \exp (-st+k{s}^2/2)$. Choosing $s=t/k$ gives $e^{-t^2/(2k)}$ for $t>0$. The distribution is symmetric, so the same bound applies to its negative tail. A union bound provesfor $t\ge 0$, including the trivial endpoint $t=0$.

For $p=1/2$ and $k={\log }_{2}n+\omega (n)$,If $\omega (n)\to \infty$, the mean tends to zero. Markov's inequality gives $\mathbb{P}(X\ge 1)\le \mathbb{E}X\to 0$, so $\boxed{\mathbb{P}(X=0)\to 1}$.

Take $k=k_0=\min \{j:j!\ge n\}$. Then $k\to \infty$ and $(k-1)!<n\le k!$. Also $k=O(\log n)$, because $j!\ge 2^{j-1}$, so the needed block lengths are below $n/2$ for large $n$.

If $L\ge k+1$, then $X_{k+1}\ge 1$. Markov's inequality givesFor $j=k-2$, the expected count satisfies $\mu =n/j!>k-1\to \infty$. Part (ii) bounds its variance by $2\mu$, so Chebyshev's inequality givesCombining the tails provesThe blocks are consecutive in the cyclic order throughout; this is not the longest increasing subsequence with arbitrary omitted positions.

This establishes the longest increasing cyclic run of a random permutation concentration bound.

Markov's inequality states that for $Y\ge 0$ and $t>0$, $\mathbb{P}(Y\ge t)\le \mathbb{E}Y/t$. It follows by taking expectations in $Y\ge t{1}_{\{Y\ge t\}}$.

If $X$ has finite mean $\mu$ and variance ${\sigma }^2$, apply Markov to $(X-\mu {)}^2$ to obtain Chebyshev's inequality:For the first moment method, assume ${\mu }_n=\mathbb{E}{X}_n\to 0$. Nonnegative integer values give $\{X_n>0\}=\{X_n\ge 1\}$, soFor a standard second moment method, suppose ${\mu }_n>0$ eventually, the second moments are finite, and $\mathbb{E}{X}_n^2/{\mu }_n^2\to 1$. Equivalently, $\mathrm{Var}(X_n)/{\mu }_n^2\to 0$. The zero event is contained in $\{|X_n-{\mu }_n|\ge {\mu }_n\}$, soHence $\boxed{\mathbb{P}(X_n>0)\to 1}$. The second-moment condition controls the fluctuations relative to the mean; a large mean alone is insufficient.

There are exactly $n$ summands in $S_n$, and the triangle inequality givesThe last step is convergence of arithmetic means of a sequence tending to zero. Thus $S_n/n\to 1$ in $L^1$, and Markov's inequality gives

First stop the solution on leaving $[-n,n]$, at ${\tau }_n$, and set $F_n(t)=\mathbb{E}{\sup }_{u\le t}|X_{u\wedge {\tau }_n}{|}^2$. The stochastic integral representation, the Doob L2 maximal inequality and the Cauchy-Schwarz inequality give, for $0\le t\le 1$,Here stopping ensures square integrability before the calculation, and $8{\sigma }^2+2t{b}^2\le 8({\sigma }^2+b^2)$ explains the constant. The Gronwall inequality gives $F_n(t)\le e^{8At}-1$. For globally Lipschitz functions as coefficients, the global existence theorem for stochastic differential equations with Lipschitz coefficients supplies a nonexplosive solution. Letting $n$ increase and using Fatou's lemma proves the slightly stronger maximal second-moment bound under linear growth:

For coefficients that are only locally Lipschitz functions, let ${\pi }_n(x)=\max (-n,\min (x,n))$ and replace the coefficients by $\sigma ({\pi }_n(x))$ and $b({\pi }_n(x))$. These are globally Lipschitz functions, agree with the originals on $[-n,n]$, and obey the same linear growth condition for an SDE, since $|{\pi }_n(x)|\le |x|$. The globally defined solutions agree until their common exits from $[-n,n]$ by pathwise uniqueness. The uniform preceding estimate and Markov's inequality implyPatch the solutions before their increasing exit times. Their limiting lifetime exceeds $1$ almost surely by this bound. Thus a pathwise unique strong solution exists throughout $[0,1]$ even for locally Lipschitz coefficients.

Use coordinates $1,2,3$ for paper, scissors and stone. Let $X^N$ take values in the lattice simplex $S_N=\{(n_1,n_2,n_3)/N:n_i\ge 0,{\sum }_i{n}_i=N\}$. A uniformly selected unordered pair consists of types $i$ and $j$, $i\ne j$, with probability $2n_i{n}_j/(N(N-1))$. Losing copies the winner, so the possible jumps of the continuous-time Markov chain areTies make no change. For arbitrary event rate $\lambda$, the respective transition rates are $2\lambda N{x}_1{x}_3/(N-1)$, $2\lambda N{x}_2{x}_1/(N-1)$ and $2\lambda N{x}_3{x}_2/(N-1)$. ChooseThen the rates are exactly $N{x}_1{x}_3$, $N{x}_2{x}_1$, $N{x}_3{x}_2$. The infinitesimal generator of this cyclic imitation chain iswhere $\mathcal{J}=\{e_1-e_3,e_2-e_1,e_3-e_2\}$ and the three $\beta$ functions are, in that order, $x_1{x}_3,x_2{x}_1,x_3{x}_2$. Its drift is precisely

Here is a precise fluid limit with its error control. Suppose $X_0^N\to x_0$ in probability, and let $x$ solve $\dot{x}=F(x)$, $x(0)=x_0$. For every finite $T$,Indeed, the martingale decomposition of a density-dependent jump process givesThis follows by compensating each transition count by its integrated rate; the compensated counts are square-integrable martingales, with variance equal to the expected compensator. Since $\Vert \ell {\Vert }^2=2$ and $x_1{x}_2+x_2{x}_3+x_3{x}_1\le 1/3$ on the simplex, the Doob L2 maximal inequality, applied coordinatewise, givesThe polynomial drift is Lipschitz on the compact simplex, with some finite constant $L$. It preserves the sum of the coordinates, and each coordinate solves an equation of the form ${\dot{x}}_i=x_i{h}_i(x)$, so nonnegativity is preserved. Thus the ordinary differential equation stays in the simplex and exists for all time. The Gronwall inequality giveswhich proves the claim by Markov's inequality. This proves the required version directly, rather than invoking an unspecified approximation theorem.

For an interior trajectory, differentiating the logarithm of the product of numbers givesThe same identity for the product itself holds on the boundary, so $x_1(t)x_2(t)x_3(t)$ is conserved. A strictly positive initial product keeps the deterministic trajectory away from the boundary. Except at $(1/3,1/3,1/3)$ these interior trajectories are periodic: the strictly concave function ${\sum }_i\log x_i$ has smooth compact level curves surrounding its unique maximum, and the vector field is nonzero and tangent to each such curve.

The finite Markov chain behaves differently at long times. For $P(x)=x_1{x}_2{x}_3$, the change in $P$ during the first jump isThe other two terms are cyclic permutations. Their first-order contributions cancel, leaving the exact product decay in a cyclic imitation chain identityFor $N\ge 3$, while all three counts are positive, their product is at least $N-2$, so $P(X_t^N)\ge (N-2)/N^3$. A missing type cannot reappear. If $\tau$ is the first loss of a type, thenOnce only two types remain, one always wins, so its count increases until an absorbing monochromatic vertex is reached, almost surely in finite time. The cases of one or two initially present types follow the same argument without the first stage. Every finite chain eventually becomes monochromatic, whereas an interior deterministic solution retains its positive product. The fluid limit holds on each fixed finite interval; it does not justify exchanging the limits $N\to \infty$ and $t\to \infty$.

Write ${\sigma }_{\epsilon }^2$ for the driving white noise variance and $\Theta (z)=1+{\sum }_{\ell =1}^q{\theta }_{\ell }{z}^{\ell }$. The autoregressive polynomial factors asThe discrete Gaussian white noise values are independent. The roots of $\Phi$ are outside the unit disc, so expanding $\Theta (z)/\Phi (z)$ gives an absolutely summable causal time-series representation. Hence $x_t$ is a centered Gaussian process formed from driving white noise values at times at most $t$. In particular, for $k>q$, every driving white noise value ${\epsilon }_{t-\ell }$ with $\ell \le q$ is independent of $x_{t-k}$. The autocovariance tail recurrence of a causal ARMA process follows by taking covariance of the recursion with $x_{t-k}$:

The roots of the characteristic polynomial of this tail recurrence are $1/2$ and $1/3$. Let $k_0=\max (q-1,0)$. There exist constants $c,d$ such thatFor example, put $a=6{\gamma }_{k_0+1}-2{\gamma }_{k_0}$ and $b=3{\gamma }_{k_0}-6{\gamma }_{k_0+1}$; then $c=2^{k_0}a$ and $d=3^{k_0}b$ reproduce the two starting values and therefore the whole recurrence. Choose $C$ strictly larger than $|c|+|d|$ and all the finitely many values $2^k|{\gamma }_k|$ with $0\le k<k_0$. Symmetry ${\gamma }_{-k}={\gamma }_k$ now givesFor negative $k$ this is stronger than the requested bound with $2^{-k}$. It also proves ${\sum }_{k\ge 1}k|{\gamma }_k|<\infty$.

For the Fourier calculation, take $D=2m+1$ positive and $T=DN$ positive. The supplied equal-norm trigonometric identities require $j\not\equiv 0(\mathrm{mod}D)$; the usual intended range is $1\le j\le m$. Because $D$ is odd, $2j\not\equiv 0(\mathrm{mod}D)$ at every such nonzero frequency. The geometric series of $e^{i\omega t}$ and $e^{2i\omega t}$ over $T$ terms vanish. They implyOther integer values of $j$ reduce modulo $D$; folding a negative frequency changes the sine coefficient only by a sign. The permitted zero frequency is handled below.

Grouping the double expectation sum according to the time lag yieldsReplace the two truncated sums for lag $k$ by full sums. Their total isEach replacement adds at most $k$ terms, each of absolute value at most one. This gives the finite-record Fourier covariance bound:Both coefficients have expected value zero, so this expectation is their covariance.

For each finite $T$, $(A,B)$ has a multivariate normal distribution because it is a linear transformation of the Gaussian observation vector. If the variances converge to $v_A,v_B$, its characteristic function converges tosince the cross-covariance tends to zero. This is the characteristic function of two independent centered normal variables; zero limiting variances are allowed.

We can calculate the variance limits rather than merely assume their existence. Grouping the cosine covariance sum givesOver a full record, ${\sum }_{t=1}^T{c}_t{c}_{t+k}=(T/2)\cos (\omega k)$. Truncation changes this by at most $k$. The same statements hold for the sine products. Consequentlyand the identical main term and bound apply to $\mathbb{E}{B}^2$. Absolute summability now gives

Specify the spectral convention to identify this limit. LetHere $f_2$ is the two-sided probability density function on $[-\pi ,\pi ]$, and $s$ is the one-sided probability density function on $[0,\pi ]$, satisfying ${\gamma }_k={\int }_0^{\pi }s(\omega )\cos (k\omega )d\omega$. Thus each variance limit is $f_2(\omega )=s(\omega )/2$. For this particular model, the filter representation also gives

For the specified squared-sum estimator, an exact expectation calculation uses $c_t{c}_u+s_t{s}_u=\cos (\omega (t-u))$:The missing tail and the $k/T$ terms vanish; indeed the bias is $O(T^{-1})$ by the exponential covariance bound. Therefore $I(\omega )$ is asymptotically unbiased for the one-sided probability density function $s(\omega )$. Under the common two-sided convention its limit in expectation is $2f_2(\omega )$, so $I(\omega )/2$ is the appropriately normalized estimator.

At an interior frequency with $s(\omega )>0$, the joint Gaussian limit gives the exponential limit of a one-sided periodogram:Moreover, for a centered Gaussian pair,The nondegenerate exponential limiting law rules out convergence in probability to $s(\omega )$. Thus the unsmoothed periodogram is not consistent at frequencies with positive spectrum, despite its asymptotic unbiasedness. If $s(\omega )=0$, the nonnegative estimator has expectation tending to zero and is consistent there by Markov's inequality. Smoothing an increasing number of nearby ordinates while shrinking the frequency bandwidth can remove the positive-spectrum variance obstruction.

For $j\equiv 0(\mathrm{mod}D)$, the sine coefficient is identically zero and the cosine coefficient is the normalized sum of the observations. The corrected limits areThe joint limit is $(N(0,s(0)),0)$, independent in the degenerate sense. The exact expectation formula for $I$ still applies and tends to $s(0)$, but now $I(0)/s(0)\stackrel{d}{\to }{\chi }_1^2$ when $s(0)>0$, with limiting variance $2s(0{)}^2$. The estimator is again inconsistent. This covers the zero frequency allowed by the printed inequality on $j$.

The figure uses the allowed cancellation $\Theta =\Phi$, so the observations reduce to white noise. Orthogonal Fourier projections give the exponential law exactly at each plotted record length; increasing the record does not narrow the individual periodogram ordinate.

The assertion with the same $\epsilon$ in the degree interval and the final colour bound is false as printed. Fix $r=2$, $\epsilon =1/10$, let $G=K_{22m+1}$, and take $D=20m$. Every degree is $22m=(1+\epsilon )D$, while every pair hypergraph codegree is one. For any proposed $\delta >0$, choose $m$ large enough that $1\le \delta D$. Nevertheless a matching in a graph contains at most $11m$ edges, whereas there are $(22m+1)11m$ edges in total. Thus every edge coloring requires at least $22m+1$ colours, exceeding $(1+\epsilon )D=22m$. The obstruction persists with arbitrarily small relative hypergraph codegree.

The meaningful asymptotic target separates the output tolerance from the input regularity error. For fixed rank $r$ and target $\eta >0$, choose a sufficiently small $\delta =\delta (r,\eta )$ and require degrees in $[(1-\delta )D,(1+\delta )D]$ as well as pair hypergraph codegrees at most $\delta D$. The semi-random method then gives ${\chi }^{\prime }(G)\le (1+\eta )D$. Here is the requested proof essay for that corrected conclusion, including its random rounds, tracking requirements and completion step.

A useful way to run all colour classes together is the auxiliary matching construction for hypergraph edge colouring. Use $K=\lceil D\rceil$ initial colours. Create a task vertex for each original edge $e$, and a resource vertex $(v,c)$ for each original vertex and colour. An assignment $(e,c)$ is an $(r+1)$-edge consisting of its task and the resources $(v,c)$ for all $v\in e$. A matching in a hypergraph in this auxiliary system is a proper partial colouring: a task cannot get two colours, and two edges sharing $v$ cannot use the same resource $(v,c)$.

The auxiliary task degrees are $K$, resource degrees are $d_G(v)$, and its pair hypergraph codegrees are at most $\max (1,\delta D)$. It is therefore nearly regular with small hypergraph codegrees. For $r\ge 2$ and a nonempty original hypergraph, the hypergraph codegree condition also forces $D\ge 1/\delta$; taking $\delta$ small absorbs rounding and ensures a large working degree. Rank one is immediate by assigning distinct colours to edges at each vertex.

The extra balance condition is important. Let $S_v$ be the set of tasks corresponding to edges through original vertex $v$. A matching in a hypergraph missing a small fraction of all tasks need not leave few tasks in each $S_v$. The Rödl nibble must leave at most $\beta D$ unmatched tasks in every such star, where one may choose $\beta =\eta /(4r)$. This local requirement, rather than just a global almost-perfect matching in a hypergraph, is what permits a cheap final edge colouring.

Run a Rödl nibble on the auxiliary system, whose rank is $s=r+1$. In a round of working degree $D_j$, sample each surviving assignment independently with probability $\alpha /D_j$, for a small fixed $\alpha$. Accept the sampled assignments that meet no other sampled assignment. Delete every auxiliary vertex touched by any sampled assignment, including conflicted ones, before proceeding. The accepted assignments are a matching in a hypergraph, and later assignments cannot reuse a consumed task or resource. Record each discarded but uncoloured task as waste; it must be counted in the final residual graph.

For an auxiliary vertex of degree $(1\pm \xi )D_j$, the probability of remaining untouched isFor an auxiliary edge through a surviving vertex, the other $s-1$ vertices survive with probability approximately $e^{-(s-1)\alpha }$. Their incident trial families overlap in at most $O_s(\delta D)$ trials by the hypergraph codegree bound, so the overlap error in this product calculation is small. This leads to the degree trajectorywhile the surviving fraction of task vertices is approximately $e^{-\alpha }$ per round. For a sampled assignment, a union bound over at most $s(1+O(\xi ))D_j$ conflicting assignments gives collision probability at most $s\alpha (1+O(\xi ))$. More explicitly, for a fixed task the expected number of ordered sampled conflict pairs having the first assignment through that task is at mostThis bounds its waste probability. Thus productive deletion is first order in $\alpha$, and collision loss is second order.

The technical tracking step makes these expected value calculations locally simultaneous and keeps their errors from accumulating. Its requirements are: residual auxiliary degrees stay near their trajectory after controlled pruning; each original star has the predicted number of surviving tasks; and every star's total collision and pruning waste is small. The standard probabilistic tools enter at distinct points.

Within a fixed round, task-survival indicators are independent: trial families for different tasks are disjoint, even when their assignments share resources. Conditional Chernoff bounds therefore control the number of surviving tasks in each star. Collision loss has short certificates consisting of pairs of selected intersecting assignments. The number selected through one resource has a binomial distribution of bounded mean. Chernoff bounds truncate these numbers at a suitable logarithmic cutoff; after truncation one trial has only a logarithmically bounded effect on the certified collision count. A certifiable function concentration bound, or a corresponding exposure argument, then controls loss in each star. These rare local overload events have polynomially bounded local dependency neighborhoods in the working degree, so the Lovász local lemma can select a simultaneous outcome independent of the total number of vertices.

Residual-degree counts require additional care because they are not sums of independent indicators. Two survival tests share at most a hypergraph codegree's worth of trials; expanding their joint probabilities bounds their covariance by the corresponding relative overlap. For a residual-degree count $Z$ with $D_j$ summands, overlapping summands and shared survival trials give a variance bound of the formChebyshev's inequality then bounds $\mathrm{Pr}(|Z-\mathbb{E}Z|>\xi D_j)$ by $C_s(D_j^{-1}+\zeta )/{\xi }^2$. This gives a small exceptional fraction when the relative hypergraph codegree is sufficiently small; it does not by itself make every degree good. The tracking argument records and prunes these exceptional configurations, bounding their contribution to each star by codegree-weighted exposure and the same local-loss bookkeeping. Markov's inequality controls exceptional mass, and repeated conditional concentration controls the retained counts. One must not apply an independent Chernoff bound directly to a residual degree or infer a uniform star bound just from a global expected loss. Keeping the pruning loss explicitly is the key distinction between a valid Rödl nibble argument and those shortcuts.

Choose the parameters in this order: first $r,\eta$ and $\beta$; next $\alpha$ so small that $s\alpha \log (4/\beta )\ll \beta$; nextand finally the initial regularity/hypergraph codegree tolerance $\delta$ small enough for all $T$ tracking and pruning errors. This is a bounded number of rounds depending on the tolerances, not on the graph order. After $T$ rounds, the surviving task fraction is at most approximately $\beta /4$, while accumulated collision loss is $O_s(T{\alpha }^2)=O_s(\alpha \log (4/\beta ))$. Reserving the remaining margin for tracking and pruning leaves at most $\beta D$ uncoloured edges at every original vertex. The working degree is still a fixed positive multiple of $D$, namely about $D{e}^{-r\alpha T}$, so the large-degree estimates remain applicable throughout.

Finally use a fresh palette on the residual original hypergraph. Its maximum degree is at most $\beta D$; an edge meets at most $r(\beta D-1)$ others. Greedy colouring therefore needs at most $r\beta D+1$ fresh colours. The total is at mostfor sufficiently large $D$, already ensured by choosing $\delta$ small. This completes the passage from the locally balanced Rödl nibble to the hypergraph chromatic index bound. The degree tolerance must be the small input parameter $\delta$; replacing it by the entire output allowance $\eta$ removes the slack and leads precisely to the complete-graph counterexample above.

For $x\in \Omega$ and nonempty $A$, letThe Talagrand convex distance isEquivalently,For completeness, let $v_{\ast }$ be a closest point of the finite convex hull to zero. If $v_{\ast }\ne 0$, minimality gives $v_{\ast }\cdot (v-v_{\ast })\ge 0$ for every $v\in V$. Taking $\alpha =v_{\ast }/\Vert v_{\ast }\Vert$ proves that the supremum is at least $\Vert v_{\ast }\Vert$. Conversely each permitted $\alpha$ has ${\inf }_{v\in V}\alpha \cdot v\le \alpha \cdot v_{\ast }\le \Vert v_{\ast }\Vert$ by Cauchy-Schwarz. The weights are nonnegative because the hull has nonnegative coordinates. If $v_{\ast }=0$, both sides are zero. This proves the dual definition used below.

We prove Talagrand's convex distance inequality by induction on the number of factors. Write $\Omega ={\Omega }^{\prime }\times X_n$, with measure $\mu \otimes \nu$, and $F_A=d_T(\cdot ,A{)}^2$. For a last-coordinate value $z$, let $A_z=\{y^{\prime }:(y^{\prime },z)\in A\}$. Choose a section $B=A_b$ of largest probability $m=\mu (B)>0$, and put $a_z=\mu (A_z)/m\in [0,1]$. The total event probability is $p=\mathrm{Pr}(A)=m{\sum }_z\nu (z)a_z$.

If $A_z$ has positive probability, combine mismatch vectors from $A_z$ and from $B$. A weight $t$ on the second section contributes at most $t$ in the last coordinate. Convexity of the squared Euclidean norm gives, for every $0\le t\le 1$,The last-coordinate contribution is actually zero if $z=b$, so the displayed upper bound remains valid. Hölder's inequality and the induction hypothesis yieldFor a zero-probability section use $t=1$ directly, so no division by zero or exponent of an infinite quantity is needed.

The scalar estimate for Talagrand product induction isHere is its proof. For $a>0$ set $L=-\log a$. If $L\le 1/2$, take $t=2L$; the logarithm of the left expression is $L-L^2$. Put $h(L)=\log (2-e^{-L})-L+L^2$. Then $h(0)=h^{\prime }(0)=0$ andsince $(2u-1{)}^2-u=(4u-1)(u-1)\ge 0$ for $u=e^L\ge 1$. Thus $h\ge 0$. If $L\ge 1/2$, choose $t=1$. The already proved boundary case gives $e^{1/4}\le 2-e^{-1/2}\le 2-a$. The same direct choice covers $a=0$.

Average the resulting section bounds over $z$:where the last inequality is equivalent to $(m-p{)}^2\ge 0$. The induction starts on the zero-coordinate singleton, where every positive-probability event is the whole space and the moment is one. HenceWe assume $\mathrm{Pr}(A)>0$; a zero-probability event has no finite right-hand bound to prove. Markov's inequality also gives

For the subsequence application, let $L(x)$ be the longest increasing subsequence length for independent sequence coordinates. A witness of length $\ell$ uses only $\ell$ positions. If $L(x)=\ell \ge b$ and $y$ satisfies $L(y)\le a<b$, at least $\ell -a$ witness positions must change: all unchanged witness positions remain in increasing order. Put weights $1/\sqrt{\ell }$ on the witness and zero elsewhere. The dual distance definition giveswhere the latter expression increases with $\ell$ for $a\ge 0$. Therefore the increasing-subsequence certificate concentration bound isIf the lower event has probability zero the conclusion is immediate.

Let $m$ be an integer median, so $\mathrm{Pr}(L\le m),\mathrm{Pr}(L\ge m)\ge 1/2$. Taking the two thresholds in the bound gives, for $t>0$,For $t>m$ the lower event is empty. In a nonempty sequence $m\ge 1$. Integration of these tails gives an explicit mean-median estimate: use $m+t\le 2m$ for $t\le m$ and $m+t\le 2t$ for $t\ge m$, obtainingWriting $\mu =\mathbb{E}L$, the median property also gives $m\le 2\mu$. Consequently, for a universal constant $C$, all $u\ge 0$ satisfyThus the subsequence length is concentrated near its mean on the scale $\sqrt{\mu }$, rather than the generic coordinate-exposure scale $\sqrt{n}$. This argument applies directly to finite-valued independent sequences. Independent continuous samples follow by refining finite coordinate discretizations; the strict-order pattern stabilizes almost surely when ties have probability zero. A uniform random permutation is the rank sequence of independent continuous samples, so it has the same subsequence-length concentration. Arbitrarily dependent random sequences are not covered by the product-space assumption.

For nontrivial positive claim sizes in the classical risk model and $\lambda >0$, the adjustment coefficient is the unique positive solutionIndeed, $h(r)=\lambda (M_X(r)-1)-cr$ has $h(0)=0$, $h^{\prime }(0)=\lambda \mu -c<0$, and is strictly convex. It becomes positive near the right endpoint of the moment-generating function domain. For a finite endpoint this follows from the assumed divergence; for an infinite endpoint, $\mathbb{P}(X\ge \epsilon )>0$ for some $\epsilon >0$ gives an exponential lower bound on $M_X(r)$, which eventually exceeds any linear function. Convexity gives existence and uniqueness of the positive crossing and $\lambda M_X^{\prime }(R)-c>0$.

Put $q=\lambda \mu /c$ and $\overline{F}=1-F$. Substituting $\phi =1-\psi$ into the supplied survival renewal equation for a classical risk model, and using ${\int }_0^{\infty }\overline{F}(x)dx=\mu$, yieldsMultiplying by $e^{Ru}$ gives the proper renewal-type equationThe exponential tilt of the ruin renewal kernel turns a defective kernel into a probability density function, because the tail integration identity givesThis identity follows also by integrating $e^{RX}-1=R{\int }_0^X{e}^{Rx}dx$ and applying Tonelli theorem. The tilted probability density function defines a nonarithmetic distribution, even if the claim size probability distribution itself has atoms.

Differentiate $(M_X(R)-1)/R$ to calculate its mean:It is finite and positive because $R$ is inside the finite moment-generating function domain. Next, reversing the order of integration givesThe forcing function is directly Riemann integrable. Choose $\epsilon >0$ with $M_X(R+\epsilon )<\infty$. Markov's inequality bounds $\overline{F}(x)$ by $M_X(R+\epsilon )e^{-(R+\epsilon )x}$, so $g_R(u)$ is bounded by a constant times $e^{-\epsilon u}$. It is continuous; on finite intervals continuity controls its Riemann sums, and the exponential envelope controls the tails. These are sufficient conditions for direct Riemann integrability.