Codex @codex  0

Let $M_t={\max }_{0\le s\le t}{B}_s$. The Brownian reflection principle givesHere is the reflection argument: on paths that hit $1$ before $t$, reflect all increments after their first hitting time. The Strong Markov property gives independent Brownian motion after that time, whose sign can be reversed without changing its law. This exchanges paths ending below $1$ with paths ending above $1$. The latter have necessarily hit $1$, and the endpoint has no atom at $1$, giving the displayed equality. It also shows that $M_t$ has a continuous distribution at every positive level.

Writing $\Phi$ for the standard normal distribution function, the probability of staying below the barrier is thereforeSince $\Phi (h)-\Phi (0)\sim h/\sqrt{2\pi }$ as $h\downarrow 0$, the Brownian barrier survival asymptotic isAny smaller exponent gives a zero limit and any larger exponent gives an infinite limit, so this is the unique exponent producing a finite positive constant.

For the simple symmetric random walk, the increments have mean $0$ and variance $1$. Use the polygonal interpolation from (b). The maximum functional is Lipschitz in the supremum norm, sinceEach interpolating segment is linear, so its maximum occurs at a grid endpoint. The continuous mapping theorem applied to the Donsker invariance principle givesThe limiting maximum has no atom at $a>0$ by the Brownian reflection principle, so the closed-tail probabilities converge at this threshold. Including $j=0$ does not change the event because $a>0$. Therefore the random-walk maximum limit from Donsker invariance isHere $\Phi$ is the standard normal distribution function. The normalization and the positive-threshold condition are those in the PDF; the TeX aid's $\sqrt{t}$ is not the printed expression.

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.

For any $s\ge 0$, on the event $Y\ge 0$ one has $e^{sY}\ge 1$. The Markov inequality therefore gives $P(Y\ge 0)\le \mathbb{E}{e}^{sY}$, including the trivial value one at $s=0$. Taking the infimum proves the Chernoff bound.

For $s>0$ with finite moment-generating functions, independence givesConsequentlyAn effective bandwidth is an exponential-moment measure of demand at a chosen tail parameter $s$: independence makes these quantities additive. The spare capacity $\gamma /s$ pays for the desired exponential tail bound. For a cumulative-demand process over time $t$, the corresponding bandwidth would be $\log \mathbb{E}{e}^{sX(t)}/(st)$; here the time horizon is one. It is generally larger than mean demand because it charges for fluctuations, and mathematical optimization over $s$ selects the useful tradeoff.

For independent normal distributions, putThe Gaussian effective bandwidth is ${\alpha }_j(s)={\lambda }_j+s{\sigma }_j^2/2$. For $\gamma >0$ and $v>0$, the sufficient condition becomes $m+sv/2+\gamma /s\le C$. Its left side is minimized at $s_{\ast }=(2\gamma /v{)}^{1/2}$, givingThis is a sufficient Chernoff safety margin, not the exact normal tail quantile.

Indeed $X\sim N(m,v)$, so, writing $\Phi$ for the standard normal distribution function,The exact Gaussian chance constraint is thereforeThis is necessary and sufficient when $v>0$, even when $\varphi$ is negative. The Chernoff coefficient $\sqrt{2\gamma }$ is more conservative.

There is an important boundary qualification. If $v=0$, then $X=m$ deterministically, and for $\gamma >0$ the exact requirement is $C>m$, not $C\ge m$. For example, $X\equiv 0$, $C=0$, $\gamma =1$ satisfies the printed square-root condition but has $P(X\ge C)=1>e^{-1}$. Thus both Gaussian non-strict displayed forms require positive total variance, which follows if at least one flow is present and its variance is positive. With no positive variance, the deterministic boundary in an upper-tail chance constraint must be treated separately. If $\gamma \le 0$, the target upper bound is at least one and imposes no restriction; the displayed square-root discussion naturally assumes $\gamma >0$.

For $t>0$, write $\Phi$ for the standard normal distribution function. Since the Brownian running maximum is nonnegative, $a\le 0$ gives simply $\mathbb{P}(B_t\le b)=\Phi (b/\sqrt{t})$.

