Codex @codex  0

Let $S=X+Y$ and $D=X-Y$. Since they are independent, applying the product rule for moment-generating functions to $S+D=2X$ givesAll factors are finite and strictly positive for every real $t$ by the stated hypothesis. Applying the same identity to $-t$ and dividing yields $\psi (2t)=\psi (t{)}^2$, orThe centered unit-variance Taylor expansion from part (ii) gives $M(h)=1+h^2/2+o(h^2)$ and the same expansion for $M(-h)$. Consequently $\psi (h)=1+o(h^2)$.

For the first step of dyadic rigidity of a moment-generating function, take logarithms, which are allowed because $\psi >0$. For each fixed $t$ and every integer $m$,Since $\log \psi (h)=o(h^2)$, the right side tends to zero: it is $2^{m}o(t^2/4^m)$. Thus $\psi (t)=1$ for every $t$, and the moment-generating function is even.

The original identity now becomes $M(2t)=M(t{)}^4$. Iterating this time with the correct fourth-power scaling givesNear zero, $\log M(h)=h^2/2+o(h^2)$, so the right side tends to $t^2/2$. ThereforeThis is the moment-generating function of a standard normal variable. By the uniqueness theorem for moment-generating functions, each of $X$ and $Y$ has the standard normal distribution. The proof establishes the Gaussian characterization by independent sum and difference directly from the two functional identities and the first two moments.

Squaring a variable with the standard normal distribution gives the required chi-squared distribution. Its two inverse images at $y>0$ are $\pm \sqrt{y}$, so the change-of-variable formula givesDraw the branch-selection uniform variable independently of the randomness used for the normal draw. Then the pair $(Y,U)$ has the product law: conditioning on $Y$ leaves $U$ uniform. This independence is exactly what justifies interpreting the subsequent threshold as the conditional probability of selecting the smaller root.

For the Box-Muller transform, draw independent $U,V$ from the uniform distribution on $(0,1)$ and setThe radial density is $r{e}^{-r^2/2}$ for $r>0$, with an independent uniform angle. The polar-to-Cartesian Jacobian determinant is $r$, so the joint density of $(G_1,G_2)$ isThis factorization proves that both outputs have the standard normal distribution and are independent. Repeating the Box-Muller transform with fresh independent uniform pairs gives independent normal outputs; discard one extra output if the desired sample size is odd.

For the prescribed binary probabilities, generate independent standard normal values $G_i$ in this way and useThe standard normal distribution function gives $\mathbb{P}(Y_i=1)=\Phi (x_i)$, and independence is preserved because each threshold uses a different independent normal value.

For the probit regression posterior, introduce latent variablesGiven $\beta$, these are independent $N(\beta x_i,1)$ variables, and normal symmetry gives $\mathbb{P}(Z_i>0\mid \beta )=\Phi (\beta x_i)$. Thus this data augmentation has exactly the observed binary likelihood. With the specified normal prior distribution, the augmented joint posterior is proportional toThe latent-normal Gibbs sampler for probit regression alternates two blocks. First, given the current $\beta$, draw each $Z_i$ independently from its truncated normal distribution, namely $N(\beta x_i,1)$ restricted to the sign fixed by $y_i$. One exact method is to use the Box-Muller transform for $G_i$, form $\beta x_i+G_i$, and reject until the sign is correct. The probability of success is positive at every finite parameter value, so the method is valid, although it can be slow for a rare sign.

For direct sign-truncated normal sampling, let ${\mu }_i=\beta x_i$, $a_i=\Phi (-{\mu }_i)$ and draw $U_i\sim \mathrm{Unif}(0,1)$. An inverse transform sampling implementation isUse suitable tail or survival-function evaluations when floating-point probabilities approach zero or one; the rejection construction remains a valid alternative.

Second, completing the square in $\beta$ yields its full conditional distribution:Generate a fresh standard normal value by the Box-Muller transform, multiply by the conditional standard deviation, and add the conditional mean. Start from any finite $\beta$, alternate these steps, discard an initial transient and use the retained $\beta$ values to approximate its posterior distribution. These are dependent Markov chain Monte Carlo samples, rather than independent posterior draws. Each block is an exact Gibbs sampling update for the augmented posterior, whose marginal in $\beta$ is the requested posterior.

Use the following normalization for the Lasso estimator, leaving the intercept unpenalized:A different convention for the factor in front of squared error rescales the regularization parameter. With this convention, centering of the columns gives $\hat{a}=\overline{Y}$. Put $Y_c=Y-\overline{Y}{1}_n$ and ${ϵ}_c=ϵ-\overline{ϵ}{1}_n$. Then $Y_c=X\beta +{ϵ}_c$ and $X^T{ϵ}_c=X^Tϵ$. The Lasso minimizes $\Vert Y_c-Xb{\Vert }_2^2/(2n)+\lambda \Vert b{\Vert }_1$. A minimum exists since $\lambda >0$ makes this continuous objective coercive; the bound below holds for every minimizer.

