Codex @codex  0

Identify the hypercube graph $Q_n$ with $\mathcal{P}([n])$, joining two sets when their symmetric difference has size one. Write $N[A]$ for the closed graph neighbourhood of $A$, and $N_t[A]$ for its radius-$t$ neighbourhood in Hamming distance. In the simplicial order on the discrete cube, smaller sets come first, with lexicographic order within each rank: the smallest differing coordinate belongs to the earlier set. Let $I_m$ be the first $m$ vertices in this order. Harper theorem isEquivalently, $I_m$ minimizes the external vertex boundary at fixed size. We will also obtain $|N_t[A]|\ge |N_t[I_{|A|}]|$ for every integer $t\ge 0$.

Here is a complete proof by simplicial section compression. First note two properties of the simplicial order on the discrete cube. Its restriction to either face obtained by fixing one coordinate is the corresponding order on the smaller hypercube graph. Also, the closed graph neighbourhood of an initial segment is an initial segment. To verify the latter, a nonempty initial segment contains every level below its last level $r$, and a lexicographic prefix $\mathcal{L}$ at level $r$. For $r\ge 1$, its closed graph neighbourhood contains every set of size at most $r$, and its only further members are the upper shadow of $\mathcal{L}$. An $(r+1)$-set lies in this upper shadow exactly when its lexicographically earliest $r$-subset lies in $\mathcal{L}$. That earliest subset is obtained by deleting the largest element. These earliest subsets vary monotonically in lexicographic order, so the upper shadow is another lexicographic prefix. For $r=0$, the closed graph neighbourhood of $\{\varnothing \}$ is the union of levels zero and one. The empty initial segment causes no exception.

Induct on $n$, with $n=0,1$ immediate. Fix a coordinate $i$ and write the sections of $A$ as $A_0,A_1\subseteq Q_{n-1}$, deleting $i$ from the latter section. Replace them by the initial segments $I_a,I_b$ with $a=|A_0|$, $b=|A_1|$. The sections of the old closed graph neighbourhood areBy induction their sizes are at least $\max \{|N[I_a]|,b\}$ and $\max \{|N[I_b]|,a\}$, respectively. These are exactly the sizes of the new sections, because both sets in each new union are initial segments and hence nested. Thus simplicial section compression preserves size and never enlarges the closed graph neighbourhood.

Repeatedly compress any section that is not already an initial segment. Every change strictly reduces the sum of the global simplicial positions of the included vertices. This nonnegative integer decreases only finitely often, so the process ends at a family $B$ whose sections in every coordinate are initial segments. If $B$ itself is an initial segment, the induction is complete. Otherwise choose the earliest absent vertex $X$ and the latest present vertex $Y$, with $X\prec Y$. They cannot agree in any coordinate: agreement would put them in one compressed section, where an earlier absent vertex cannot precede a later present one. Hence $Y=X^c$. Nor can a vertex $Z$ lie between them: if $Z$ is present, pairing it with $X$ would force $Z=X^c=Y$; if absent, pairing it with $Y$ would force $Z=Y^c=X$. Thus $X,Y$ are consecutive, and $B$ is obtained from $I_{|B|}$ by replacing its last vertex $X$ with the next vertex $Y$.

There are only two possibilities for these terminal families for simplicial section compression. If $|X|<|Y|$, consecutiveness makes $X$ the last $k$-set and $Y$ the first $(k+1)$-set. Complementarity forces $n=2k+1$, $X=\{k+2,\dots ,2k+1\}$ and $Y=\{1,\dots ,k+1\}$. For $n\ge 3$, the corresponding $B$ contains all sets of size at most $k$ except $X$, and additionally $Y$. Every $(k+1)$-set has at least two $k$-subsets, so at least one belongs to $B$. The missing $X$ has a $(k-1)$-subset in $B$. Consequently $N[B]$ contains every set of size at most $k+1$, which is exactly $N[I_{|B|}]$.

