A standard form of the Kakutani solution of the Dirichlet problem uses a bounded domain , continuous Dirichlet boundary data , and regularity of every boundary point for the Dirichlet problem. The boundedness of makes a compact set, so is a bounded function and a uniformly continuous function. A bounded domain with boundary is a sufficient geometric case; one must not omit boundary regularity for an arbitrary bounded domain.
One standard analytic characterization of a regular boundary point on a bounded domain is the existence of a positive harmonic barrier: for each there is a harmonic function with and for . This is the harmonic form of a barrier for the Dirichlet problem; the barrier characterization of regularity is a standard fact of potential theory.
Let be -dimensional Brownian motion started at and let be its Brownian exit time. Then the unique solution in is
Equivalently, , where is harmonic measure, the exit probability distribution of Brownian motion. The harmonic function equation is , with the Laplace operator convention .
For fixed rational , write
By independent increments, is independent of and has normal distribution . Conditional on , the displayed difference has a continuous probability density function; in particular it equals zero with probability zero. Taking the countable intersection over all such rational quadruples proves that, on one event of probability one, the maxima over any two separated rational closed intervals are distinct.
Suppose a local maximum at were not a strict local maximum. There is a neighbourhood in which every value is at most , and, arbitrarily close to , some other time strictly inside that neighbourhood has . Choose separated rational closed intervals containing and , both lying inside that neighbourhood. When one time is zero, use a first interval with left endpoint zero. Both interval maxima equal , contrary to the preceding event.
Therefore every local maximum of Brownian motion is a strict local maximum almost surely, simultaneously over all times. This countable-interval argument avoids an invalid intersection of probability-one events over uncountably many candidate times.
First prove nowhere monotonicity of Brownian motion. On a fixed interval with rational endpoints and , the increments over its equal subdivision are independent centered normal random variables. If the Brownian motion path were nondecreasing, all these increments would be nonnegative, an event with probability . Letting gives probability zero. The same argument excludes nonincreasing paths. A countable union over rational intervals shows that, almost surely, no nontrivial interval supports a monotone function restriction of the path, since every such interval contains one with rational endpoints.
Work on this event and on the event of continuous paths. Inside any open interval , choose two separated smaller intervals, the first to the left of the second. The first contains with , because its restriction is not nonincreasing. The second contains with , because its restriction is not nondecreasing. Thus , all in .
By the extreme value theorem, the path attains its maximum on . This value exceeds , since it is at least , and exceeds , since it is at least . A maximizing time therefore lies in and is a local maximum of Brownian motion. Every open interval in the half-line contains a positive-time interval of this kind. Consequently the set of local maxima of Brownian motion is dense in almost surely.
Fix deterministic and . The pasting ordered stopping times argument shows that is a bounded stopping time. The given stopped-expectation property, applied to and to the deterministic stopping time , yields
This holds for every . Since is -measurable and both time values are integrable, it is exactly the defining test for conditional expectation:
Hence is a martingale. This proof of the characterization of a martingale by bounded continuous-time stopped expectations uses only deterministic two-time pastings; the càdlàg assumption and the usual conditions for a filtration are stronger than needed for this implication.
Recall the stopping-time sigma-algebra:
For the proposed random time,
The first set belongs to . Since , the second can be written
which also belongs to . Therefore is a stopping time, as in pasting ordered stopping times. Moreover , so is a bounded stopping time.
Fix and partition into equal intervals, with . Round upward within this interval. The corresponding sampled value is
Every time in this sum is at most . The stopping time property makes each indicator function -measurable, while the adapted process property makes each sampled value -measurable. Consequently is -measurable.
The rounded times approach from the right, so right continuity gives for the chosen pathwise càdlàg version. If path regularity is instead stated only almost surely, the usual complete filtration handles the exceptional null set; on an incomplete filtration one should formulate that case as existence of an adapted version. At , the value is simply . Thus is an adapted process, by adaptedness of a stopped right-continuous process. The argument actually needs neither the martingale property nor boundedness of .
A càdlàg martingale is an adapted process with càdlàg paths, integrable at each finite time, and
The càdlàg requirement means that the chosen path version is right-continuous and has a finite left limit at every positive time. With a complete filtration, it suffices that this holds on one common event of probability one, since the process can be redefined on the exceptional null set.
The usual hypotheses for a filtration are completeness and right continuity. Completeness means that contains every subset of every null event of the ambient probability space; right continuity means
Put . The stopped martingale in discrete time identity
shows that is a martingale: the indicator function is -measurable and the increment has zero conditional expectation. Integrability follows because is selected from the finitely many integrable values .
For the bounded stopping time , the optional stopping theorem in its conditional form gives
Here is the stopping-time sigma-algebra. Indeed, for , partition into and apply the martingale identity on each piece. This proves the displayed conditional expectation identity directly.
Let and . Conditional absolute-value domination and the Markov inequality give and, for any ,
First choose using the uniform integrability of , and then choose . The estimate is uniform in , proving uniform integrability of a stopped uniformly integrable martingale. No finiteness assumption on is needed.
A martingale has uniform integrability when its entire family of time values has uniformly small integrable tails:
Here every is an integrable random variable. This implies , because the contribution from is at most . Mere boundedness of these expectations does not imply uniform integrability.
Write . For , let be the upcrossing count obtained by successively buying at an observation at or below and selling at an observation at or above , with the first purchase allowed at time zero. The Doob upcrossings lemma for an integrable discrete-time martingale is
The weaker last bound is also the usual Doob upcrossing inequality.
To prove it, hold one unit between each purchase and sale, and zero units otherwise. If records the holding over , the decision is -measurable, with . The resulting martingale transform has gain
Each completed upcrossing earns at least . An unfinished holding loses at most . If a purchase occurs at zero, its price is , giving the additional discount , whether that holding has been sold or remains open. If no purchase occurs at zero, this extra term is zero. Therefore, path by path,
Taking expectations proves the bound.
The martingale convergence theorem, stated without proof, says that a discrete-time martingale satisfying converges almost surely to a finite integrable random variable . In particular every nonnegative martingale converges almost surely to a finite limit. Under uniform integrability, the uniformly integrable martingale convergence theorem additionally gives convergence in L1 and .
In the level- convention used here, the Selberg upper-bound sieve states that a nonnegative sequence with sieve distribution satisfies
It follows by minimizing the quadratic form with the Selberg sieve weights and using the Selberg least-common-multiple weights bound .
Sieve the interval by two and by the primes congruent to three modulo four, up to . The interval divisor counts give
Thus , , and uniformly in the location of the interval. Take and .
To bound , let and form the Euler product over the forbidden primes at most . The given reciprocal-prime sum in residue class one modulo four, subtracted from the Mertens second theorem, yields
Moreover, the Mertens first theorem bounds the logarithmic mean by for large . The truncated Euler-product lower bound gives .
The full-range summatory bound for three to the prime omega bounds the error by , which is . Every integer whose prime factors are all congruent to one modulo four survives this finite sieve. Therefore the half-dimensional interval sieve gives
The constants are independent of . Enlarging them covers the bounded range of before the asymptotic product estimates apply, so the result holds throughout .
Take sieve level and coefficient cutoff . Let be the finite set of odd primes at most . Give one unit of weight for each prime . For an odd squarefree integer on these primes, the sieve distribution is
The residue is coprime to every such , and for all permitted primes. Values of outside the permitted set can be chosen arbitrarily in at primes and extended multiplicatively on squarefree integers.
For the Selberg sieve normalizing sum, and
Here is a direct proof of this lower bound. Restrict the Euler product to . The Mertens first theorem gives , which is at most for large . The Mertens second theorem gives
The truncated Euler-product lower bound, with , now gives .
Use the minimizing Selberg sieve weights from Question 3. Their absolute values are at most one, so the Selberg least-common-multiple weights satisfy . Parts (a) and (b) control the remainder:
The first factor uses the Bombieri–Vinogradov theorem; is below for all sufficiently large . The second uses the permitted . The PDF has the exponent nine, which the TeX transcribes incorrectly. Choose to obtain .
Every twin prime pair with survives the finite sieve, while the pairs with number at most . The Selberg upper-bound sieve thus gives
Therefore the twin-prime count is . The finite cutoff on the forbidden primes is essential: sieving by all odd primes would also discard the large prime values that we are trying to count.
Put , with the offset logarithmic integral function. The permitted standard sieve estimate can be taken as the Brun–Titchmarsh theorem:
For , . Also . Thus both terms defining are , uniformly over the permitted moduli. Apply the Cauchy-Schwarz inequality in the form
This is the weighted arithmetic-progression error bound. The prime omega function and Euler totient function weights can therefore be handled using an unweighted mean error and a separate positive sum.
Let and , the identity for Dirichlet convolution. The elementary identities needed are
For the first, prime factorization gives when , and one when . For the second, if , then , the Von Mangoldt divisor identity. Convolving the second identity with proves the third.
For , let the subscripts , , , denote truncations. The Vaughan identity is
Its pointwise form is
To prove it, use and . This gives
and rearrangement proves the formula, as in the Vaughan identity proof.
The Bombieri–Vinogradov theorem states that for every there is such that
Here is the Chebyshev function in an arithmetic progression, and is the Euler totient function. In particular, partial summation gives
after choosing the logarithmic saving in the weighted theorem sufficiently large and absorbing the prime power terms. This is the offset logarithmic integral function.
For the proof strategy, Orthogonality of Dirichlet characters converts errors in arithmetic progressions into character sums of Dirichlet characters weighted by . Reduction to primitive Dirichlet characters is followed by the character large sieve, which bounds their mean square by with the usual weights. The Vaughan identity separates the weighted sums into short terms, Type I sums and Type II sums. Direct inner-sum estimates handle the Type I sums; the Cauchy-Schwarz inequality and the large sieve control the Type II sums. The Siegel–Walfisz theorem supplies arbitrarily strong logarithmic savings for small moduli, where an average estimate alone would not suffice. A dyadic decomposition, suitable and a sufficiently large absorb the divisor and logarithmic losses. This explains why the range is essentially , with logarithmic room to spare.
Set , and restrict attention to the set of squarefree integers all of whose prime factors lie in . Coefficients indexed by non-squarefree integers do not affect , so they may be set to zero. Put
In particular, the normalizing sum runs to , as in the PDF; the converted TeX's is a transcription error. Define . The finite multiples version of Möbius inversion is
It follows by substituting the definition and using . Taking gives . Thus the Selberg sieve diagonalization and the Cauchy-Schwarz inequality give
Equality holds at , which satisfies the constraint. Inverting, and writing , yields
For set . The formula has and gives minimum .
To show these optimal Selberg weights have modulus at most one, fix . Each integer , with , and , is a distinct term of . The total weight of these terms is
It is at most , so the displayed formula gives . This proves the modulus bound without assuming that each factor is itself small.
For a fixed prime , the grid has circular spacing . Consequently an arc of length contains at most three points of this grid, including endpoints. The standard Chebyshev estimate for the prime-counting function gives
Since , the local-multiplicity large sieve yields the prime-denominator large sieve:
By contrast, distinct reduced fractions with denominators at most have circular distance at least : their difference, even after subtraction of an integer, has a nonzero integer numerator over denominator . Applying part (a) alone gives only . The local-multiplicity argument saves a factor of .
Use the same Sobolev–Gallagher inequality on arcs of length . They now overlap, but every point belongs to at most arcs, by the definition of that local multiplicity. For , summing the integrals therefore gives
This is the local-multiplicity large sieve. If , every point is within circular distance of every center, so . The direct Cauchy-Schwarz inequality bound gives the requested estimate in this remaining case.
The points are -spaced if their circular spacing satisfies for , where is distance to the nearest integer. Ordinary distance on the real line would be insufficient because the complex exponential is periodic.
Let and . Multiplication by this unit-modulus factor leaves unchanged and places the frequencies of in . Put . The permitted Sobolev–Gallagher inequality, in the form needed here, is
For , the arcs about the have disjoint interiors on the circle group. Summing and applying the Cauchy-Schwarz inequality gives
The Cauchy-Schwarz inequality here follows by expanding and minimizing over . For completeness, the finite-interval Parseval identities follow by expanding the squares: is one at and zero at every other integer . Thus and . We obtain the exponential-sum large sieve bound
If , there is at most one point, and the direct Cauchy-Schwarz inequality bound proves the same assertion.
For coefficients supported on an interval of length , write and . The variance form of the large sieve states
The constant is absolute. One may take the explicit right side , by orthogonality of roots of unity and the exponential-sum large sieve proved in Question 2.
Take , , and the indicator function of the -smooth numbers up to . Applying the given smooth-number density with parameter gives
with a harmless adjustment of the constant for integer endpoints. If an odd prime has least quadratic nonresidue , then : a quadratic nonresidue always occurs among . Every prime factor of every selected smooth number is thus a nonzero quadratic residue modulo . By the multiplicativity of the Legendre symbol, every selected number is a nonzero quadratic residue modulo .
There are nonzero quadratic nonresidue classes, and on all of them. Their contribution to the variance is at least
If denotes the number of exceptional primes, the variance form of the large sieve, with , yields . Consequently
This is the bounded exceptional primes for least quadratic nonresidues argument. Using an interval of length is what matches the term; an interval of length would not give a bounded exceptional set.
The remainders in the sieve distribution are defined by
Multiply the pointwise inequality from part (a) by and sum. Finite rearrangement gives
To identify the main quadratic form, put . For squarefree integers , multiplicativity gives
The second identity is also valid if or is not squarefree: both sides then vanish. Therefore the Selberg sieve diagonalization gives
This proves . Notice that the hypotheses do not force to vanish on non-squarefree integers; those coefficients simply make no contribution to this main quadratic form because .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact