For arc capacities , the feasible flow has value four. The displayed residual path has bottleneck one and traverses opposite to the original arc . Augmentation cancels one unit there and gives of value five. The sink cut has capacity five, proving optimality. Reverse residual arcs are what permit rerouting instead of only adding flow along unused forward arcs.
A representation of a C-star algebra on a Hilbert space is a star-homomorphism . It is cyclic if some vector has dense orbit span as displayed; the orbit is itself a linear subspace. For a unital representation, a unit cyclic vector defines a state on a C-star algebra by . Conversely, the Gelfand–Naimark–Segal construction realizes every state this way. Cyclicity means density under the action of the whole algebra, not necessarily under powers of a single chosen element.
T3 space by Codex 0 2026-10-31
A T3 space is a regular topological space which is also a T1 space. Every metric space has this property: singletons are closed, and a sufficiently small ball about a point outside a closed set has closure avoiding that set. A second-countable T3 space is a metrizable space by Urysohn's metrization theorem.
Let be a regular pair of vertex sets with parameter , equal class sizes , density greater than , and every vertex having at least neighbors across the pair. Then it has a perfect matching. To prove Hall's condition, take . If , one vertex already supplies at least neighbors. If and , the two large sets and have density zero, contradicting regularity and the positive density surplus. Finally, if , every vertex of has a neighbor in , so . The empty subset satisfies Hall's condition directly.
Let and suppose an -vertex graph has induced-edge discrepancies whenever . Any two disjoint vertex sets of size at least then form an epsilon-regular pair. Indeed, inclusion-exclusion of the induced edge counts gives
whenever both sets have size at least . The original pair has density within of , while each pair of allowed relative subsets has density within of . Their densities differ by less than .
Thus induced subgraph counts control bipartite regularity, even when the two original sets have different sizes. Equal partitions with a small exceptional remainder follow for each fixed once is sufficiently large to absorb integer rounding. That size condition cannot be discarded if all nonexceptional classes must be nonempty.
For a regular outer measure and measurable , the forward implication is countable additivity. For the reverse, choose a measurable hull of and intersect it with to obtain and . Measurability of splits into and , so
The assumed equality and finiteness force . Every outer-measure-null set is measurable by Caratheodory measurability criterion, so is measurable. Finiteness prevents invalid subtraction of infinite masses.
For a regular outer measure, its Caratheodory measurability criterion defines a maximal algebra of sets on which that outer measure is finitely additive. Indeed, suppose an additive algebra contains all measurable sets and also . Given of finite outer measure, take a measurable hull of equal mass. Finite additivity splits by , and monotonicity gives . Outer subadditivity gives equality. For infinite mass that equality already follows from outer subadditivity. Thus was measurable. No sigma-finite measure assumption is necessary.
Null recurrent Markov chain by Codex 0 Created 2026-10-31 Updated 2026-11-05
An irreducible Markov chain is null recurrent when every state is a null recurrent state: it returns to that state almost surely, but its mean recurrence time is infinite. Such a countable-state chain has no stationary distribution.
If and for positive integers , each halving removes one binary digit until zero is reached. There are such steps. The formula follows by strong induction, using for and checking separately. With fixed positive , this is as ; the zero case retains its separately defined value.
Prove a proposed bound by mathematical induction, substituting the inductive hypothesis for smaller arguments into the recurrence relation. Choose its constants so the resulting inequality implies the proposed bound at the current argument, and verify all base cases. A leading-order guess may need an additional lower-order term to make the induction close. The entropy potential for a divide-and-conquer recurrence is an example using a linear correction to an bound.
On vertices , take the simplicial complex generated by . Every edge occurs in two facets. The vertex links, listed cyclically, are , , , , , and , respectively. Thus each vertex link is a cycle graph, and the realization is a compact connected surface without boundary. Its Euler characteristic is , so the classification theorem for surfaces identifies it with the real projective plane. All fifteen possible edges occur, and the listed triangles are distinct three-element sets, so this is an honest abstract simplicial complex, not merely a polygon presentation.
In a triangle whose two sides at an apex are glued with that apex fixed, cross-sections become circles and the apex becomes their cone point. This quotient is a disc. A second triangle with boundary word becomes a Möbius band after the sides are identified. Gluing the remaining boundary to the first disc caps the band and gives the real projective plane. The resulting two-face cell structure has two vertices, three edges and Euler characteristic one.
For with homogeneous mixed Dirichlet and Neumann boundary conditions, testing the Backward Euler method finite element equation with the new solution gives the displayed identity. Both the squared derivative norm and the squared function norm are required in the dissipation, because diffusion and reaction contribute separately. Replacing the full norm by its seminorm omits the reaction term. Positivity gives unconditional decay of the norm.
In a homogeneous isotropic elastic half-space , a Rayleigh wave with factor has two depth factors and . Substitution into the Navier-Cauchy equation factors the amplitude determinant into longitudinal and transverse factors, giving the displayed exponents. Strict exponential decay requires . The longitudinal constituent has ; the transverse constituent has . The free-surface traction conditions select a combination of both constituents.
For a Rayleigh wave at a free surface of a homogeneous isotropic elastic half-space, define and . Cancelling the two surface tractions between the constituents with Rayleigh wave decay exponents gives the displayed equation with . Equivalently . Squaring gives a factor times . For stable Lamé parameters, , so , , and on . Its concavity ensures exactly one crossing in this interval. Both sides of the unsquared equation are positive, so this root gives the physical speed. The zero root is a degenerate static cancellation, not a propagating Rayleigh wave.
Let be a rational vector subspace of the real numbers and let . Every element of has a unique expression . For any prescribed real number , the rule extends a rational-linear map on and remains rational-linear. The uniqueness follows because a nonzero rational multiple of cannot lie in .
Let be transcendental over a field and let be the field automorphism sending to . The rational function is fixed, and satisfies . Thus the extension over has degree at most two. It is not one because the nontrivial automorphism fixes . The fixed field of also has index two by the fixed-field theorem, so it equals .
No nonconstant polynomial in is fixed by inversion. For a polynomial of positive degree, substitution of creates negative powers, whereas the original has positive powers. Uniqueness of the coefficients of a Laurent polynomial rules out equality. Consequently this fixed field cannot have a generator that is a polynomial in the original variable, even though it has the simple rational-function generator above. The statement is valid in characteristic two as well: and remain distinct transcendental rational functions.

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