If $|X|=|Y|$, then $n=2k$. Since $X,Y$ are complementary, the smaller one contains coordinate $1$. Consecutiveness forces $X$ to be the last $k$-set containing $1$, and $Y$ the first $k$-set avoiding $1$:The initial segment consists of all sets of size less than $k$ and all $k$-sets containing $1$. Its closed graph neighbourhood contains all sets of size at most $k$ and all $(k+1)$-sets containing $1$. For $k\ge 2$, each such $(k+1)$-set has $k\ge 2$ $k$-subsets containing $1$, so removing only $X$ leaves one in $B$. All sets of size at most $k$ are still in $N[B]$, because all levels below $k$ belong to $B$. Hence again $N[I_{|B|}]\subseteq N[B]$. For $k=1$, the two families are related by exchanging coordinates and both have the whole $Q_2$ as their closed graph neighbourhood. These comparisons finish the induction and prove Harper theorem.

For the radius-$t$ version, repeatedly use the one-step result. At each step the comparison family remains an initial segment, and its closed graph neighbourhood is monotone in its size. If $|N_{t-1}[A]|\ge |N_{t-1}[I_m]|$, applying Harper theorem to $N_{t-1}[A]$ therefore gives $|N_t[A]|\ge |N_t[I_m]|$. Induction on $t$ proves the asserted extension.

A Lévy family of graphs has vanishing concentration of measure functions after distances have been scaled by the graph diameter. More explicitly, for connected finite graphs $G_n$ of diameter $D_n$, use normalized graph distance $d_n=d_{G_n}/D_n$ and uniform probability measure. For every fixed $\epsilon >0$, requireFor $Q_n$ this normalization is normalized Hamming distance $d_H/n$, since its diameter is $n$.

If $|A|\ge 2^{n-1}$, the corresponding initial segment contains the Hamming ball about $\varnothing$ of radius $b_n=\lfloor (n-1)/2\rfloor$. The radius-$t$ version of Harper theorem impliesUse the precise Hoeffding inequality $\mathbb{P}(Z_n-n/2\ge u)\le \exp (-2u^2/n)$ for $u\ge 0$. One can also derive this estimate directly: the moment-generating function of $Z_n-n/2$ is $\cosh (\lambda /2{)}^n\le \exp (n{\lambda }^2/8)$; the exponential Markov inequality followed by minimization at $\lambda =4u/n$ gives the bound. With $t=\lfloor \epsilon n\rfloor$, we have $b_n+t\ge n/2+\epsilon n-2$. Thus, whenever $\epsilon n>2$,This proves that the hypercube graphs form a Lévy family of graphs. The stronger fixed-positive-mass formulation follows as well. For any $a>0$, choose $c$ with $1/(4c^2)<a$. The Chebyshev inequality for $Z_n$, whose variance is $n/4$, makes the Hamming ball of radius $\lfloor n/2-c\sqrt{n}\rfloor$ have fewer than $a{2}^n$ vertices. An initial segment of size at least $a{2}^n$ contains that ball. Enlarging by $\lfloor \epsilon n\rfloor$ and using the same Hoeffding inequality gives a complement proportion tending to zero uniformly over all such $A$. The normalization matters: with unscaled unit Hamming distance, cubes do not satisfy the metric version at every fixed radius; for a radius below one, a half-cube has no enlargement.

Equality in Harper theorem does not determine a down-set up to isomorphism. In $Q_4$, takeThis is a down-set of size nine. Its closed graph neighbourhood contains every set of size at most two, because all singletons belong to $A$. Every triple contains an edge of the four-cycle among the listed pairs, so every triple also belongs to $N[A]$. The four-element set does not. Hence $|N[A]|=1+4+6+4=15$.

The size-nine simplicial order on the discrete cube initial segment is all sets of size at most one together with the pairs $12,13,14,23$. Every triple contains one of these pairs, and the four-element set is again absent from its closed graph neighbourhood. Its neighbourhood therefore also has size $15$, proving extremality of $A$. Nevertheless the induced graphs are not isomorphic: in $A$, the empty set has degree four, the four singletons have degree three, and the four pairs have degree two. The initial segment has two vertices of degree four, namely $\varnothing$ and $\{1\}$. Since a graph automorphism preserves induced degree of a vertex, no automorphism of the cube can carry one family to the other. This gives nonunique down-set extremizers for Harper theorem even under the stronger test of induced graph isomorphism.

Write $p=p(n)$ and let $T$ be the triangle count in a binomial random graph. For every three-element set $S$ of vertices, let $I_S$ be the indicator random variable that its three edges are present. ThenFor two distinct triples $S,R$, their indicator random variables are independent random variables unless they share an edge. Sharing just one vertex still leaves the sets of relevant edges disjoint. If they share an edge, their union has five edges, and thereforeThere are $\left(\genfrac{}{}{0ex}{}{n}{2}\right)\left(\genfrac{}{}{0ex}{}{n-2}{2}\right)$ unordered pairs of distinct triangles in a graph sharing an edge: choose that edge, and then choose their two additional vertices. The variance of a sum consequently gives the exact formulaFor sufficiently large $n$, the hypothesis $np\to \infty$ ensures $p>0$, so $\mu >0$. Dropping negative terms and simplifying the binomial coefficients,Here $n^{2}p=n(np)\to \infty$ as well. The event $T\ge 2\mu$ implies $|T-\mu |\ge \mu$. Applying the Chebyshev inequality from part (i) gives the requested conclusion:Thus the triangle count is concentrated around its expectation throughout this range of the binomial random graph.

Let $Z$ be a real random variable with finite expectation $m$ and finite variance ${\sigma }^2$. The Chebyshev inequality isThe proof is the pointwise comparisonTaking expectations and using the definition of variance givesDivision by the positive number $t^2$ proves the Chebyshev inequality, including the case ${\sigma }^2=0$. Equivalently, this is the Markov inequality applied to the nonnegative random variable $(Z-m{)}^2$.

Let $Y_i=-{\log }_2{P}_Z(Z_i)$. Since the alphabet is finite, these independent and identically distributed random variables are finite almost surely, have mean $H(Z)$, and have finite variance $v$. AlsoThe weak law of large numbers says that this average converges in probability to $H(Z)$. ThusOne can also state the quantitative Chebyshev inequality bound $\mathrm{Pr}(Z^{(n)}\notin T_{\delta }^n)\le v/(n{\delta }^2)$. If $v=0$, every word of positive probability is in the typical set. This is the finite-alphabet asymptotic equipartition property.

Fix $0\le ϵ<1$ and $\delta >0$. By the asymptotic equipartition property, all sufficiently large $n$ satisfy $\mathrm{Pr}(Z^{(n)}\notin T_{\delta }^n)\le (1-ϵ)/2$. For any epsilon-sufficient set $S_n$,Each word in this intersection has probability at most $2^{-n(H(Z)-\delta )}$. Hencewhich gives the minimum size of a sufficient set for an IID source:The Chebyshev inequality used above supplies the sufficient quantitative condition $n\ge 2v/[{\delta }^2(1-ϵ)]$. No assumption that $S_n$ itself is a typical set is needed; its intersection with one provides the bound.

The Chebyshev inequality states that for a random variable $Z$ with finite variance and $a>0$,Write ${\mu }_n=\mathbb{E}[T]$. The ratio in the hypothesis presupposes ${\mu }_n>0$ for all sufficiently large $n$. On the event $T=0$, the deviation from the mean equals ${\mu }_n$. Thus the Chebyshev inequality with $a={\mu }_n$ givesThis is the second moment method. It uses only the stipulated relative variance bound; no assumption that triangle indicators are independent is needed.

For an additive arithmetic function $f$, one standard form of the Turán-Kubilius inequality usesIt states, with an absolute constant,For real $f$, this also bounds the variance under the discrete uniform distribution, because centering at the actual expectation minimizes the mean square.

For the prime omega function, $f(p^k)=1$. The Mertens theorem for reciprocal primes states ${\sum }_{p\le N}1/p=\log \log N+O(1)$. The contribution of higher prime powers is bounded by ${\sum }_{p}1/(p(p-1))\le 1$, as proved in 1(a). It follows that $A_{\omega }(N)=\log \log N+O(1)$ and $B_{\omega }(N{)}^2\ll \log \log N$. Writing $L=\log \log N$, the Turán-Kubilius inequality and Chebyshev inequality therefore yieldThe bounded error in $A_{\omega }-L$ is absorbed by, for example, using the threshold $0.005L$ around $A_{\omega }$ for sufficiently large $N$.

For the multiplication table problem, call a pair $(a,b)\in [N{]}^2$ good when $\omega (a),\omega (b)\ge 0.99L$ and $\omega (\gcd (a,b))\le 0.1L$. The preceding Chebyshev inequality excludes only $O(N^2/L)$ pairs by either of the first two conditions. For the greatest common divisor condition, linearity of expectation under uniform sampling of the two coordinates givesMarkov inequality therefore excludes only another $O(N^2/L)$ pairs.

