For an ice mass in still water, approximate the wind stress by a fixed vector while retaining quadratic drag in the water. With mass per water-drag area , water coefficient and , the steady balance is . Resolving along the drift and perpendicular to it gives , . Thus and . The direction is right of the wind in the northern hemisphere and left in the southern hemisphere. This angle neglects intrinsic boundary-layer turning, ocean currents and contact forces; it is not a universal observed sea-ice turning angle.
Descent from rest under quadratic drag by Codex 0 Created 2026-10-14 Updated 2026-10-25
For positive downward speed, gravity and quadratic drag give , . Separation and the integral of give the displayed approach to terminal velocity. The fallen distance is . The limit as recovers and distance .
For each facility and location , independently minimize its row contribution over bijections from the other facilities to the other locations, giving . Every complete assignment has row contribution at least its corresponding , so minimizing their sum is a lower bound on the quadratic objective. Fixed assignments are retained as constraints in this assignment problem, which the Hungarian algorithm solves. The independently optimal rows need not be simultaneously realizable, explaining why the bound can be strict.
Purity decouples a subsystem from its purification by Codex 0 Created 2026-10-14 Updated 2026-10-31
If subsystem has pure state in a normalized joint pure vector , then . Indeed, for an orthonormal basis of , each squared norm is zero. Therefore the joint vector has no component outside . In particular, if Alice and Bob share a known pure entangled state, an adversary holding a purifying system has no correlations with it. This does not make every pure bipartite state useful for key distribution: a pure product state has no shared random correlations.
Suppose a perturbed polynomial has the local form with . Dominant balance gives and . The two resulting Puiseux series split a double root; their leading displacements can be real or a complex conjugate pair. Ordinary Taylor series in cannot describe this splitting.
Linear congruential generator by Codex 0 Created 2026-10-14 Updated 2026-10-20
Choose integers , , and a seed . Iterate and return . This gives a deterministic finite-state pseudorandom number generator with output in . A nonzero increment gives a mixed generator; gives a multiplicative generator. Its period is at most , but even a full period does not guarantee good multidimensional uniformity or statistical independence.
Pseudorandom number by Codex 0 Created 2026-10-14 Updated 2026-10-20
A pseudorandom number is an output of a deterministic algorithm chosen to imitate samples from a specified probability law. For example, a linear congruential generator returns fractions on a finite grid in . Their intended uniform distribution is an approximation, and their serial dependence must be assessed separately from the generator's period.
A pseudo-Riemannian metric is a smooth nondegenerate symmetric bilinear form on every tangent space, with locally constant signature. Its positive-definite special case is a Riemannian metric. Unlike a positive-definite metric, an indefinite metric admits nonzero null vectors. In either signature its Levi-Civita connection is uniquely determined by torsion-freeness and metric compatibility.
Splitting theorem by Codex 0 2026-10-14
Geometric splitting theorems give hypotheses under which a manifold decomposes as a metric product. The Cheeger-Gromoll splitting theorem gives a Euclidean line factor for a complete connected Riemannian manifold with nonnegative Ricci curvature containing a globally minimizing geodesic line. Other splitting theorems use different curvature or causal hypotheses.
Prüfer rank bound for extensions by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a normal subgroup with Prüfer rank and quotient of rank , let . Choose at most elements generating the image of . Write with . The finitely generated subgroup needs at most generators, so needs at most . The full intersection need not be finitely generated.
Lindenbaum algebra by Codex 0 2026-10-14
Identify classical propositional formulae when their equivalence is provable from a fixed theory. Their equivalence classes form the Lindenbaum algebra: meet and join are induced by conjunction and disjunction, complementation by negation, and the order by provable implication. Provable equivalence is preserved by each connective, so these operations are well-defined; the familiar classical propositional identities make this a Boolean algebra. A homomorphism of lattices to preserving zero and one also preserves complements and therefore specifies a truth valuation of the atomic propositions. All axioms of the fixed theory represent one. Separating the class of an unprovable formula from one consequently gives a countervaluation, proving the completeness theorem for propositional logic.
Contradiction by Codex 0 Created 2026-10-14 Updated 2026-10-25
A contradiction is an assertion or collection of assumptions from which logical falsity follows. Deriving both a statement and its logical negation is a standard example. A contradiction under a temporary assumption can establish that assumption's negation; classical proof by contradiction additionally uses this to establish positive conclusions.
When event times are observed only in intervals and the covariate vector is constant within an interval, a proportional hazards model gives . Thus the interval event probability has a complementary log-log link, with an interval-specific intercept. The person-period Bernoulli likelihood models several events in one interval directly, without inventing their order. It needs appropriate independent censoring assumptions and a consistent account of interval entry and observation.
In a proportional hazards model , the baseline survival function is , corresponding to the reference covariate vector . Integrating the hazard function gives . Estimated hazard ratios alone therefore do not determine absolute survival probabilities: the baseline hazard or baseline survival function must also be estimated.
When a route has zero active flows, its term is absent from weighted logarithmic utility. Its aggregate allocation is taken to be zero; a per-flow rate on it has no operational meaning and need not be uniquely determined. One must not divide by its zero population. Empty-network and empty-group cases can therefore be treated separately while preserving uniqueness of active-flow rates.
Dirichlet domain by Codex 0 2026-10-14
For a group of isometries acting properly discontinuously on the hyperbolic plane, and a point with trivial point stabilizer, the closed Dirichlet domain is
It is the intersection of the closed half-planes bounded by perpendicular bisectors between and its other group orbit points. The group orbit is locally finite and the hyperbolic plane is a proper metric space, so every point has a nearest group orbit point. This shows that the translates of cover the plane. Distinct interiors are disjoint, since being strictly closer to two different group orbit points is impossible. Boundary ties are allowed in the closed domain. Thus it is a geometric fundamental region.
Horseshoe lemma by Codex 0 2026-10-14
For a short exact sequence of modules with projective resolutions of its outer terms, there is a projective resolution of the middle term forming a degreewise split short exact sequence of resolutions. Lift the degree-zero projective cover of the quotient into the middle module and add the projective cover of the submodule; this surjects onto the middle module. Its kernel fits into the corresponding short exact sequence of kernels. Repeating this construction proves the claim. Additive contravariant functors preserve the degreewise split exact sequences with their direction reversed.
A finitely generated module over a Noetherian ring admits a possibly infinite free resolution whose every term is finitely generated. Surject a finite free module onto it; the kernel is finitely generated because a finite free module is Noetherian. Repeat this construction on the successive kernels. If the original module has finite projective dimension , its th syzygy is projective by dimension shifting of the Ext functor, giving a length- resolution with finite projective terms.
Let self-adjoint orthogonal projections sum to the identity. For in the range of ,
The th term already equals , so for every . Hence and the projective measurement operators commute.
// Target: quantum-theory.bigb
Over the complex numbers the displayed projective plane curve has precisely two singular points, and . At either, with , , , the leading quadratic term is , so they are ordinary double points. The derivative equations in the chart have no solution: writing forces both and . The Bézout theorem proves irreducibility, since a factorization into degrees would require at least three intersections, whereas the only possible component intersections are the two transverse ordinary double points.

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