Multiply the representation in part (c) by and take expectations. This Itô integral has mean zero, and the bilinear form of the Itô isometry gives
Equating this with part (b), and writing both ordinary integrals with the same time variable, yields
All terms are integrable by the Cauchy-Schwarz inequality, the assumed square integrability of , and boundedness of . This is an orthogonality statement against predictable processes; its second term need not itself be predictable.
For , define and . Each is measurable at time , so the summands in the given difference formula are orthogonal martingale transforms. Therefore
Let
Path continuity on the compact interval gives almost surely, and . Since , . Thus, by the Cauchy-Schwarz inequality and part (b),
The last step is the dominated convergence theorem. The bound is uniform in , and the other ordering follows by symmetry. Hence the terminal martingale transforms are Cauchy in .
For the unit-width box kernel, the convolution and kernel density estimator are
and
In particular . The scaling gives . Even if is not square-integrable, Young's convolution inequality gives because and .
Using independence to eliminate the cross terms in the centred estimator, and Tonelli theorem to integrate the nonnegative variance, gives the exact integrated variance of a kernel density estimator:
The Cauchy-Schwarz inequality now yields
This constant comes from the unit norm of the unscaled unit-width box kernel.
For the piecewise constant probability density function, integrability forces the constants on both unbounded outer intervals to be zero. Thus is bounded, has compact support, and has finitely many jumps. Let denote the jump at . For smaller than the least gap between consecutive breakpoints, the smoothing regions do not overlap. Outside these regions the convolution equals .
Within a region, put . For , the bias is ; for , it is . Endpoint values do not affect an norm. Integrating these two triangular errors gives
This is the box-kernel bias of a piecewise constant density. By the triangle inequality, with ,
Balancing this bias-variance tradeoff with gives, for all sufficiently large ,
For the unit-width box kernel, the order-zero local polynomial estimator minimizes, over constants ,
A common factor such as in these weights does not change the minimizer. Put and . If , differentiating the quadratic gives its unique minimizer:
The last expression is the Nadaraya–Watson estimator. Every is within of some design point . Since gives , that point is in the closed kernel window. Thus and the equality holds throughout the domain, including and .
For the error bound, first take the usual bandwidth range . The clipped window has length at least . Any closed interval of length in contains at least points of the design . Consequently
where the last inequality uses . This is a window occupancy for an equally spaced regression design bound that remains valid at the boundary.
Let , the Lipschitz constant supplied by the bounded-derivative assumption. The bias is bounded by
Independence and the variance bound give
By the Cauchy-Schwarz inequality and the triangle inequality,
Thus works uniformly in and the design size in this bandwidth range. The same clipped-length proof in fact works for .
There is a genuine omission in the unrestricted formulation: an upper restriction on bandwidth is necessary for the displayed variance scale. Take , , and . The window contains the sole observation for every , and holds. Its mean absolute error is , whereas the proposed variance term is . No fixed can satisfy this for unbounded .
A valid statement for every satisfying uses . The clipped window has length at least , so , while the preceding coverage argument gives . If , the first bound gives ; if , the second does. Therefore the same bias and variance calculation proves the unrestricted correction
This mean absolute error of local constant regression bound reduces to the requested rate for ordinary small bandwidths and saturates its stochastic term when the window covers the whole design.
The appropriate bounded-operator formulation uses the zero-boundary Sobolev space
The Poincare inequality makes this a Hilbert space norm equivalent to the usual norm, and the zero endpoint traces encode the Dirichlet boundary conditions. Under the usual regular-coefficient assumptions, for example continuous on the closed interval with and , set
If , then Cauchy-Schwarz inequality and the Poincare inequality give
By the Riesz representation theorem, a unique bounded linear operator satisfies . Symmetry of makes self-adjoint, and the lower bound makes it elliptic and uniformly positive definite. The differential expression in the question is represented weakly by : for smooth functions, integration by parts gives
with the boundary term zero. A forcing becomes the bounded functional , or its Riesz representative in .
Equivalently, for sufficiently smooth coefficients one may realize the differential operator itself on with domain . Its regular Sturm-Liouville operator realization is self-adjoint and
This realization is an unbounded operator, so it should not be confused with the bounded weak operator used above.
The PDF states sign conditions without coefficient regularity. If only almost everywhere and are bounded, the same form is still bounded and strictly positive: a zero energy would force almost everywhere and the zero traces force . Uniform ellipticity, however, requires a positive lower bound. For instance for , , and satisfy literal pointwise positivity. Derivatives of unit norm supported in and of integral zero define functions in , with energy at most . Thus pointwise positivity without regularity does not imply coercivity in this norm. These distinctions supply the precise regularity and operator domain behind the intended positive-definiteness proof.
Use the weighted Hilbert structure of velocity-reset relaxation, with inner product and norm . The Cauchy-Schwarz inequality gives
Thus is an absolutely convergent integral and a bounded linear functional. Since , the normalized velocity-reset collision operator obeys
This establishes boundedness. The subsequent orthogonal decomposition improves the operator norm to exactly one.
The absolute Fourier convergence from a square-integrable derivative uses more than the pointwise estimate . Periodic integration by parts gives
By Bessel's inequality,
Now apply the Cauchy-Schwarz inequality:
Adding the finite constant coefficient proves absolute summability. Since a continuously differentiable periodic function has , all hypotheses of part (iii) hold and its Fourier series converges uniformly.
Use the transform convention . The given Fourier inversion theorem gives
Here is continuous, vanishes at both endpoints and belongs to . It therefore defines a continuous periodic function. Its Fourier coefficient at index is . By part (i),
Pair this convergence with . Since that function has normalized norm one, the Cauchy-Schwarz inequality yields, uniformly in ,
The elementary integral is the sinc function,
Thus the sampling expansion by periodic Fourier projection is
There is no pointwise interchange with an unproved Fourier series: the calculation first uses finite sums and then an limit.
The convergence can also be made absolute. Parseval's identity gives , and Bessel's inequality applied to gives . Hence
uniformly in . At an integer argument, is one at zero and zero at the other integers, so the expansion interpolates the samples exactly.
Part (i) and the Cauchy-Schwarz inequality show
Direct integration of this finite Fourier partial sum gives
Moreover Bessel's inequality puts both coefficient sequences in , so their product series is absolutely convergent by the Cauchy-Schwarz inequality. Consequently the cross form of Parseval's identity is
Taking also gives equality of the squared function norm and the squared coefficient norm.
A real sequence has limit of a sequence when
A series is a convergent series with sum when its partial sums have limit of a sequence .
For the first comparison test for series, either of the two allowed bounds implies . Hence
The partial sums form a monotone bounded sequence, so they converge. The series is convergent.
For the exponent , use for . The resulting telescoping series bounds every partial sum by , proving that the series converges by the monotone bounded sequence property. To prove divergence of the harmonic series, group the terms with : their sum is at least . Thus its partial sums are unbounded. If , then , so the comparison test for series proves
For the weighted square assumption, the finite-dimensional Cauchy-Schwarz inequality gives, for every ,
Again the positive partial sums form a monotone bounded sequence. This is the weighted square roots of a summable sequence argument, with . The weighted square condition implies .
The converse is false. Take . Each block contributes at most , and the resulting geometric series converges. But , whose harmonic series diverges. This proves the counterexample without assuming the full P-series criterion.
(A) For a finite point set and a family of distinct unit circles in , the Szemerédi–Trotter theorem for unit circles states
with an absolute constant . Here counts point-circle incidences. Distinctness matters: repeated copies of the same circle are not separate members of this geometric family. A dilation gives the same bound for circles of any one fixed positive radius, with the same constant.
(B) Write and . The comparison is a bound on the cardinality of the distinct-distance set, rather than on the set itself. For each positive distance , take the circles of radius centred at points of . Their incidences between points and curves count exactly the ordered pairs at distance . After dilation by , part (A) bounds this number by
Every ordered pair of distinct points contributes to exactly one of these counts. Thus the unit-circle method for a distinct-distance lower bound gives
For , , so
For the distance set is and the conclusion holds after adjusting the absolute constant; the empty set causes no difficulty.
(C) A direct incidence bound from two-point multiplicity suffices. Put and . Count unordered pairs of distinct points on each curve. By double counting,
Writing , this gives
The Cauchy-Schwarz inequality now yields
If with , then . Consequently
In fact the argument proves the stronger bound. The two-point multiplicity hypothesis alone controls these incidences between points and curves; the algebraic degree bound is not needed for the requested estimate.
Use the normalization in which a projective line has area . On the affine chart of Complex projective space where , set and . Define the Fubini-Study form by
On another chart the corresponding potential differs by for a nowhere-zero holomorphic function , whose is zero. Thus these local differential forms glue to a global form. It is real and closed. Its Hermitian coefficient matrix is positive definite, since for the Cauchy-Schwarz inequality gives
Hence it is a Kähler form and in particular a symplectic form.
On a complex projective line with this is , whose total area is . Thus is the positive generator, equivalently . Another common normalization uses half this form and gives line area ; the scale must be carried consistently into symplectic reduction.
A height function measures arithmetic size, which is what makes an otherwise infinite descent terminate. For a number field , normalize absolute values to extend the standard real and -adic ones, and write . The logarithmic projective height is
The product formula makes it independent of the chosen homogeneous coordinates, and the local-degree normalization makes it independent of the number field containing them. Over , for coprime integer coordinates. Set on an elliptic curve, with .
Two features are essential. First, the Northcott theorem says that points of bounded projective height and bounded field degree form a finite set. For points on a fixed elliptic curve over , each -coordinate has at most two preimages, so bounded gives finitely many points. Second, a degree- morphism of the projective line satisfies , uniformly in . The upper bound comes from evaluating its homogeneous polynomials; for the lower bound, their lack of a common zero gives a resultant identity bounding the input coordinates by the output coordinates at each place. Summing the local bounds gives the asserted uniform constant.
The duplication map on the -line has degree four. Nonsingularity ensures that its numerator and denominator have no common projective zero. Therefore
Telescoping defines the canonical height of an elliptic curve
The error in successive terms is bounded by a geometric series, proving convergence and the uniform bounded difference. It also gives and nonnegativity. The usual addition formula gives the approximate height parallelogram identity for ; equivalently, the unordered pair of sum and difference on the -line has bidegree . Applying that identity to and passing to the limit gives
In particular . Its polarization is the canonical height pairing, a positive semidefinite bilinear form even before finite generation has been proved. The Cauchy-Schwarz inequality for this pairing gives
Also precisely for torsion points of an elliptic curve: one direction follows from periodic multiples, and in the other direction all multiples have bounded , so the Northcott theorem makes two multiples equal. Bounded canonical height of an elliptic curve likewise gives a finite set of -rational points.
Now the Weak Mordell-Weil theorem gives finitely many representatives for . Put . Write any point as . Then
Repeatedly applying this height descent lemma eventually reaches height at most : after steps the height is at most . The set of points with height at most is finite. Reading the relations backwards shows that this finite set together with the generates . Consequently
Heights turn weak Mordell-Weil finiteness into the Mordell-Weil theorem. The canonical height pairing subsequently equips the free part with a positive definite quadratic form, useful for bounding searches and measuring independent generators; this interpretation is a consequence of the proof, not an assumption used in the descent.
The appropriate abstract object is a finite reduced crystallographic root system in a real inner-product space . Its axioms are: is finite, spans , and does not contain zero; for , ; each root reflection
permutes ; and every Cartan integer is an integer. The restriction to a reduced root system and crystallographic integrality distinguishes roots of complex semisimple Lie algebras from more general reflection configurations.
For any two roots of a root system, the Cauchy-Schwarz inequality gives
If the inner product is zero, both Cartan integers vanish. Otherwise their signs agree, and the absolute value of each is a positive integer. Dividing their product by an integer of absolute value at least one proves
For nonproportional roots the product is strictly less than four. In a reduced root system, proportional roots are just and have Cartan integers , so the printed bound is intentionally looser than the resulting bound of three.
A fundamental system of a root system is a basis of made of roots, such that each root is an integer combination of with either all coefficients nonnegative or all nonpositive. Its members are the simple roots. Suppose distinct had . Then
has a positive coefficient of and a negative coefficient of , contradicting the defining sign condition. Thus . Distinct simple roots are linearly independent, so their Cartan-integer product is strictly less than four. Combining integrality and the sign condition gives
Here nonpositive is the intended sense of the printed convention that includes zero among “negative” numbers; orthogonal simple roots really do give zero.
To form a Dynkin diagram, place a vertex at each simple root. Join two vertices by bonds, hence zero, one, two or three. A multiple bond has an arrow toward the short root. Indeed determines the squared length ratio, and the diagram with the Cartan matrix reconstructs the angles and relative lengths. A single bond joins equal-length roots.
The connected finite Dynkin diagrams are the following. The descriptions include bond multiplicities and arrow directions, so distinguish dual diagrams:
There are no other connected finite Dynkin diagrams. Low-rank conventions also identify and ; is disconnected, so introduces no further connected type. Affine diagrams are outside this finite classification.
Finally suppose the underlying graph contained a cycle on distinct simple roots . Put . Any bonded pair has
and all other distinct pairs have nonpositive inner products. The cycle contributes at least bonded pairs, so
But the simple roots, and hence these normalized vectors, are linearly independent, making the displayed sum nonzero. Positive definiteness gives a contradiction. Thus the underlying graph of a finite Dynkin diagram has no cycle. This acyclicity of a finite Dynkin diagram argument also excludes cycles with extra chords or multiple bonds; multiple bonds themselves are not treated as two-edge cycles.
The Vinogradov mean value is
By orthogonality of integer Fourier modes, it counts the ordered integer solutions of for , with every coordinate between one and . The diagonal solutions give .
Put . The moment vector has at most possible values. If counts the tuples with vector , then and . The Cauchy-Schwarz inequality gives . Combining the two lower bounds, with one common positive constant for large , yields
Here is an explicit way that upper bounds enter the Vinogradov mean-value method for a bilinear exponential sum. Write and . Two applications of the Holder inequality, followed by grouping equal differences of moment vectors, give
At integer the minimum is defined as ; means distance to the nearest integer. To explain the mean-value factor, let count pairs of -tuples with prescribed moment difference. It is an autocorrelation of , so by Cauchy-Schwarz inequality. The first Holder inequality groups the tuples, and the second groups the tuples, providing the two factors . The remaining sums over moment differences are bounded by the displayed finite geometric series estimates. Good Vinogradov mean value upper bounds, together with rational approximation or spacing bounds for , therefore give cancellation in . The mean-value estimate alone does not force cancellation for arbitrary coefficients: when all are integers, . For the paper take and the specified .
Use . Applying the Itô formula and the Itô product rule gives
The finite-variation terms cancel in the prescribed combination, leaving
Thus is initially a continuous local martingale. It is a true martingale, not merely local. On each fixed horizon ,
Part (a) with , the assumed bracket moments and Cauchy-Schwarz inequality make this bound integrable. The integrable-supremum martingale criterion now applies, by localization and dominated conditional expectations. The same reasoning makes a martingale, so .
The zero covariance now means . Since and ,
This is the fourth-moment deficit and bracket variance identity. If equality holds for every , then almost surely for each . Take a single probability-one event for all rational times and use continuity to obtain simultaneously for all times. The Lévy characterization of Brownian motion then proves is Brownian motion in its given filtration. A proof of that characterization by conditional characteristic functions is included in Question 2(a).
Write the year- count as a sum of its individual counts, with . The specified conditional independence within that year gives
Dividing by and scaling the conditional variance by therefore gives
This is the Bühlmann–Straub model: larger exposures reduce the process noise in a year's average.
Define the population parameters and total observed exposure by
Here is the expected process variance and the variance of hypothetical means. Assume finite second moments. The law of total variance gives , and conditional independence between years gives for : their only shared variation is the latent conditional mean.
To derive the Bühlmann–Straub credibility estimate, minimize mean squared error among affine estimates of . For coefficients and , the optimal intercept is . Centering at and conditioning on shows that the resulting error is
The cross term vanishes because has conditional mean zero; the conditional noise cross terms vanish by the between-year independence assumption.
For fixed , the Cauchy-Schwarz inequality gives
with equality when . Minimize the remaining quadratic . Its minimizing value is the Bühlmann–Straub credibility factor
The experience term is exposure-weighted:
Since the future conditional mean count is , multiplying the optimal estimate by the known future exposure gives
It is the best affine linear least-squares projection, not a claim that the exact conditional expectation given all data is always affine. If , the conditional mean is a known constant almost surely and one takes ; if , the observations reveal it without process noise and . The ordinary case has .
Write , with innovation variance four. The generating function of this linear process is
Equating coefficients gives , and for . Thus the first five coefficients, including lag zero, are
For all remaining lags, partial fractions give
The coefficients are absolutely summable, so the series converges in mean square and defines the causal moving-average expansion. In the unit-variance convention of part (c), with ; its first five coefficients are . This is the two-geometric-coefficient expansion of a causal ARMA(2,1) process.
White noise orthogonality gives, for any integer ,
To see this directly, expand the covariance of the two convergent series. Only matching noise indices contribute. Cauchy-Schwarz inequality makes the coefficient-product sum finite, justifying the covariance limit.
There is also a closed expression. Set , , , . For ,
and negative lags follow by symmetry. Dividing by the expression at zero gives the same autocorrelation function.