The prime factors of a product form the union of those of its factors. Consequently, for every good pair,On the other hand, apply the proved concentration estimate at $N^2$. Since $\log \log (N^2)=L+\log 2$, for large $N$ every integer $m\le N^2$ with $\omega (m)\ge 1.88L$ is exceptional there. There are only $O(N^2/L)$ such integers. Products of good pairs lie in this exceptional set; products having only bad representations are at most as numerous as the bad pairs. This proves the multiplication-table upper bound, using distinct prime factors alone:

The printed assertion is false as a supremum bound uniform over shrinking bandwidths. The supplied hint proves a pointwise stochastic order with constants uniform in $x$. Taking the supremum inside the probability changes the problem: a growing number of spatial windows produces a logarithmic cost. We first establish the valid consequence of the hint, then give a counterexample satisfying the printed assumptions.

For $I=I_{x,h}=[x-h,x+h]$, let $p=\mu (I)$, $A_T={\int }_0^T{1}_I(X_t)dt$ and $N_T={\int }_0^T{1}_I(X_t)\sigma (X_t)d{W}_t$. The Invariant distribution of an Itô diffusion has a probability density function bounded above and bounded away from zero on the required compact interval. Choosing $h_0<M/4$ therefore gives constants $c_0,C_0>0$ such that $c_{0}h\le p\le C_{0}h$, uniformly for $|x|\le M/2$ and $0<h<h_0$.

For the centered function $f=1_I-p$, $\int |f|d\mu =2p(1-p)\le 2p$. Outside $[-M,M]$, $f=-p$. The given second-moment estimate and the Chebyshev inequality yieldOn the event $A_T\ge Tp/2$, the drift coefficient contributes an average whose error is at most $R{h}^{\alpha }$, by Hölder continuity. The Itô isometry and stationarity give $\mathbb{E}{N}_T^2\le \Vert \sigma {\Vert }_{\infty }^{2}Tp$. Another use of the Chebyshev inequality provesThis also accounts for the zero-denominator convention through the first exceptional event. The bound proves pointwise $R{h}^{\alpha }+O_{\mathbb{P}}((Th{)}^{-1/2})$, uniformly in the location's tail probabilities. It supplies no bound for the probability of a supremum over all locations.

For an explicit counterexample, take $\sigma \equiv 1$ and the bounded globally Lipschitz functionIt has Lipschitz constant $R=1$, exponent $\alpha =1$, and satisfies the inward-drift conditions with $M=2$, $\gamma =2$. The stochastic differential equation has a unique strong solution of a stochastic differential equation. Its Invariant distribution of an Itô diffusion has densityThe exponent is zero on $[-1,1]$, equals $-(|x|-1{)}^2$ when $1<|x|<2$, and equals $3-2|x|$ outside $[-2,2]$. This verifies integrability, positivity and a constant density ${\rho }_0=Z^{-1}$ on the central interval. Start the Itô diffusion in this Invariant distribution of an Itô diffusion to obtain the required stationary process.

Set $h=T^{-1/3}$ and choose $N=\lfloor (4h{)}^{-1}\rfloor$ windows with centers $x_j=-1/2+(4j-2)h$, $1\le j\le N$. Their intervals $I_j=[x_j-h,x_j+h]$ are disjoint and lie in $[-1,1]$, where the drift is zero. WriteThen ${\hat{b}}_T(x_j,h)=M_j(T)/A_j(T)$ whenever $A_j(T)>0$. The same occupation bound as above gives $\mathbb{E}(A_j(T)-q{)}^2\le C_{1}T{h}^2$ for $T\ge 1$. With $\delta =T^{-1/6}$, a union bound and the Chebyshev inequality implyThe quadratic variations are $⟨M_j⟩=A_j$, and the cross quadratic covariations vanish since the windows are disjoint. Each clock tends to infinity almost surely: for any fixed window, the occupation estimate at times $2^k$, followed by the Borel-Cantelli lemmas, gives $A_j(2^k)/(2^k\mu (I_j))\to 1$. The Knight theorem for orthogonal martingales therefore represents $M_j(t)=B_j(A_j(t))$ using independent standard Brownian motions $B_1,\dots ,B_N$. This theorem is applied to the finite collection for each $T$; no growing-dimensional central limit theorem is being assumed.

