The survivor function of a nonnegative event time is
Here the paper uses for the survival function, rather than for the cumulative distribution function; the latter is for a continuous distribution. The survivor function is nonincreasing, starts at 1 when there is no atom at zero, and tends to zero for an almost surely finite event time.
The intended monotone rearrangement is
Here is the quantile function of , agreeing with the ordinary inverse when is continuous and strictly increasing. With an atomless measure , its cumulative distribution function is continuous, and the probability integral transform makes uniform on for . Thus . The one-dimensional monotone rearrangement theorem says this transport map minimizes the cost for convex continuous , whenever the cost integrals are well defined. Values at exceptional endpoints may be chosen arbitrarily.
The printed assumptions omit an essential source condition. Invertibility of alone does not ensure an admissible transport map. For example, and a standard normal distribution satisfy the stated condition on , but is always a Dirac measure. There is no solution to the Monge optimal transport problem in this example. The boxed answer therefore requires the additional assumption that is an atomless measure, or an equivalent condition making the displayed map admissible. For arbitrary sources the always admissible monotone transport plan is , which need not be induced by a map.
Interpret the invertibility assumption on as continuity and strict increase on the relevant range, so that is an atomless measure. Suppose a non-decreasing transport map with exists. Then is also an atomless measure: if , the pushforward measure would give . Thus is continuous.
At any point where the non-decreasing representative is defined, the definition of a monotone function gives
Using the pushforward measure identity and continuity of the two cumulative distribution functions, we obtain
Consequently
The monotone rearrangement in part (c) is optimal for the convex difference cost, so has the same cost and solves the Monge optimal transport problem. The meaningful uniqueness is up to a -null set; arbitrary values away from the source do not affect transport or cost. Existence of the non-decreasing transport map supplies the source condition missing in part (c).
A simple choice is an independent Laplace distribution at each pixel, giving a Laplace prior for sparse images:
Its negative log density penalizes the L1 norm. Relative to a normal distribution, it combines a sharp peak at zero with heavier tails, allowing most pixels to lie near the background level while a few have appreciable intensity. Quantitatively, , so the expected number of appreciable pixels is . Choosing large makes this small. This is a simple sparsity model: it does not enforce that nearby active pixels form connected objects, nor does its continuous density give exact zero pixels positive probability. Additional spatial modelling would be needed to insist on contiguous shapes.
To sample, draw independent and use inverse transform sampling:
The endpoint events have probability zero and can be assigned arbitrary finite values. To justify the rule, the cumulative distribution function of a centered Laplace distribution is
The displayed rule is , so . Independence of random variables then gives the stated product prior distribution.
The quantile function is nondecreasing, hence a Borel measurable function. More explicitly, for every ,
Thus is a random variable, and because Lebesgue measure is being used on ,
Its cumulative distribution function is therefore , so
This is inverse transform sampling.
Since and a standard normal variable has second and fourth moments and ,
Thus has the chi-squared distribution with degrees of freedom and
Convergence in distribution means that the cumulative distribution functions satisfy at every continuity point of . The Lévy continuity theorem states that this is equivalent to pointwise convergence of characteristic functions to the characteristic function of , provided the limiting function is continuous at zero.
For fixed , independence and a Gaussian integral give
Using ,
Therefore , the characteristic function of the standard normal distribution. Lévy's theorem now gives
This derives the limit directly, without assuming the central limit theorem.
The scaled maximum
has cumulative distribution function for . Thus
The mean squared error of the maximum likelihood estimator is therefore
Each from the uniform distribution on has mean and variance . The sample mean is unbiased and has variance , hence
Let be independent standard logistic random variables and define the latent variable
Set exactly when . If is the logistic cumulative distribution function, its symmetry and the identity give
which is precisely the fitted logistic regression.
For a cumulative distribution function , its quantile function is the generalized inverse
with the infimum allowed to be . For observations , the empirical distribution function is
If are the order statistics, then
The Bennett inequality says that if are independent, , almost surely, and , then
To prove it, convexity of on , followed by the power-series bound for centered , gives
Independence and the Chernoff bound therefore yield
The minimizing value satisfies , namely . Substitution gives the stated exponent.
For independent , the uniform order statistic satisfies
Set . The event means that at least sample points lie in . If this occurs, some -element subset consists entirely of such points. The union bound gives
This is exactly the required inequality for .
Let be the homogeneous Poisson point process in with intensity measure , and map each point to its radius . For an interval , the pushforward measure of the intensity is
The Mapping theorem for Poisson point processes therefore shows that the radii form a Non-homogeneous Poisson point process with intensity function
If is the distance to the closest star, the event says that the ball of radius contains no points. The zero-count probability of a Poisson distribution gives
Differentiating its cumulative distribution function yields the probability density function
Conditionally on , the cumulative distribution function of is the weighted empirical distribution
For fixed , the strong law of large numbers gives, almost surely,
while
The ratio therefore converges almost surely to . This is precisely the claimed convergence in distribution of the self-normalized importance sampling resample.
Apply part (b) simultaneously at every rational ; the intersection of these probability-one events still has probability one. On that event, monotonicity and continuity extend the convergence from the rationals to every real .
More directly, fix . Since is a continuous cumulative distribution function, choose rational points
so that the two tails have and , while every increment . Part (b) makes at all these finitely many points for all sufficiently large . If , monotonicity gives
so ; the same estimate follows in the tails. This proves the uniform convergence of distribution functions to a continuous limit:
almost surely.
Differentiate the cumulative distribution function for , using and . The probability density function is
Its value at zero can be assigned arbitrarily without changing any probability. Although this probability density function diverges as , and there is no point mass at zero. Equivalently, has a gamma distribution with shape and rate one.
Since is nonnegative, its cumulative distribution function is zero for . For ,
The last equality uses the symmetry of the standard normal distribution. Thus
Differentiating the cumulative distribution function in part (ii) gives the probability density function on . Hence
Thus an unbiased estimator based on the sample maximum is
For , independence and the uniform distribution give
Therefore the cumulative distribution function is
It contains no , so is a pivotal quantity.
The cumulative distribution function must tend to one at infinity, so . Differentiation gives the probability density function for and zero for ; there is no atom at zero. This is an exponential distribution of rate one. Its first two moments are and , so
For , integration of the exponential distribution gives its cumulative distribution function:
For the event is empty and its probability is zero.