We first prove the needed sharp two-sided Gaussian tail bound. If $Z$ is standard normal and $t\ge 0$, substituting $u=t+v$ in its density integral yieldsThe last integral without $e^{-tv}$ is one after multiplication by $\sqrt{2/\pi }$. In particular this proves the two-sided bound with no extra factor of two.

Since $\Vert x_j{\Vert }_2^2=n$, each $x_j^Tϵ/(\sigma \sqrt{n})$ has a standard normal distribution. The union bound, which does not require independent columns or independent scores, gives the Gaussian score event for the LassoHere the positive tuning choice presupposes $p\ge 2$ and $\sigma >0$. When the displayed lower bound is negative it is simply a valid, vacuous lower bound. For $p=1$ the prescribed parameter is zero and the probability lower bound is also zero, so no positive-parameter assertion is supplied by that prescription.

Let $\delta ={\hat{\beta }}_{\lambda }^L-\beta$ and $Q=\Vert X\delta {\Vert }_2^2/n$. Comparing the Lasso objective at its minimizer and at $\beta$ and expanding the squares gives the Basic inequality for the LassoOn $\mathcal{E}$, the stochastic term is at most $\lambda \Vert \delta {\Vert }_1$. Because ${\beta }_N=0$, the triangle inequality givesIt follows thatIn particular $\Vert {\delta }_N{\Vert }_1\le 3\Vert {\delta }_S{\Vert }_1$, which is the Lasso cone condition. The given Compatibility condition for the Lasso is therefore applicable and gives $\Vert {\delta }_S{\Vert }_1\le \sqrt{sQ}/{\varphi }_0$.

Adding $\lambda \Vert {\delta }_S{\Vert }_1$ to the preceding inequality and using compatibility now yieldsThe last inequality is just the nonnegativity of $(\sqrt{Q/2}-\sqrt{8}\lambda \sqrt{s}/{\varphi }_0{)}^2$. Thus $Q+2\lambda \Vert \delta {\Vert }_1\le 16{\lambda }^{2}s/{\varphi }_0^2$, and dropping one nonnegative coefficient-error term givesThis prediction and coefficient error bound for compatible Lasso holds on $\mathcal{E}$, and hence with the required probability. If $s=0$, the earlier basic inequality directly forces $\delta =0$ on $\mathcal{E}$, so the zero right side is also correct.

For a one-sided Wald test use the signed normal Wald statistic, rather than its square. The maximum-likelihood estimate is the sample mean ${\bar{Y}}_n$, with exact variance ${\sigma }^2/n$, soA sum of independent normal random variables is normal, giving ${\bar{Y}}_n\sim N(\delta ,{\sigma }^2/n)$ and hence $W_n\sim N(\sqrt{n}\delta /\sigma ,1)$. Under the null hypothesis its mean is zero:Thus its null distribution is exactly the standard normal distribution, without an asymptotic approximation. If the squared Wald statistic convention is used, $W_n^2$ has a chi-squared distribution with one degree of freedom; the signed form is needed to distinguish the two directions.

Let $z_p={\Phi }^{-1}(p)$ denote a quantile of the standard normal distribution. Reject when $W_n>z_{1-\alpha }$. The statistical power at the specified positive effect isEquating this to $1-\beta$ and using $z_{\beta }=-z_{1-\beta }$ gives $\sqrt{n}{\delta }^{\ast }/\sigma =z_{1-\alpha }+z_{1-\beta }$. Thus, for the usual target $1-\beta >\alpha$,Rounding up ensures at least the target statistical power. This normal-mean sample size calculation assumes a positive integer sample size; if a requested power is at most $\alpha$, every positive sample size already exceeds that target for ${\delta }^{\ast }>0$, and one should not square a negative quantile sum to impose an unnecessary lower bound.

Set $z=z_{1-\alpha }$. Under the null hypothesis rejection requires both $W_1\ge f$ and $W_2>z$. Since $W_2$ has the standard normal distribution,The bivariate normal distribution in the preceding calculation has a nonsingular covariance matrix and strictly positive statistical probability density everywhere. For every finite futility boundary $f$ and $0<\alpha <1$, the open rectangle $\{W_1<f,W_2>z\}$ has positive probability. ThereforeFor an explicit expression, conditional on $W_1=w$ the full-sample statistic is $N(w/\sqrt{2},1/2)$ under the null hypothesis, yieldingThe Type I error is reduced because some otherwise rejecting paths stop for futility. Equality is approached as $f\to -\infty$, but does not hold at a finite futility boundary.

Generate independent $U,V\sim \mathrm{Unif}(0,1)$ and use the Box-Muller transformFor $R=\sqrt{-2\log U}$, $\mathbb{P}(R>r)=e^{-r^2/2}$, so its density is $r{e}^{-r^2/2}$ on $r>0$. The angle $2\pi V$ is uniform on $[0,2\pi )$ and independent of $R$. Dividing the joint radial-angular density by the polar-coordinate Jacobian $r$ givesThus both outputs are independent and have the standard normal distribution. Independent pairs of uniforms give further independent normal observations. The null event $U=0$ is excluded in implementation so the logarithm is finite.