At time zero, . Compactness of gives
Also is uniformly bounded above on . On
one has . Optional stopping, Fatou lemma, and the assumed conditional angular estimate give
Thus
The exponent requested in the question does not follow and is false as written. The SLE Green-function estimate gives probability comparable to , confirming that the denominator in the requested exponent should be .
Put
so . Before , one has and . Therefore
The supplied continuous local martingale is thus bounded after stopping, and a bounded local martingale is a true martingale. Hence
It has the Loewner local growth property when, after mapping out the old hull, each short new increment is small: for every there is such that
Equivalent formulations use a crosscut of diameter below separating the new increment from infinity.
The statement is true. In the notation of part (ii), equality of the capacities forces . Every nonempty compact H-hull has strictly positive half-plane capacity: by the Brownian representation of half-plane capacity, Brownian motion started sufficiently high has positive harmonic measure of a boundary portion of positive height. Hence , so and
Map out first. The image
with its bounded filling is a compact H-hull, and uniqueness of hydrodynamic normalization gives
Comparing the coefficients of at infinity yields the half-plane-capacity composition rule
Thus half-plane capacity is monotone under inclusion.
Let and define . This is harmonic on , has boundary values on the hull boundary and zero on the real boundary, and tends to zero at infinity. The representation by harmonic measure and optional sampling theorem therefore give
At , the hydrodynamic expansion gives
Consequently the Brownian representation of half-plane capacity is
Apply the Feynman-Kac formula with and terminal function . The ansatz gives
Thus and , so
Equivalently, the Integral of Brownian motion is Gaussian with mean and variance .
Let be the first exit from a compact interval on which , chosen so that , and let . By Itô formula,
The assumption gives the drift bound . After stopping,
If , then because is coercive, and
Thus for every , and almost surely.
Itô formula gives
so is a positive local martingale. On every finite interval , the hypotheses imply
The Gaussian tail bound of the Brownian maximum has finite exponential moments of every subquadratic power. Therefore Novikov condition holds on , and the stochastic exponential is a true martingale there. Since was arbitrary, is a true martingale.
For , the Exponential martingale for Brownian motion and the Doob maximal inequality for a nonnegative submartingale give
Taking gives . Apply the same argument to and use the union bound:
Put . It is continuous and tends to infinity almost surely, so . Define the right-continuous inverse and
The time-change theorem for local martingales shows that is a continuous local martingale in the time-changed filtration, and
For completeness, this proves the required case of the Dambis-Dubins-Schwarz theorem: for every , Itô formula makes a local martingale; stopping and conditioning show that has conditional characteristic function . Hence the increments are independent centered normal variables with the Brownian variances, and continuity makes a Brownian motion. Consequently
Thus is centered Gaussian with variance .
Fix and set . Suppose, towards a contradiction, that
where will absorb constants depending only on . Put . Once is large enough, , , and
Part (a) yields with , , and nilpotent of class .
The subgroup core is normal in and has index at most . Since is a simple group, the core is either or . In the first case , which is excluded by increasing . Hence the core is , so .
Now . Since , the ball is not all of , so . Simplicity gives , and therefore is a nilpotent group. A nontrivial finite nilpotent group has nontrivial center of a group; simplicity would force that center to be all of , making Abelian. This contradicts the assumption that is non-abelian. Consequently
The Cayley graph is a connected graph with vertices. A shortest path never repeats a vertex, so it has at most edges. Therefore
Use the product from part (ii). Move each selected element of each small set to the left, conjugating every approximate-group factor that it crosses. For each tuple , the corresponding part of the product is therefore contained in
where every is a conjugate subset of some . Conjugation preserves cardinality, the approximation parameter, and the property that the generated subgroup is abelian. The conjugating elements belong to , so after enlarging the implicit constant.
The number of tuples is at most
These translated products cover , so one has size at least the reciprocal fraction of . For that tuple, put . Then
where , and each is a -approximate group generating an abelian subgroup.
We induct on the nilpotency class . For , the group is Abelian, so take and no . For , part (i) writes
with small and every of class at most . Apply the induction hypothesis to each . Since and its approximation parameter is , all resulting small sets lie in , all their sizes are at most
and all resulting approximate groups lie in and have approximation parameter . Their generated subgroups are abelian groups.
There are factors at each of at most induction levels. Absorbing the resulting products of the bounds into the notation gives
Keeping the factors in the order supplied by the induction yields the required product of the and containing .
Write
Under the improved bounds allowed in the question, and
Moreover , whose size is at most by the higher product bound for an approximate group. Thus
The Ruzsa covering lemma supplies of size at most such that
Taking the to be the factors in this last product gives
where and every is a -approximate group in generating a subgroup of step less than .
Assume , with . Let have size below and let be a complete type. If is algebraic, its realizations lie in . If is nonalgebraic, strong minimality makes it the unique generic type over . The pregeometry exchange property gives
so some basis element of lies outside and realizes .
Thus realizes every one-type over every parameter set of size below . The standard one-type characterization, applied successively to tuple coordinates, makes -saturated. Consequently
Let . If the saturated model had a basis of cardinality below , then would omit the consistent generic type in a strongly minimal theory over . This contradicts -saturation. A basis is a subset of , so its cardinality is at most . Therefore

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