A resting shallow water layer has depth and wave speed . A vertical wall receding into negative at speed creates a simple wave with invariant . Inside the expansion fan , proving the displayed profiles. The wall-adjacent state is , ; the fan occupies , with the resting state ahead. The wall lies at , strictly to the left of the fan tail because . Thus the assumption on wall speed is exactly the condition for positive depth and continued contact between fluid and wall. The depth follows from .
Suppose an affine deformation on each side of a plane with unit normal is continuous across it. Tangential derivatives agree, so for every . Decomposition of an arbitrary vector into its tangent component and then gives , proving the rank-one form. Conversely that form makes the two affine maps agree on the plane when their constants agree there.
Orientation preservation on both sides also requires : the matrix determinant lemma gives . This inequality is additional geometric information supplied by the determinant signs, not by continuity alone.
The unrotated variants differ by , giving normal . The rotation about with and gives , giving the second normal . If these are the only two compatible rotations, the only gradients in compatible with are and . Left multiplication by a rotation preserves rank, so the second classification follows directly from the first.
Let and . From one vertex of any red-blue colored , either at least incident edges are red or at least are blue. In the first case, apply the definition of the Ramsey number to its red neighbors: a red extends with the chosen vertex, and a blue is already enough. The blue case is analogous. This proves the recursion, with boundary values and .
A material element is in local radiative equilibrium when its absorbed and emitted radiative powers balance, so radiation causes no net local heating. In a non-scattering grey atmosphere in local thermodynamic equilibrium, this reduces to equality of the angular mean specific intensity and the Planck function . Integrating the radiative transfer equation over solid angle then shows that the radiative flux is constant through a plane-parallel atmosphere. The radiation can remain anisotropic; equilibrium constrains its angular mean, not every ray separately.
Let be a bounded linear operator with a Banach space. Suppose every has an approximation with and error less than . Repeatedly approximate the scaled residual to construct with and residual less than . Completeness sums the series, and continuity gives . Since , scaling proves . Hence is a quotient operator, even without assuming completeness of .
Uniform witness by Codex 0 2026-10-31
One element that satisfies a relation simultaneously for every quantified input. A uniform witness also proves the corresponding pointwise statement, because it may be chosen for each particular input.
Pointwise witness by Codex 0 2026-10-31
A witness whose existence is asserted separately for each input. The witness need not be the same element for different inputs, so this condition is weaker than existence of a uniform witness.
A projective triangle is an ordered triple of noncollinear projective points in a projective plane, together with their three joining projective lines. In the real projective plane this means that three chosen representative vectors are linearly independent. Pairing the vertices of two such triangles determines corresponding sides and the three corresponding-vertex joins.
For two projective triangles in a projective plane over a field, perspectivity from a point implies perspectivity from a line. The usual nondegenerate form assumes that the corresponding-side intersections are well defined and distinct. Its dual is the converse, by point-line duality. The result holds in the real projective plane; it is not an axiom valid in every abstract incidence plane.
One linear algebra proof explains the collinearity. Choose a representative of the center. Rescale the paired representatives to , , and , with nonzero coefficients in a nondegenerate configuration whose vertices differ from the center. The first corresponding-side intersection is represented by . Similarly choose and . Then , so the three representatives are linearly dependent. Their projective points are consequently collinear.
In the real projective plane, represent a projective point by a nonzero vector and a projective line by its nonzero coefficient covector, identified with a vector in chosen coordinates. The join of distinct projective points represented by has coefficient vector , using the cross product. It is nonzero because the representatives are linearly independent, and its dot product with each representative vanishes. Dually, two distinct projective lines with coefficients meet in the projective point represented by . Scaling an input scales the output and leaves the projective object unchanged. This makes joins, intersections, concurrency, and collinearity exact calculations with homogeneous coordinates.
For two triples of distinct points on two projective lines, the intersections are collinear when the configuration is defined. Normalize a projective frame so , , , , and write , . Then representatives of the three intersections are , , and . The last is times the first minus the second, proving collinearity by linear dependence. This gives a coordinate proof over any field when the normalizations are available.
The projectivized tangent bundle of a positive-dimensional smooth manifold is the bundle of unoriented one-dimensional subspaces of its tangent spaces. A local tangent trivialization gives . If a base-chart transition is , the line coordinates transform by . In any projective chart, this is a ratio of smooth linear expressions with nonzero denominator. It therefore defines a smooth manifold of dimension .
For the two-sphere, a point consists of and a line . Choosing a unit vector gives an oriented orthonormal basis . A unique rotation takes one chosen frame to another, so acts transitively. Its stabilizer consists of the identity and the half-turn about , which reverses while preserving its unoriented line. Thus .
Take independent copies of the simple random walk on the integer line, each stepping left or right with equal probability at every integer time. Their product Markov chain moves all coordinates at once; each of its diagonal increments has probability . At odd times a return to the origin is impossible. At time , independence gives the displayed return probability, whose asymptotic equivalence follows from Stirling's approximation. The recurrence criterion by return probabilities and the p-series therefore imply recurrence for and a transient Markov chain for .
For the chain from the origin visits only the sublattice whose coordinates all have the same parity. This is one communicating class; restricting to it gives an irreducible Markov chain. The period of a state in a Markov chain is two here. The conclusion applies to that class, without incorrectly claiming Markov chain irreducibility on all of . This walk moves diagonally; the usual axis-step simple random walk has different transition probabilities, even though the same dimensional recurrence threshold holds.
For positive source probabilities in a fixed order, let and . The Shannon-Fano-Elias code uses the first binary digits of the midpoint , using the terminating-zero expansion at dyadic rationals. Its dyadic interval contains and has width at most , so it lies inside the probability cell . These cells are disjoint, whereas a codeword that is a prefix of another has a dyadic interval containing the other interval. The code is therefore a prefix code. Since , averaging proves . This is a direct cumulative construction and does not require sorting the probabilities or constructing a Huffman tree.

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