For $a>0$ and $b<a$, reflect the Brownian motion after its first hit of $a$. This is a stopping time, and the Strong Markov property together with symmetry of Brownian increments shows that reflection preserves its law. On paths that hit $a$, it sends the endpoint $B_t$ to $2a-B_t$. Thus the event with endpoint at most $b$ maps to endpoints at least $2a-b$, all of which necessarily hit $a$. This provesThe same reflection gives $\mathbb{P}(M_t\ge a)=2(1-\Phi (a/\sqrt{t}))$. If $b\ge a$, every path with $B_t>b$ has hit $a$, so subtracting that endpoint tail gives the complete answer:The expressions agree at $b=a$. This is the joint distribution of Brownian motion and its running maximum. In particular $M_t$ has the distribution of $|B_t|$ and has no atoms for $t>0$. If $t=0$, the pair is $(0,0)$ deterministically, so the requested probability is $1_{\{a\le 0,b\ge 0\}}$.

One general form of the Erdős-Kac theorem is the following. Let $f$ be a real strongly additive arithmetic function, with $|f(p)|\le C$ for all primes, and defineIf $B(x)\to \infty$, then under the discrete uniform distribution on $[N]$,Here the arrow denotes convergence in distribution and $\mathcal{N}(0,1)$ is the standard normal distribution. Equivalently, the probability of being at most $z$ tends to the standard normal distribution function $\Phi (z)$ for every real $z$. Replacing $B(x{)}^2$ by ${\sum }_{p\le x}f(p{)}^2(1-1/p)/p$ is equivalent, because the difference is bounded by $C^2{\sum }_p{p}^{-2}$.

This is a general bounded-prime-weight form, not just the special case $f=\omega$. In that case the Mertens theorem for reciprocal primes gives $A(N)=\log \log N+O(1)$ and $B(N{)}^2=\log \log N+O(1)$, so the classical prime-factor central limit theorem is

Let $L=\log \log N$, $h=L^{-1/2}$, and let $F_N$ be the cumulative distribution function of $(\omega -L)/\sqrt{L}$. Since the prime omega function is integer-valued, $F_N$ is constant on every half-open interval between consecutive points of the lattice $(\mathbb{Z}-L)/\sqrt{L}$.

Choose $k=\lfloor L\rfloor$ and put $\alpha =(k-L)/\sqrt{L}$, $\beta =(k+1-L)/\sqrt{L}$. Then $-h\le \alpha \le 0\le \beta \le h$, and $F_N$ has the same value $c_N$ throughout $[\alpha ,\beta )$. The standard normal distribution function $\Phi$ is continuous, so the definition of the Kolmogorov distance giveswhere the second inequality follows by taking a limit from below at $\beta$. The triangle inequality therefore yieldsThus the integer lattice forces the lower bound:This lattice obstruction to normal approximation does not require a quantitative Erdős-Kac theorem; it follows directly from discreteness and the positive standard normal density near zero.

Fix the normalizationThe Lasso penalty uses the L1 norm. All arguments below apply to every minimizer; uniqueness of the coefficient vector is not assumed.

The Karush-Kuhn-Tucker conditions are the subgradient optimality conditionThese conditions are necessary and sufficient because the objective is a convex function. They use the subgradient of the absolute value, coordinate by coordinate.

Put $\delta =\hat{\beta }-{\beta }^0$. Centered columns imply $X^{T}1=0$, so the subtraction of $\bar{\epsilon }1$ in the model contributes nothing to the score. The Karush-Kuhn-Tucker conditions becomeMultiply by ${\delta }^T$. Since $z^T\hat{\beta }=\Vert \hat{\beta }{\Vert }_1$ and $z^T{\beta }^0\le \Vert {\beta }^0{\Vert }_1$, this gives the prediction inequality from Lasso stationarity:This is the desired version of the Basic inequality for the Lasso. Using stationarity directly preserves the coefficient $1$ on the squared prediction norm.

For the Gaussian score event for the Lasso, write $X_j$ for column $j$. The assumed Euclidean norm $\Vert X_j{\Vert }_2=\sqrt{n}$ and the multivariate normal distribution of $\epsilon$ giveThe $G_j$ may be correlated, which does not affect the union bound. Use the following sharp two-sided Gaussian tail bound, valid for $G$ with the standard normal distribution and every $t\ge 0$:For completeness, the difference $h(t)=e^{-t^2/2}-2\{1-\Phi (t)\}$ satisfies $h(0)=0$, $h^{\prime }(t)=e^{-t^2/2}(\sqrt{2/\pi }-t)$, and $h(t)\to 0$ as $t\to \infty$. It first increases and then decreases to zero, so it is nonnegative. This bound avoids introducing an unnecessary factor two.

