Let , and . A graph cut with no crossing edges is obtained by assigning whole graph components to its two sides. Among all such assignments, maximize the smaller side's size , and write for the other side.
Suppose . Then . If a graph component on the larger side had size , moving it to the smaller side would make both and greater than . That contradicts maximality. Hence every graph component on the larger side has at least vertices. Since each has at most vertices and their total exceeds , there must be at least of them. Consequently
a contradiction. Thus , proving the required empty cut with both sides at most . This balanced component cut argument works for arbitrary positive component weights as well; it does not require divisibility of .
It suffices to prove the assertion after replacing by : that replacement gives a tighter interval. Thus assume and , and put
At , let count isolated vertices in . The same indicator random variable calculation as for all isolated vertices gives
By the Chebyshev inequality, with high probability. Since eventually, the marked vertices are then not all connected.
At , the logarithmic-regime giant component result applies with and any fixed . Its unique giant component misses vertices. On the event that it misses at most twice that number, exchangeability makes the missed vertex set uniform conditional on its size. A union bound therefore gives
Thus all of is connected at with high probability.
For the uniform random graph process, assign uniform labels to the edges of the complete graph as independent random variables and reveal them in label order. The binomial random graph is the prefix containing the labels at most , where has a binomial distribution with parameters and . Its variance at is , whereas the gap between and the relevant endpoint is . The Chebyshev inequality gives and with high probability, with harmless integer rounding. The monotone graph property that all marked vertices are connected now implies
The marked-set connectivity threshold is lower than the threshold for connecting every vertex, because only about specified vertices need to avoid the small graph components.
Put and . The hypothesis implies . For the number of isolated vertices, the isolated vertices in the Erdős-Rényi model formulas give
Thus the Chebyshev inequality gives with high probability, uniformly over the specified range.
The Cayley formula supplies a spanning tree on any connected vertex set. Consequently the expected value of the number of graph components of order is bounded by
Choose a fixed with . For , with , the binomial coefficient bound gives
Here . The geometric series and a union bound therefore exclude this entire size range, since . For , an empty graph cut would be necessary. Its total probability is at most
There are consequently no graph components of orders between and , with high probability.
For each fixed , a graph component containing a graph cycle has a spanning tree and at least one extra edge. Counting that extra edge gives an expected value ; hence every small graph component is a tree component. The total number of vertices in tree components of orders satisfies
The Markov inequality gives with high probability. When , this sum is empty and . Since , the remaining vertices must lie in one graph component larger than . It is unique, and its order is . Every other graph component is a tree with at most vertices. This is the logarithmic-regime giant component mechanism: almost all missing vertices are isolated.
Order the collection of every chain in a partial order, including the empty chain, by inclusion. Suppose that is an order-preserving function and an injection. Let be the Hartogs ordinal: by Hartogs theorem, no injection from to exists.
Use transfinite recursion to define, for ,
We verify both that is defined and that the values are strictly increasing. Assume inductively that the earlier values are strictly increasing. Then is a chain in a partial order. For any , , so the fact that is order-preserving gives . Furthermore , whereas by distinctness of the earlier values. Thus , and injectivity gives . We have proved
The empty initial chain starts the induction, and the same argument applies at every limit ordinal.
If a globally defined recursion rule is desired, apply when the earlier range is a chain and otherwise use the fixed value . The induction shows that the fallback case never occurs. Thus no choices of new points are being made: the function uniquely determines every stage.
The resulting function is an injection from to , contrary to its defining Hartogs ordinal property. Hence the chain-poset nonembedding lemma gives
Here the power set notation gives . Suppose a nonempty set has no -minimal member. Form its intersection . This is a set: for any one , use the axiom schema of separation inside to define the elements common to all members of . Selecting a single witness to nonemptiness is not an application of the axiom of choice.
For an arbitrary , lack of minimality supplies some with . Since , every subset of is a subset of , so
This conclusion holds for each , without choosing all the corresponding simultaneously. Intersecting over gives .
For completeness, the contradiction in Cantor's theorem is completely explicit here. By the axiom schema of separation put . Then , and consequently
which is impossible. Thus no such exists:
This power-set-predecessor relation proof uses neither a descending sequence nor a comparison of possibly non-well-orderable cardinalities. It proves well-foundedness directly from the minimal-member definition.
The Fejér kernel for the printed normalization is
Its endpoint coefficients at are zero. It is nonnegative, and integrating its Fourier series gives . Hence and
Thus the absolute constant can be . Positivity of the Fejér kernel, rather than mere boundedness of its individual Fourier coefficients, is the reason this holds.
Set and . The distinct primes give independent square classes, so and . In particular : these are the same quadratic extension of . We prove it is unramified by an explicit field discriminant calculation.
Since , put , . Both are algebraic integers. The ring has basis . Up to the ordering of the basis, its trace pairing matrix is the tensor product of the quadratic trace matrices, because the four embeddings of choose the two radical signs independently. The two quadratic matrices are
Thus
On the other hand, is squarefree and congruent to one modulo four, so . Let . The discriminant-index formula for an integral lattice and the relative discriminant tower formula give
The ideal norm on the right is a positive integer, while is a positive integer. Hence forces and . Its prime divisors are exactly the ramified finite primes, so is unramified at every finite prime, including primes above . This also proves , agreeing with the discriminant of a biquadratic field formula.
Every embedding of is real, so the real places of split as well. The extension is quadratic, hence abelian. The ordinary Hilbert class field characterization therefore implies
Finally, the Artin reciprocity map identifies with . Restriction onto is surjective, so the ideal class group has a quotient of order two. Therefore .
There is no infinite component in the modulus . The ordinary ideal class group of is trivial, and its unit group is . The ray class exact sequence therefore gives
Concretely, a fractional ideal prime to has a rational generator with . Reducing modulo is well-defined up to multiplication by the units . Its ray class is trivial precisely when one of the two generators is congruent to one. Thus the quotient has the two classes and . No positivity restriction is imposed on a generator.
To identify the corresponding field, put . The maximal real subfield of the fifth cyclotomic field is fixed by complex conjugation, the element of . For a prime , the Frobenius automorphism of is . Its restriction to thus corresponds exactly to the residue class of modulo . Multiplicativity extends this to the Artin reciprocity map on all fractional ideals prime to , whose kernel is exactly . Its field discriminant also confirms that is unramified outside ; moreover is a totally real number field. The uniqueness in the Main theorem of class field theory now gives
Including the real place changes the ray class group: a principal generator must then be positive as well as congruent to one. The residue and signature group of a modulus gives
Here the isomorphism sends to . Consequently , of degree four. The finite modulus gives the real quadratic field; the modulus with the real place gives the full cyclotomic field. The printed finite-modulus assertion needs no correction.
For a number field and a modulus of a number field , let be the group of fractional ideals prime to , and let consist of principal fractional ideals with at the finite modulus and at the real places in . The ray class group is .
The Main theorem of class field theory states that there is a unique finite abelian ray class field for which the Artin reciprocity map induces
It is unramified outside the finite modulus and has no ramification at real places omitted from . More generally, subgroups with correspond, with inclusions reversed, to intermediate abelian fields, with Galois group . Every finite abelian extension occurs for some modulus. Equivalently, is the maximal abelian extension with conductor of an abelian extension dividing . This states both reciprocity and the existence theorem of global class field theory.
For a direct check of unramified behavior, the cyclotomic polynomial divides . Modulo , the latter has derivative and has no common root with that derivative. Thus is separable, so does not divide its polynomial discriminant. The field discriminant divides this polynomial discriminant, and therefore is unramified in . The Frobenius automorphism satisfies
Indeed its residue action is seventh powering. The reduced th roots of unity are distinct because , so the residue congruence identifies the exponent uniquely modulo .
The Galois group is , of order . Since , but . Consequently the Frobenius automorphism has order four. An unramified decomposition group is generated by that element, and the orbit-stabilizer theorem gives
There are therefore five primes above , each with residue field .
Write , and for the number of primes above . The Galois group acts transitively on those primes, with stabilizer . The fundamental identity for prime decomposition and the orbit-stabilizer theorem therefore give
It remains to establish that the residue action has image of order , rather than assume this in the desired equality.
Use the decomposition group of a prime and local Galois group identification . A generator of the finite field extension has a separable monic minimal polynomial of an algebraic element. Lift its coefficients to . The Hensel lemma lifts each of its distinct residue roots to . One such lift has field degree at most , while its residue generates the degree- finite field extension, so its field degree is exactly and its ramification index of a prime ideal is one. It therefore generates an unramified extension of degree , and sending it to each of the other lifts gives its embeddings. Because is a Galois extension, these embeddings extend to its automorphisms. Their reductions realize every automorphism of . Thus the residue action is surjective, and
Now let be cyclic of order , and let be its unique subgroup of order . In a tower of Galois extensions, inertia maps onto inertia in the intermediate extension. This also follows from the just-proved order formula: its image has order , using multiplicativity of the ramification index of a prime ideal in a tower. If ramifies in , this image in is nontrivial. Every proper subgroup of is contained in , so inertia upstairs must be . Hence
The fundamental identity for prime decomposition then also forces a single prime above and residue-field degree one.
For very stable continuously turbulent conditions, , local eddies lose leading dependence on their distance from the wall. In very stable surface-layer similarity, the dimensionless functions must therefore scale as and , with positive closure constants. Using gives
Thus the mean velocity is approximately linear in height and the real buoyancy frequency is approximately constant, . Under the Reynolds analogy, .
The local turbulent kinetic energy balance gives
Positive dissipation requires . The turbulent energy-turnover length is of order , hence of order the Obukhov length, independent of observation height. A related buoyancy-limited length is . The Ozmidov length follows by equating an eddy turnover time with :
These are turbulent turnover or buoyancy-transition scales. If “the scale at which dissipation occurs” means the actual viscous cutoff, molecular viscosity is also required: the Kolmogorov microscales give
Without , the viscous length cannot be fixed by the supplied stress and flux alone. Separating it from the turbulent turnover length avoids confusing an energy-budget estimate with the molecular cutoff.
Finally,
They become height-independent constants. The commonly used continuation gives and . This numerical value is a closure choice, not a deduction from units; setting would incorrectly leave zero dissipation. Extremely stable intermittent or collapsed turbulence need not satisfy this local-equilibrium model. The relation between the Obukhov and buoyancy-dissipation lengths in the local regime is also analyzed in Grachev and colleagues' similarity study.
For lower-boundary heating, forced convection means that mean shear supplies most of the turbulence even though buoyancy assists it, approximately . Free convection means buoyancy dominates, approximately within the constant-flux region. In this limit the local convective speed is
It is the velocity whose eddy transport supplies the imposed vertical turbulent buoyancy flux. The associated diffusivity is , with a dimensionless coefficient fixed by a closure. From ,
Here : there is no real restoring buoyancy frequency. The displayed magnitude is a local overturning/growth rate, or one may write . The Reynolds analogy makes and hence ; the remaining mean shear is weak compared with the convective motion.
The turnover dissipation estimate gives
also consistent with the local energy equation when is negligible. Thus free-convection dissipation is height independent to leading scaling order, in contrast with neutral . The constants and detailed profiles are not determined by dimensional analysis. These are local free-convection surface-layer scalings, not a claim that an entire deep convecting layer has a uniform unstable mean buoyancy gradient.
Define the positive total shear stress by , so the physical wall traction on the fluid opposes the positive flow. The steady mean momentum equation gives
For a driving pressure gradient , the stress decreases upward. It is approximately constant while
An outer boundary-layer height can impose a stricter limit. In the turbulent region outside the viscous or roughness sublayer, the only local neutral scales are and , so . Conventionally write , where is the von Kármán constant. Equivalently, a mixing length and stress closure give the same result. Integration yields the law of the wall
The roughness length is an extrapolation scale, not a statement that the logarithm is valid at the actual solid surface. For a smooth boundary, the viscous inner scales are , . The viscous sublayer has ; farther out , corresponding to . For a fully rough boundary, is proportional to a geometric roughness height and viscosity no longer determines the leading profile. The logarithmic region still needs roughness height .
In local equilibrium, production of turbulent kinetic energy by the shear is . Neglecting its transport relative to production and viscous dissipation,
Dimensional similarity alone gives ; the displayed coefficient additionally uses the local energy balance and the logarithmic shear.

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