Let denote the join of measurable partitions recording the first observations, and set , with . The entropy of a countable measurable partition is , using natural logarithms and . Null atoms can be discarded. Throughout, is a probability measure.
The stronger property needed for monotonicity of normalized block entropy is that its increments decrease. Define
Since conditioning reduces entropy, . The conditional entropy chain rule and measure preservation give
It follows that , and consequently
This uses stationarity as well as the entropy chain rule; subadditivity alone would not establish monotonicity of every successive ratio.
The entropy rate of a measurable partition and the Kolmogorov-Sinai entropy are, respectively,
One may equivalently take the supremum over countable finite-entropy measurable partitions.
The Shannon-McMillan-Breiman theorem states that for a countable measurable partition with , the normalized information
converges almost everywhere and in to a invariant function with integral . Here is the atom containing . If is an ergodic transformation, then almost everywhere. We prove the general form, including an explicit formula for its limit.
Let be the sigma-algebra generated by , let be trivial, and put . For every atom , the probabilities
form a bounded conditional-expectation martingale. The Martingale convergence theorem gives almost everywhere and in . Each of these probabilities is positive almost everywhere on : for example, integrating over the measurable set gives zero. Countability of lets us choose a common full-measure set for every atom.
The conditional information functions
therefore converge almost everywhere to . We need an integrable bound on this sequence; convergence of the probabilities alone would not supply one after taking logarithms. The allowed maximal inequality for conditional information functions gives, for ,
Combining this with the bound by and the tail integral formula for moments yields
Thus , and the dominated convergence theorem gives in . In particular,
because is the average of the decreasing sequence .
The information chain rule, applied from the final observation backwards, gives the exact identity
Indeed, the symbol at time is conditioned on times ; pulling that conditional probability back by gives . Measure preservation is sufficient for this pullback identity.
We now prove the required triangular ergodic averaging lemma in this instance. Put . Then almost everywhere, , and . Split the difference between the displayed triangular sum and . Terms whose index is at least are bounded by . The remaining terms are at most
After division by , each of these finitely many end terms tends to zero almost everywhere by the linear growth bound for integrable observables proved in Question 1. Applying the Birkhoff ergodic theorem to , for every fixed , therefore gives
These conditional expectations decrease to zero almost everywhere: they decrease, and their integrals tend to zero. Letting , then applying the Birkhoff ergodic theorem to , proves
For convergence, measure preservation gives the direct estimate
Combine this with convergence of the ergodic averages of . Finally, . In the ergodic case the invariant sigma-algebra is trivial, completing the familiar form of the theorem:
The Rudolph measure rigidity theorem has an essential ergodicity hypothesis. If a Borel probability measure on the circle group is invariant under both and , is ergodic for the semigroup generated jointly by these maps, and either map has positive Kolmogorov-Sinai entropy, then
Equivalently, a jointly ergodic common invariant measure other than Lebesgue measure has zero entropy for both maps. Joint ergodicity means that every set invariant modulo under both maps has measure zero or one. Positive entropy without this hypothesis is insufficient: , with a Dirac measure, is a common invariant measure of positive entropy and is not .
The Host equidistribution theorem states that if are relatively prime integers and is invariant and ergodic under , with , then for -almost every the sequence is an equidistributed sequence for Lebesgue measure. Explicitly, for every continuous on the circle,
The non-ergodic form assumes invariance and positive entropy for almost every component in the ergodic decomposition . Applying the ergodic theorem of Host on each such component gives the same almost-everywhere conclusion for . More generally, its conclusion holds on the part supported on positive-entropy components. A positive value of alone does not eliminate zero-entropy components.
To deduce the joint version of the Rudolph measure rigidity theorem, suppose ; if only has positive entropy, interchange the roles. Write the ergodic decomposition as . Since commutes with , its pushforward measure sends a ergodic component to a ergodic component . On each component, is a factor of a measure-preserving system with fibres of size at most three. We use the standard entropy preservation under a finite-to-one factor:
The reason for this standard entropy fact is that, conditional on a complete factor point, every finite orbit name has at most three possibilities; its conditional entropy is bounded by , and division by the orbit length gives zero relative entropy.
The component at is almost everywhere; this follows from commutation and the componentwise ergodic averages. The component entropy function is therefore invariant under both and . Joint ergodicity makes it constant almost everywhere, and affinity of entropy under ergodic decomposition identifies the constant as . Thus almost every component has positive entropy, exactly the condition required in the non-ergodic Host equidistribution theorem. It follows that -almost every point equidistributes for under .
For any continuous , invariance under and the dominated convergence theorem now give
Continuous functions determine Borel probability measures on the circle, so , proving the deduction.
For the normal-number example, let be independent fair binary digits and define
This Cantor Bernoulli measure is supported on the middle-third Cantor set . If is the Bernoulli shift, then on the circle. Consequently is invariant and ergodic: a invariant event pulls back to an invariant event, which has probability zero or one.
Take the ternary digit measurable partition . Its block partition of length has, up to null endpoints, positive-measure atoms under , each of measure , and all other atoms have measure zero. Hence
Apply the Host equidistribution theorem with , . For -almost every , the sequence equidistributes for Lebesgue measure, so is a normal number in base by normality and equidistribution under integer multiplication.
The ternary expansion of -almost every such contains only and , so the frequency of digit is zero rather than . The ambiguous ternary endpoints form a countable null set and can be removed. Therefore is not a normal number in base . We have proved the stronger almost-everywhere existence statement
The original PDF has and . The TeX transcription drops the expected value and absolute value in the first condition, and the absolute value in the second. The proof uses the PDF's conditions.
Because the stopping time is finite almost surely, almost surely. More strongly,
The first term tends to zero by hypothesis; the second does so by the dominated convergence theorem. Thus there is convergence in L1.
Here is the needed L1 convergence implies uniform integrability argument. For any integrable random variables and , splitting according to gives
Take and . For large , the first term is uniformly small by convergence in L1, and the second is small for large by integrability. The finitely many remaining are handled individually by integrability. Hence the stopped process is uniformly integrable. This proves the stopped-martingale uniform integrability criterion; the martingale assumption is not needed for this particular implication.
Write and . Since is a stopping time, . The Tonelli theorem, conditional expectation, and (c)'s tail-sum formula for expectation yield
Thus is an integrable random variable. Since , telescoping gives and . The dominated convergence theorem gives , so (b) gives uniform integrability of the stopped martingale.
The optional stopping theorem at the bounded stopping time gives . Passing to the limit using the convergence in L1 proved in (b),
One can also pass directly by the dominated convergence theorem, since .
Put and . The constant-in-time coefficient on is previsible, so the ratio minus is . Since , continuity and the dominated convergence theorem imply
The Itô isometry gives . For , use the Chebyshev inequality and the normal distribution of to obtain
First let , then ; the normal distribution has no atom at zero. This proves
No independence between and the denominator is needed.
The first estimate suggested by the hint is valid: Brownian scaling and the Gamma function give . The second hint requires care about the placement of its expectation: with , the interpretation is correct by the Jensen inequality and the Itô isometry, whereas the interpretation is false with constant . For the latter interpretation, the Burkholder-Davis-Gundy inequality supplies a constant instead. One can see the obstruction with a Brownian motion stopped on exiting : if is that Brownian exit time, then , , and strict Jensen inequality gives .
This obstruction also survives the continuity condition on . On a long finite interval approximate by a continuous adapted process equal to until and decreasing linearly to during the next units of time, and take its initial value to be by inserting a short continuous ramp before starting the exit experiment. The Itô isometry controls these approximations, and letting the interval length tend to infinity recovers the strict inequality above; hence some bounded continuous adapted example also violates the latter interpretation with constant . The direct proof avoids relying on this ambiguous hint.
Use the standard definition of a local martingale, including an integrable initial value, and let be a localizing sequence. If , the Fatou lemma gives . For , the Conditional Fatou lemma gives
For clarity, the Conditional Fatou lemma itself follows by setting for nonnegative , applying the conditional version of the monotone convergence theorem to , and observing . Hence a nonnegative local martingale is a supermartingale.
If simultaneously for all , with a deterministic , the dominated convergence theorem applied to the stopped martingale identity gives, for each ,
This is exactly the conditional expectation identity, so a bounded local martingale is a true martingale. The same proof works for deterministic bounds on every finite time interval; merely having a finite random pathwise bound supplies no dominating integrable random variable and is a different convention.
The usual quadratic variation convention includes . If are two continuous finite-variation processes with such that and are continuous local martingales, then is a continuous local martingale of finite variation. It must be constant, and its initial value is zero, so up to indistinguishability of stochastic processes.
Here is a proof of the fact used. Subtract the initial value of a continuous local martingale of finite variation, and stop so that both and its total-variation process are bounded by deterministic constants. The stopped local martingale is a bounded true martingale, so orthogonality of its increments gives, on any deterministic partition of an interval of ,
Continuity and the dominated convergence theorem justify the last limit. Remove stopping and use continuity on a countable dense set of times to conclude .
As literally printed, uniqueness is false without normalization. If works then also works for any deterministic constant , since subtracting a constant preserves the local martingale property; this is a genuine omitted convention.
With normalization, existence always holds for a continuous local martingale. Its quadratic variation , obtained as the limit in probability of squared increments, is continuous, increasing, starts at zero and satisfies is a continuous local martingale, so taking supplies the required finite-variation process.
Let be a localizing sequence for the discrete-time local martingale . For , the increment of the stopped martingale is
and . Thus, for any ,
The assumed integrability gives the dominating random variable . The dominated convergence theorem now yields , or . Iterating the tower property of conditional expectation proves an integrable discrete-time local martingale is a true martingale. The proof uses the discrete-time increment indicator; the conclusion does not extend to continuous time.
Fix a singular system of a compact operator, with and , . A spectral regularization method has the form
It annihilates . Standard sufficient spectral filter conditions are boundedness of for each , pointwise as for , and a uniform bound on . These give bounded linear operators and convergence on the domain of the Moore–Penrose inverse of an operator by the Picard criterion and dominated convergence theorem.
For Tikhonov regularization,
This can be computed by solving the Tikhonov normal equation, without knowing the singular value decomposition.
For spectral cutoff regularization, take
with value zero at . Only singular values are inverted. Here multiplies ; conventions calling the full coefficient the spectral filter are equivalent.
For Iterated Tikhonov regularization, set and . In a singular system of a compact operator, each coefficient obeys
Summing this geometric recurrence gives
Equivalently, its iterated Tikhonov spectral filter is . For , the finite geometric sum gives
Consequently the inverse coefficient is at most . Thus every is a bounded linear operator with
For exact admissible data, write . The Picard criterion gives , and
by dominated convergence theorem. Therefore this is a linear regularization of an inverse problem with discrete parameter ; a family for all positive can be obtained by setting . No upper restriction on the positive step size is needed for this implicit iteration.
Use the Fourier transform convention and . Thus has Fourier symbol . This fixes the factors of in the formula for a differentiated Dirac delta distribution below.
With the Japanese bracket , the symbol class consists of smooth functions such that, for every compact set and all multi-indices ,
Here is one fixed finite real order; the constants may depend on . Differentiation in preserves the symbol class order, whereas differentiation in lowers it.
A phase function is real-valued and smooth on , is a positively homogeneous function of degree one in , and has nonzero total differential:
The nonvanishing condition concerns both sets of variables, not just . The homogeneous convention is imposed away from ; a smooth completion at low frequency is another equivalent convention for the high-frequency construction. Low-frequency changes contribute a smooth function of .
Choose a cutoff function equal to one near zero. The low-frequency part with oscillatory integral amplitude is an ordinary convergent integral and defines a smooth function: all derivatives of are near zero, so differentiation under this integral preserves integrability. For the remaining part define, when ,
Then . On , compactness and the phase function condition give a positive lower bound for . Homogeneity consequently gives . The coefficient of each derivative in has symbol class order , and the coefficient of each derivative has order zero.
If , its formal transpose is
This is the bilinear transpose for integration by parts, without complex conjugation. It lowers the symbol class order by one. For a test function supported in , choose a nonnegative integer and set
Both integrals are absolutely convergent, because the last oscillatory integral amplitude has order and compact support in .
To verify that this defines the intended oscillatory integral, take any equal to one near zero and insert in the original integral. Repeated integration by parts gives the preceding expression with applied also to this cutoff function. Its derivatives satisfy uniform symbol class bounds: on the annulus where they are nonzero, . The transformed integrands are bounded by an integrable multiple of . The dominated convergence theorem therefore proves
It also proves independence of the cutoff function, the chosen , and the integration-by-parts representation.
At most derivatives fall on , so the same estimates give
This proves linearity and continuity on the space of test functions. It also proves the finite order of an oscillatory integral distribution: the derivative bound uses the same for every , although changes.
For , take , , and . This phase function is valid because for nonzero , and the oscillatory integral amplitude is in symbol class . The required identity is
Indeed, extending a test function by zero outside and integrating in first gives the absolutely convergent expression
Here Fourier inversion applies because is a Schwartz function. By the definition of a distributional derivative, the last expression is precisely . If is instead used for plain , the oscillatory integral amplitude in the boxed formula is , and the pairing is .
Not every distribution is one oscillatory integral of the stated class. On , consider the locally finite distribution of unbounded order
Only finitely many differentiated Dirac delta distributions contribute to each test function, so is a distribution. Near it is exactly , which cannot satisfy a bound using only derivatives. Explicitly choose with and use
The derivatives through order remain bounded for , whereas
Any single oscillatory integral with finite and a fixed finite symbol class order has the uniform order bound just proved, so it cannot equal . The same construction works on any nonempty open set in positive dimension by choosing points that leave every compact set and taking locally finite differentiated Dirac delta distributions there. This obstruction concerns a single fixed-order oscillatory integral, rather than local representations or an infinite sum of them.
Write and retain the Landweber relaxation parameter . The printed allows the fixed choice , since then . It does not justify a unit step: the scalar linear operator has norm below , but unit-step error is multiplied by and diverges. We use throughout.
From the recurrence and , induction yields the closed form
For the compact operator in part ii, take a singular system of a compact operator with , and . Thus are the eigenvalues of ; this fixes the notation implicit in the printed hint. In the singular component , the recurrence is
Summing the geometric series gives the Landweber spectral filter
There is no contribution from data in or from in the reconstruction. Starting at zero is what selects the minimum-norm least-squares solution.
For fixed , , so the numerator tends to . The assumption is the Picard criterion
with an arbitrary additional component in . The squared reconstruction error is
Each term tends to zero and is bounded by a summable term from the Picard criterion. The dominated convergence theorem therefore proves , where is the Moore–Penrose inverse of an operator.
For each finite , the regularization of an inverse problem is stable. Set . The geometric series and imply
Consequently the Landweber noise amplification bound in this general step-size convention is . If additionally , the sharper numerator bound gives .
To see the regularization parameter directly, put . Modes with have numerator approximately , so their inverse coefficient is approximately rather than . Each fixed nonzero mode is eventually restored as . Thus
The finite iterates suppress unstable small singular values; infinitely many iterations remove this suppression. For noisy data , the noise-bias decomposition for linear regularization gives
Choosing and proves noisy-data convergence. The reciprocal iteration index is a regularization parameter, and early stopping controls noise amplification.
The Schwartz space consists of the smooth functions for which
for all multi-indices . Its topology is generated by these seminorms; means convergence in every seminorm. A tempered distribution is a continuous linear functional on this space. Convergence in here means weak convergence: for every Schwartz function.
Use the unnormalized angular-frequency Fourier transform
The transform is a continuous automorphism of the Schwartz space, so this duality defines a tempered distribution. Put , as required by the stated identities. Integration by parts and differentiation under the integral give
Thus, keeping the transpose factor of explicit,
and
Iterating gives the Fourier derivative identities for distributions
The logarithm defines a tempered distribution because it is locally integrable and grows more slowly than a polynomial. Its derivative is . The standard transform pair , obtainable by the residue theorem, gives
As , we have . Define
This integral is absolutely convergent: the numerator is near zero, and the exponential controls the tails. It defines a tempered distribution satisfying the same multiplication equation. The kernel of multiplication by a coordinate therefore gives .
To determine , use the supplied Gaussian Fourier transform pair with . Then
Also by the dominated convergence theorem: the relevant integrand is bounded by a constant times for . Consequently
The cutoff limit agrees with the absolutely convergent integral; this particular subtraction convention fixes the otherwise ambiguous delta term. The reusable identity is Fourier transform of the logarithm of one plus x squared.
Add and subtract the exact-data iterate. The noise-bias decomposition for linear regularization gives
so the supplied Landweber noise amplification bound yields
With unit step and zero initial iterate, the exact-data error is . Its squared norm is
by the dominated convergence theorem. Stopping with but therefore makes both errors vanish.
The integrands are absolutely integrable because has compact support, , and . Fubini's theorem therefore permits us to insert and interchange the expectation and integrals:
With , the inner integral in is
Now set . The change of variables gives
which is the required identity.
Choose any with , , and for which Fourier inversion theorem applies, for example a Gaussian function. The left side factors through the Fourier transform of as
On the right side, and
The dominated convergence theorem and Fourier inversion at zero give
Consequently the Fourier-cutoff recovery of expectations from a characteristic function is
The right side depends only on . Equal characteristic functions therefore give equal expectations for every compactly supported continuous , and part a yields the uniqueness theorem for characteristic functions.
For the heat kernel
direct partial differentiation gives
Thus solves the heat equation. For bounded continuous , differentiation under the integral sign gives
With ,
The Gaussian integral makes the weight have total mass one, and the dominated convergence theorem gives . This is the Gaussian approximate identity.
For the viscous Burgers equation with unit viscosity, the Cole-Hopf transformation reduces the equation to . To obtain initial value , choose
(up to an irrelevant positive constant), and set . Therefore
Equivalently,
and the approximate-identity limit gives .
It is sufficient that
and that the stopping rule obey
For example, works.
For exact data , each factor tends to zero. The Picard criterion makes square summable, while is uniformly bounded. The dominated convergence theorem on the resulting series yields .
For noisy data with , the filter representation gives
Indeed, when , Bernoulli's inequality gives ; when , the quotient is uniformly bounded because . Hence the triangle inequality gives
which proves that early-stopped Landweber iteration is a convergent regularization of an inverse problem.
The following four assumptions are sufficient, with statements understood for -almost every and every :
The first two assumptions give . The last two allow the dominated convergence theorem to prove continuity of the normalized posterior density, which is equivalent to continuity in total variation distance.
For a nonnegative measurable , define
Each takes only finitely many values, its level sets are measurable, and pointwise. Thus measurable nonnegative functions are pointwise limits of simple functions.
If is integrable, the same functions satisfy and converge pointwise. The dominated convergence theorem gives
They are integrable because they are bounded above by .
If , instead set
This has finitely many values and
everywhere, so uniformly.