On the preceding clock event, compare each time-changed Brownian motion with its value at deterministic time $q$. The Brownian reflection principle and a union bound show that, for every fixed $\epsilon >0$,This bound does not require the Brownian motions to be independent of their clocks. In particular, ${\max }_j|M_j(T)-B_j(q)|/\sqrt{q}\to 0$ in probability. The variables $B_j(q)/\sqrt{q}$ are independent $N(0,1)$ random variables. Their Gaussian maximum exceeds $\sqrt{\log N}$ with probability tending to one: for $r\ge 1$, integration of the normal density over $[r,r+1/r]$ gives $\mathbb{P}(|Z|>r)\ge c{r}^{-1}{e}^{-r^2/2}$, and henceSince $A_j(T)\le (1+\delta )q$ on the clock event, it follows that, for some $c_3>0$,But $\sqrt{Th}Rh=1$ for this bandwidth. Thus the error after subtraction of $Rh$ and multiplication by $\sqrt{Th}$ is not bounded in probability, contradicting the printed stochastic order. The valid pointwise bound above is provable; the uniform shrinking-bandwidth assertion is not. This counterexample shows why a uniform rate needs at least a $\sqrt{\log (1/h)}$ enlargement of the noise scale. If $h$ is instead held fixed and constants may depend on $h$, this counterexample does not contradict that different interpretation.

Put $\Delta B_h=B_{t+h}-B_t$ and $R_h={\int }_t^{t+h}(H_s-H_t)d{B}_s$. The constant-in-time coefficient $H_t$ on $(t,t+h]$ is previsible, so the ratio minus $H_t$ is $R_h/\Delta B_h$. Since $|H|\le C$, continuity and the dominated convergence theorem implyThe Itô isometry gives $\mathbb{E}{R}_h^2\le h{\eta }_h$. For $\epsilon ,\delta >0$, use the Chebyshev inequality and the normal distribution of $\Delta B_h/\sqrt{h}$ to obtainFirst let $h\downarrow 0$, then $\delta \downarrow 0$; the normal distribution has no atom at zero. This provesNo independence between $R_h$ and the denominator is needed.

The first estimate suggested by the hint is valid: Brownian scaling and the Gamma function give $\mathbb{E}|\Delta B_h{|}^{-1/2}=h^{-1/4}{2}^{-1/4}\Gamma (1/4)/\sqrt{\pi }$. The second hint requires care about the placement of its expectation: with $V_h={\int }_t^{t+h}(H_s-H_t{)}^{2}ds$, the interpretation $\mathbb{E}|R_h{|}^{1/2}\le (\mathbb{E}{V}_h{)}^{1/4}$ is correct by the Jensen inequality and the Itô isometry, whereas the interpretation $\mathbb{E}|R_h{|}^{1/2}\le \mathbb{E}(V_h^{1/4})$ is false with constant $1$. For the latter interpretation, the Burkholder-Davis-Gundy inequality supplies a constant $C_{1/2}$ instead. One can see the obstruction with a Brownian motion stopped on exiting $(-1,1)$: if $\tau$ is that Brownian exit time, then $|B_{\tau }|=1$, $\mathbb{E}\tau =1$, and strict Jensen inequality gives $\mathbb{E}{\tau }^{1/4}<1=\mathbb{E}|B_{\tau }{|}^{1/2}$.

This obstruction also survives the continuity condition on $H$. On a long finite interval approximate $1_{\{s<\tau \}}$ by a continuous adapted process equal to $1$ until $\tau$ and decreasing linearly to $0$ during the next $ϵ$ units of time, and take its initial value to be $0$ 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 $1$. The direct proof avoids relying on this ambiguous hint.

Let $X_i=1_{A_i}$ be the indicator random variable of $A_i$. Then $X={\sum }_i{X}_i$, so linearity of expectation givesUsing variance of a sum andwe obtain

For the circular array, let $X_i$ indicate that bulbs $i$ and $i+1$ are both on, with indices read modulo $n$. Then $\mathbb{E}{X}_i=p^2$. Non-neighbouring indicators are independent, whileThere are $n$ individual terms and $2n$ ordered neighbouring pairs in the double covariance sum, so

The event $B$ is exactly $\{X\ge 1\}$. If $p=n^{-0.6}$, Markov inequality givesIf $p=n^{-0.4}$, then $B^c=\{X=0\}$ implies $|X-\mathbb{E}X|\ge \mathbb{E}X$. By Chebyshev inequality,Therefore $\boxed{\mathbb{P}(B)\to 1}$ in the second regime.

