The second assertion is true. Separate the points in the circle direction by a small isotopy if necessary. Cutting at fibers just before and after exposes two copies of . The surface framing is precisely the stated push-off : the two normal directions give homotopic nonzero normal fields along the curve.
For a single fiber-curve surgery, a cut and regluing of these copies by a Dehn twist changes the curve identified with the transverse meridian by one copy of the surface longitude. In the usual convention that negative surface-framed surgery produces a positive Dehn twist, the filling slope implements . One can see the coefficient locally by tracing a transverse arc across the twist annulus: it acquires one reverse turn along , and reversing this cut-and-glue identifies the compressible slope as . Reversing the circle parameter reverses the monodromy convention, without changing the existence of the fiber bundle.
Every filled block is therefore a product of with an interval, with a modified endpoint identification. Their cyclic assembly is the mapping torus of the product of these inverse Dehn twists, in the order of the along the oriented circle. It has the original closed topological surface as fiber, hence fibers over the circle. Intersections between the do not obstruct this argument: their twists occur in different fibers, and their ordered product need not commute.
Fix the algebraic intersection number of curves on an oriented surface by declaring when the ordered tangent pair agrees with the surface orientation. Orient an annular neighbourhood of with coordinates and orientation . A right-handed Dehn twist is represented there by , where increases from zero to one and is constant near the two boundary circles; it is the identity outside this annulus. A transverse arc gains one oriented copy of per signed crossing. Consequently its homology action of a Dehn twist is
Reversing the orientation of changes both factors' signs and leaves this expression unchanged. A separating curve has , so its Dehn twist acts trivially on first homology.
The first assertion is true. Choose a basis for the first homology group of the torus with . The positive Dehn twists about these curves have matrices
The mapping class group of the oriented closed torus is , generated by and their inverses; the Euclidean algorithm on a primitive column gives this generation. The displayed relation rewrites those inverses as positive words:
Replacing every inverse in a generating word proves the assertion. The closed torus hypothesis matters: a boundary twist is retained when a boundary circle must be fixed pointwise.
Color each integer independently and uniformly with one of colors. For a translate , let be the event that some color is missing. The union bound gives
Join two events in the dependency graph of events when their translates overlap. Nonneighbors depend on disjoint sets of independent colors, giving the required joint independence. Overlap occurs only if , so the maximum degree is at most .
With natural logarithms, and imply
The middle estimate uses that is decreasing for , and the next uses . Therefore the Lovász local lemma supplies a coloring avoiding every bad event in any specified finite family of translates.
To obtain one coloring for all translates, use the compactness extension of the Lovász local lemma. At level , consider colorings of satisfying every constraint whose translate is contained in that interval. There are finitely many constraints, and the preceding argument makes the level nonempty. Restrictions connect these colorings into a finitely branching tree. The König infinity lemma gives an infinite branch, hence a coloring of all integers. Every translate eventually lies in a level of this branch, so it contains every color.
Thus there exists a -coloring of in which every translate of contains all colors. This is a polychromatic coloring of integer translates; the compactness step establishes existence of one simultaneous coloring.
An independence graph of events, also called a dependency graph of events, has one vertex for each event , with independent of the entire family of events indexed by its nonneighbors. Precisely, is independent of the sigma-algebra generated by those events. Pairwise independence alone is insufficient.
The asymmetric Lovász local lemma says that if numbers satisfy
then for a finite family. In the commonly used symmetric Lovász local lemma, if each probability is at most and the maximum graph degree is at most , the sufficient condition is
Complement the members of in the fixed ground set: , so . The set difference identities
show that , while complementation bijects with . Applying the four functions theorem to therefore gives
The products count distinct resulting sets, with repeated pairwise differences included only once.
In the four functions theorem, take , , and , where the union and intersection of set families are the collections of all pairwise unions and intersections.
If , then and , so the pointwise hypothesis holds. Otherwise its left side is zero. Summing these indicator functions gives
The Ahlswede–Daykin inequality, also called the four functions theorem, concerns nonnegative functions on . If
then
Prove it by induction on . The case is the single assumed inequality. For the induction step, sum each function over the last coordinate to obtain on . For fixed in this smaller cube, set , , , and , where is empty for and for .
The hypotheses give , and . The two-point four-functions inequality shows that these imply . Here is its key algebra: put , , , . Then and . If , gives ; if , both cross terms vanish. Adding the two diagonal bounds proves the claim.
Thus the primed functions satisfy the same hypothesis, and the induction hypothesis applies. Their totals equal the original totals, completing the proof.
Form the family . The nonnegative weights make it an up-set. It is an intersecting family, since two disjoint members would have combined weight exceeding one. The no-tie hypothesis makes it a self-dual set family: exactly one of belongs.
Let . Self-duality gives . The Erdős-Ko-Rado theorem gives for ; at this is immediate. If is even, .
The biased measure of a set family is . By independence of the Bernoulli random variables, it equals , since equality is excluded. Subtract and pair complementary levels. The complementary-layer bound for biased measure gives
Both factors are nonnegative for . The endpoints also follow directly, or by continuity. Thus the weighted Bernoulli majority bound is
The Erdős-Ko-Rado theorem states that for , an intersecting family of -subsets of satisfies
The bound is sharp: take all -sets containing one fixed element.
Use the Katona circle method. In any cyclic ordering of , the cyclic interval intersection bound permits at most members of to appear as length- intervals. To see the bound directly, rotate a chosen interval so that it ends at . Intervals ending at miss it. Pair the remaining endpoints except as , ; the two intervals in each pair are disjoint, so at most one is chosen. Including the fixed interval gives at most .
There are oriented cyclic orders. A fixed -set appears consecutively in of them: collapse it to a block, cyclically order that block with the other elements, and order its members internally. Double counting the compatible family-member/order pairs gives , proving the theorem.
Identify cube vertices with subsets of . In a down-set , every has all its immediate lower neighbors in . Counting each internal edge by its upper endpoint gives the edge boundary of a down-set in a cube
To maximize it, minimize the sum of set sizes. Among all families of sets, the minimum is obtained by taking the smallest ranks first. This choice is a down-set: take every set of size below , followed by any required selection of -sets.
Write , with , and choose such that . The largest edge boundary of a down-set is therefore
Equivalently, it is . This includes and , with boundary zero. If is exactly a complete-level size, either adjacent choice of gives the same value.
A down-set in the Boolean lattice is a family closed under taking subsets. Restricting the minimization to down-sets cannot decrease the minimum from the edge-isoperimetric inequality in the discrete cube.
The coordinate subcube consisting of all subsets of a fixed -element set is itself a down-set and attains that minimum. Thus
Let count internal edges of the hypercube graph. Since each vertex has degree , its edge boundary is . The edge-isoperimetric inequality in the discrete cube gives , hence .
For completeness, the entropy proof of cube edge-isoperimetry splits the final coordinate into sections of sizes . Their internal edges contribute at most by induction, and their crossing edges at most . For and , the binary entropy function satisfies , so . The convention is .
A -dimensional coordinate subcube has vertices and internal edges, attaining the bound. Therefore
Write for the rectangles, for their centers and for their long-axis directions. For the finite exponent in the displayed estimate, take smooth rotated cap functions , with , equal to one on angular distance at most from and supported within . Choose sufficiently large once and for all. The direction separation makes these cap supports disjoint, and .
Define
The Fourier modulation and translation identity gives the second equality. Rotating the circle cap Fourier lower bound then gives on . The half-side lengths of are no larger than the two frequency bounds used in part (b).
Let be independent Rademacher random variables. Because the input cap supports are disjoint, for every choice of signs
where . Apply the assumed Fourier extension estimate to the sum. Average over signs and use the Khintchine inequality pointwise, followed by the Tonelli theorem:
There is no requirement that the spatial rectangles be disjoint; disjointness is used only for the input caps on the unit circle. Their spatial overlaps are precisely what the square function measures. The cap lower bounds now imply
Since each rectangle has area , the restriction-to-rectangle overlap principle gives
The constants are independent of , the centers and the collection. The finite- interpretation is the one for which the printed power integral is defined. A single cap also shows that the assumed diagonal Fourier extension estimate can hold only for : its output contributes at least to the th-power norm, whereas its input contributes at most a constant times .
Parametrize the unit circle by , with and . Extract the constant phase at :
On the support, . The frequency rectangle and the elementary bounds , imply
Choose the fixed constant large enough that this is less than . Every phase then has real part at least . Nonnegativity of prevents cancellation after this phase rotation, while its central plateau gives . Hence the Fourier transform satisfies
This is the circle cap Fourier lower bound. No upper bound on the values of is needed here; the support, plateau and nonnegativity suffice. The long radial scale comes from the quadratic term , whereas the transverse scale comes from the linear term .
Use the Fourier transform convention throughout this question. The decay assumption implies square integrability, since polar coordinates give
Near zero the integrand is bounded by , and at infinity it is bounded by . The positive is what makes the latter integrable.
By the Plancherel theorem, there is a function whose Fourier transform is . It is the density of with respect to Lebesgue measure. To justify this step rather than assume a density, for every Schwartz function , Fourier inversion gives
The finite measure and the locally integrable function thus define the same tempered distribution, so they agree as measures: . In particular almost everywhere and . This is the L2 density from a square-integrable Fourier transform principle.
For , the density of is . The inequality holds wherever , apart from a Lebesgue measure zero set, so
A second application of the Plancherel theorem yields the explicit bound
The implicit constant in the requested estimate may depend on the measure and its Fourier-decay bound, but is independent of .
It is enough to prove the stronger planar Kakeya maximal function bound
We first work with a -separated net of unoriented directions , with . Write for angular distance modulo . Choose arbitrary length-one, width- rectangles in these directions. The permitted rectangle intersection fact is
The first alternative includes parallel rectangles. Their locations are arbitrary; only separation of their directions matters.
Define , and put . With these weights the adjoint operator is . Since a separated angular net has only a bounded number of directions at each distance scale from , its overlap matrix satisfies
The diagonal term is of size . Using and symmetry gives the Schur test estimate
By duality of Lp spaces, . This is uniform over every choice of the translated rectangles. For each direction choose a rectangle approaching the supremum for , then take the limit. That gives the same estimate for the discretized Kakeya maximal function.
To recover all directions, partition the direction circle into arcs of length comparable to , each with a net direction. A tube in an arc is contained in a rectangle in its net direction with width and length at most two. A bounded subdivision in the length direction reduces this to the same averaging operators; the wider tubes obey the same overlap estimate with fixed-factor changes. Therefore
Finally for every . The planar Kakeya maximal estimate therefore has the required arbitrary small power loss.
For a unit direction , let be a length-one Kakeya tube with transverse radius , centered at , and define the Kakeya maximal function by
Using normalized surface measure on the direction sphere, the Kakeya maximal conjecture is the following family of estimates, in the formulation relevant to this paper:
The constant is independent of and . Replacing round Kakeya tubes by comparable rectangular tubes changes only dimensional constants.
A bounded Kakeya set contains a unit line segment in every direction. The Kakeya Minkowski dimension conjecture says that every such set has full Minkowski dimension . The maximal estimate in fact gives full lower as well as upper Minkowski dimension.
To prove that implication, let . Each unit segment in has a thinner tube contained in , so for every , with a fixed dimensional . Apply the maximal estimate to this indicator function:
If is the smallest number of radius- balls covering , that cover, enlarged by a fixed factor, covers . Thus and
Taking the lower limit of and then letting gives lower Minkowski dimension at least . Bounded subsets of have upper Minkowski dimension at most . Consequently both dimensions equal , which proves the requested implication.
The printed differential in the transform integral is ; it must be , since is the transform parameter. We prove the Newman Tauberian theorem in this corrected interpretation. Set
almost everywhere. The finite-interval transform is entire.
Fix . Because the analytic domain contains the whole imaginary axis, compactness supplies a such that the thin rectangle , lies in the domain. Let be the right semicircle of radius , oriented from to . Join its endpoints by a leftward path along the other three sides of that rectangle. This is a closed positively oriented contour.
Use contour damping for bounded Laplace transforms with
The residue theorem gives
On , with ,
Thus the integrand has modulus at most , and this half-circle contributes at most after division by .
On , the term tends to zero as : every interior point of the path has negative real part, is bounded on this fixed compact path, and the remaining kernel factor is bounded because the path avoids zero. Dominated convergence applies, with the two endpoints irrelevant to the path integral.
For the term, deform to the left semicircle of radius . This deformation uses only the entire function ; it does not demand that extend across a large left half-disk. Both paths lie to the left of zero and their enclosed deformation region avoids the kernel pole. On , for ,
The same circle factor gives another bound . Consequently
The radius is arbitrary, so
This proves convergence of the ordinary improper integral, not merely a damped limit.
For the weakened domain hypothesis, take . Its Laplace transform is , analytic on the open right half-plane, but diverges. Analyticity only in the open right half-plane is insufficient.
Use the Chebyshev estimate from central binomial coefficients. Define
The first is the Chebyshev theta function; the second counts prime powers with the same logarithmic prime weight. For a positive integer , every prime divides , hence
Summing over dyadic intervals yields . By monotonicity and rounding upward to a power of two,
For the lower bound, the central binomial coefficient is the largest of the coefficients whose sum is , so
The exponent of a prime in the central coefficient is
Each summand is zero or one. Therefore . Higher prime powers contribute only
Combining the lower bound with just below shows for sufficiently large , with, for example, .
Let denote the number of primes at most . Since every prime weight is at most ,
For the upper bound, separate the primes at . The small ones number at most , and every larger one has weight at least , giving
Since , this proves
for all sufficiently large , for instance with and . This elementary Chebyshev estimate does not assume the Prime number theorem.
Write the finite abelian group additively. A character of a finite abelian group is a group homomorphism . We first prove that there are exactly such characters of a finite abelian group, without assuming a structure theorem.
Use extension of a character across a cyclic quotient. Given a subgroup and , let be the least positive integer with . The subgroup has cosets of . If is a character of a finite abelian group on , choose any of the roots and define
This is well-defined: two representations differ by an integer multiple of , and the root equation exactly cancels that difference. It is a character of a finite abelian group, and every extension arises from one of the choices of . Build a chain from the trivial subgroup to by adjoining elements. The character of a finite abelian group count multiplies by the same factor as the subgroup order at every step, so .
For a nontrivial character of a finite abelian group , choose with . Translating the group sum shows
so the sum is zero. Applied to , this proves
The orthogonal nonzero characters of a finite abelian group therefore form a basis of all complex functions on , a vector space of dimension .
With the unnormalized Fourier coefficients , expansion in that basis gives the Fourier inversion on a finite group
Under a normalized forward-transform convention the prefactor would instead be one. Thus the unspecified constant is determined by the convention, and the inversion itself follows directly from character of a finite abelian group counting and orthogonality.

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