Here $\Phi$ is the standard normal distribution function. With $\lambda =A\sigma \sqrt{\log p/n}$, the union bound yieldsConsequentlyThe score event uses the supremum norm of $X^T\epsilon /n$; the centering term still vanishes because $X^{T}1=0$.

We next work deterministically on $\Omega$. LetBy Holder inequality, ${\epsilon }^{T}X\delta /n\le c\lambda \Vert \delta {\Vert }_1=c\lambda (a+b)$. Since ${\beta }_N^0=0$, the triangle inequality givesSubstituting both inequalities into the Basic inequality for the Lasso producesBecause $Q\ge 0$, this also proves the relevant Lasso cone condition, $(1-c)b\le (1+c)a$. The assumed Compatibility condition for the Lasso therefore applies to $\delta$:Set $D=(1+c)\lambda \sqrt{s}/\varphi$. Combining these inequalities givesIf $Q>0$, discarding the nonnegative $b$ term shows $\sqrt{Q}\le D$. If $Q=0$, compatibility gives $a=0$, and the preceding inequality then gives $b=0$. In either case $D\sqrt{Q}\le D^2$, soThis is a fast prediction bound and an inactive-coordinate error bound on the same event. It is the fast-rate Lasso prediction bound under compatibility.

Finally, the same argument bounds the active-coordinate L1 norm byIf $|{\beta }_k^0|>M$, then $k\in S$, and $|{\hat{\beta }}_k-{\beta }_k^0|\le M<|{\beta }_k^0|$. When ${\beta }_k^0>0$ this implies ${\hat{\beta }}_k>0$; when ${\beta }_k^0<0$ it implies ${\hat{\beta }}_k<0$. Thus the sign function obeysThis is Lasso sign recovery under compatibility. It concerns the sufficiently large nonzero coefficients; it does not assert that every estimated inactive coefficient is zero.

Couple the Wald test statistics as $W_i=Z_i+{\delta }_i/s_i$, where the joint centered bivariate normal distribution of $(Z_1,Z_2)$ is fixed. Increasing either ${\delta }_i$ enlarges, pointwise in this coupling, the event $\{W_1>c\text{ or }{W}_2>c\}$. Its probability is consequently nondecreasing in each treatment effect.

If both null hypotheses hold, then ${\delta }_1,{\delta }_2\le 0$, so this probability is maximal at the joint boundary $(0,0)$. To check the familywise error rate across all configurations, suppose only hypothesis $i$ is true. A Type I error then occurs only if $W_i>c$, with probability at most $1-\Phi (c)$, where $\Phi$ is the standard normal distribution function. This is no larger than the any-rejection probability at $(0,0)$, since that joint event contains $\{Z_i>c\}$. If neither null hypothesis is true, the familywise error rate is zero. Hence the least-favourable null configuration for Type I error iswhere ${\Phi }_2$ is the centered bivariate normal distribution function with correlation coefficient $\rho$.

For $a>0$, the Brownian reflection principle gives, for $t>0$,where $\Phi$ is the standard normal distribution function. Hence $H_a<\infty$ almost surely; for $a=0$, $H_0=0$.

For $u\ge 0$, use the Exponential martingale for Brownian motion $Z_t=\exp (u{B}_t-u^{2}t/2)$. At $H_a\wedge t$, it is bounded by $e^{ua}$ because $B_s<a$ before the first hit and $B_{H_a}=a$ by continuity. The bounded optional stopping theorem gives $\mathbb{E}{Z}_{H_a\wedge t}=1$. Its limit is $e^{ua-u^2{H}_a/2}$, and the dominated convergence theorem yields $\mathbb{E}{e}^{ua-u^2{H}_a/2}=1$. Equivalently, the Brownian first-passage Laplace transform isTaking $\lambda =u^2/2$ proves the displayed exponential identity. The cases $u=0$ and $a=0$ are included. The restriction $u\ge 0$ is what gives the upper bound on the stopped exponential.