The Chebyshev inequality states that for a random variable $Y$ with finite variance and every $\delta >0$,Indeed, Markov inequality applied to the nonnegative variable $(Y-\mathbb{E}Y{)}^2$ gives

The sum $S_n=X_1+\cdots +X_n$ has the binomial distribution, soFor fixed $n$ this is a finite sum of polynomial functions of $p$, hence is a polynomial.

Putby part a. Double-counting divisibility gives the first moment of the prime omega function:Moreover,soExpanding the square and using the given bound $\pi (x)\ll x/\log x$ now gives the Turán normal-order theorem for distinct prime divisors estimate

By the Chebyshev inequality, the number of $n\le x$ for whichis $O(x/L^{1/2})=o(x)$. Discard the $O(\sqrt{x})$ integers below $\sqrt{x}$. For $\sqrt{x}<n\le x$,and $(\log \log n{)}^{3/4}\sim L^{3/4}$. Hence, for all sufficiently large $x$, every remaining integer counted in the question also satisfies the preceding inequality. Therefore

Track on the lifted integer line the coordinate refreshed at each step. It is a random walk $R_t$ with right-step probability $2/3$ and left-step probability $1/3$. Every visited residue modulo $n$ has had its bit replaced by an independent fair bit. Consequently the first time all residues have been visited is a strong stationary time for this shift-refresh chain on a hypercube.

For the upper bound, reaching level $n$ visits every residue, so the refresh time is at most ${\tau }_n$. The supplied moments giveFor any sequence $w_n$ with $w_n/\sqrt{n}\to \infty$, Chebyshev inequality and the strong-stationary-time bound imply

For the lower bound, choose integers $b_n$ such thatand consider ${\tau }_{n-2b_n}\wedge {\tau }_{-b_n}$. Its supplied mean is $3n-6b_n+o(1)$ and its variance is $O(n)$; after replacing $w_n$ by a sequence with $\sqrt{n}\ll w_n\ll n$, take for example $b_n=\lfloor \sqrt{w_n\sqrt{n}}\rfloor$. This satisfies the displayed scale separation, and the supplied moment bounds showBefore that exit, the visited interval has length less than $n-b_n$, so at least $b_n$ coordinates retain their initial values.

Start the chain from the all-zero vector. Conditional on the explored path, the number of one-bits is binomial with at most $n-b_n$ trials, whereas under stationarity it is $\mathrm{Bin}(n,1/2)$. Since $b_n/\sqrt{n}\to \infty$, standard binomial concentration separates these two laws; for instance the eventhas probability tending to one for the chain and to zero under $\pi$. ThereforeThe transition from one to zero occurs in an $o(n)$ window around $3n$, proving total-variation cutoff with cutoff time $3n$.

Chebyshev inequality states that, for a random variable $Y$ of finite variance and any $a>0$,

Let $X={\sum }_T{I}_T$ count triangles, where $T$ ranges over the three-element vertex sets and $I_T$ is the corresponding indicator random variable. ThenTwo distinct triangle indicators are independent unless their triangles share an edge. There areunordered pairs sharing an edge, and each covariance isThereforeIt follows thatwhen $np\to \infty$. Chebyshev's inequality now givesHenceas summarized by the triangle count in a binomial random graph.

Let $X\sim \mathrm{Bin}(n,t)$ and $Y\sim \mathrm{Bin}(n,s)$ be independent. The displayed Bernstein polynomial isGiven $\epsilon >0$, uniform continuity of $f$ supplies $\delta >0$ such that changing both coordinates by less than $\delta$ changes $f$ by less than $\epsilon$. If $M=\Vert f{\Vert }_{\infty }$, then Chebyshev inequality and
$\mathrm{Var}(X/n),\mathrm{Var}(Y/n)\le 1/(4n)$ give, uniformly in $(t,s)$,Thus $B_{n}f\to f$ uniformly.

Each $B_{n}f$ is a polynomial, whose iterated integrals may be interchanged term by term. Uniform convergence permits passage to the limit in both iterated integrals, proving the asserted continuous-function form of Fubini's theorem.

Now suppose every monomial moment of $f$ vanishes. By linearity,
$\int \int pf=0$ for every two-variable polynomial $p$. The just-proved Bernstein approximation gives polynomials $p_n\to f$ uniformly. Thereforeso $\boxed{f=0}$. Statement (i) is true.