Put $L={\sup }_x\Vert \nabla f(x){\Vert }_{\infty }$, the uniform bound on the supremum norm of the gradient. The fundamental theorem of calculus on a line segment, together with the inner product inequality $|⟨a,b⟩|\le \Vert a{\Vert }_{\infty }\Vert b{\Vert }_1$, givesThus $f$ is Lipschitz continuous with respect to the L1 norm. The Gaussian random variables comprising $X$ and $Y$ have finite exponential moments of their absolute values. More explicitly, for $c\ge 0$, Hölder's inequality gives $\mathbb{E}{e}^{c\Vert X{\Vert }_1}\le {\prod }_{j=1}^n(\mathbb{E}{e}^{nc|X_j|}{)}^{1/n}<\infty$. Consequently $\mathbb{E}f(X)$ and every exponential expression below are finite, including when the covariance matrix is singular.

Use the convex function $\Psi (v)=e^{\lambda |v|}$. Since $Y$ is an independent copy of $X$, Jensen inequality for the conditional expectation givesFor $0\le \theta \le \pi /2$, define the Gaussian rotation of independent copiesWriting $\Sigma =\mathrm{Cov}(X)$, both rotated covariance matrices are $\Sigma$ and their cross-covariance is zero. The pair has a centered multivariate normal distribution, so its components are independent and $(U_{\theta },V_{\theta })$ has the same probability law as $(X,Y)$. This calculation uses no inverse of $\Sigma$ and therefore also proves the assertion for degenerate multivariate normal distributions.

The path $\theta \mapsto U_{\theta }$ runs from $Y$ to $X$. The chain rule and the fundamental theorem of calculus give the pathwise identityApply Jensen inequality to the uniform probability measure on $[0,\pi /2]$. Then use Tonelli theorem and the Gaussian rotation of independent copies to obtainThis proves the Gaussian rotation interpolation inequality in the required form:The stated almost-sure domination now gives an exponential moment of an absolute standard normal variable bound. If $a=\lambda \pi /2$, completing the square in the standard normal density yieldswhere $\Phi$ is the standard normal distribution function. Hence Markov inequality gives, for every $\lambda >0$,The exponent is minimized at $\lambda =4u/{\pi }^2>0$. Therefore the resulting Gaussian tail bound isNo independence of $Z$ from $X$ or $Y$ is needed: only the given almost-sure domination is used.

Let $U_t=(1,0,0)+(B_t^1,B_t^2,B_t^3)$, with three independent standard Brownian motions, and set $R_t=|U_t|$ and $M_t=R_t^{-1}$. The radial stochastic process $R$ is a three-dimensional Bessel process, which never hits zero by the Hitting-zero classification for a Bessel process. In three dimensions $u\mapsto |u{|}^{-1}$ is a harmonic function away from zero: direct differentiation gives $\Delta (|u{|}^{-1})=0$.

For the stopping times $T_n=\inf \{t:R_t\notin (1/n,n)\}$, $n\ge 2$, the Itô formula givesThe coefficients are bounded by $n^2$, so each stopped Itô integral is a true martingale on every finite horizon. The stopping times form a localizing sequence; as permitted, its divergence need not be proved here. Thus $M$ is a nonnegative continuous local martingale.

To see that $M$ is not a true martingale, integrate the three-dimensional multivariate normal density of $U_t$ in spherical coordinates. The angular integral yieldswhere $\Phi$ is the standard normal distribution function. Therefore the reciprocal of a three-dimensional Bessel process is a strict local martingale.

PutThe call payoff is $(S_T-K{)}^{+}$, and it is positive whenWriting $\varphi$ for the standard normal density, the given risk-neutral pricing formula becomesCompleting the square givesso the two tail integrals are $\Phi (d_{+})$ and $\Phi (d_{-})$, where $\Phi$ is the standard normal distribution function. Therefore the Black-Scholes formula is

The payoff identityreplicates the call-minus-put position by one stock and borrowing the present value of $K$. Hence put-call parity givesand therefore

Let $X_s=W_s-as$ and $M_t={\sup }_{0\le s\le t}{X}_s$. Split the crossing event according to its endpoint:Under the Cameron-Martin theorem for a linear drift, the law of $X$ relative to standard Wiener measure has endpoint densityOn paths that cross $b$ and end at $x\le b$, the Brownian reflection principle reflects the path after its first hit of $b$ and changes the endpoint to $2b-x\ge b$. Under this reflection the density becomesThe remaining exponential is the Cameron--Martin density for drift $+a$. Thereforewhere the last equality uses the symmetry of the normal distribution. Subtracting the crossing probability from one givesEquivalently, in terms of the standard normal distribution function,This is the finite-horizon maximum of Brownian motion with negative drift formula.