Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Nonbiological molecular oxygen can accumulate when photochemistry and planetary redox sinks allow it, for example after water photolysis and hydrogen loss. Ozone produced from that oxygen is not independent proof of a biological source. The stellar spectrum, water inventory, atmospheric escape and other gases constrain these interpretations.
The adjoint bundle is the associated vector bundle for the Adjoint representation of a Lie group on its Lie algebra. The gauge curvature of a principal connection is globally a two-form with values in this bundle. Differences of principal connections and their infinitesimal variations are one-forms with values in the same bundle.
For a Noetherian ring and a proper ideal , every minimal prime over is an associated prime of a module . The localized quotient has one prime, so its finitely generated maximal ideal is nilpotent and its socle is nonzero. An element with annihilator can be lifted to the quotient. Clearing denominators for a finite generating set of gives a nonzero element with annihilator exactly .
An associated prime of a module is embedded when it is not minimal over . For example, in the nonzero class of has annihilator , while the unique minimal prime is . Embedded primes record annihilators which are invisible if one retains only the reduced irreducible components.
These feasible potentials give the lower bound on every assignment cost. An assignment using only equality edges attains this bound and is optimal by weak duality and complementary slackness.
The Hungarian algorithm maintains feasible assignment dual potentials and a matching of equality edges. If the alternating search cannot augment, adjust reachable job and agent potentials by the smallest reduced cost leaving the search set. This preserves feasibility and existing matching equalities while exposing a new equality edge. A resulting perfect matching attains the dual lower bound.
The unit vectors realizing an approximate eigenvalue are approximate eigenvectors: their residual tends to zero, although they need not converge to any genuine eigenvector.
Complex potential reduction of anti-self-dual Yang-Mills by
Codex 0 Created 2026-10-06 Updated 2026-11-05
Locally, the ASDYM equations permit a complex gauge with . The trace equation then gives and . The remaining curvature equation is . A complex gauge generally makes valued in the complexification of a Lie algebra; reconstructing a real connection requires its inherited reality condition. The gauge/potential construction is local and need not preserve prescribed behaviour at infinity.
Under a length blocking factor , a scalar scaling field transforms as . Its critical connected correlation function consequently decays as . Comparing with identifies the anomalous part of the field dimension. The uniform conjugate field has scaling exponent . Wave-function factors must be defined explicitly before assigning a sign to their logarithmic derivatives.
For equal internal and external pressures, zero axial strain rate and positive surface tension, annular viscous extension gives constant and thickness . Since , the central hole closes atThe formula holds until closure and requires a genuine initial annulus; the subsequent topology has no inner cylindrical interface.
Over a commutative unital ring, an ideal maximal among annihilators of nonzero elements of a module is a prime ideal. Each such ideal is the annihilator of a module given by the cyclic submodule generated by that element. If and with , then and . Maximality makes these annihilators equal, so . A Noetherian ring ensures that a nonzero module has a maximal element annihilator by the ascending chain condition on ideals.
The lower bound makes internal vertical velocity variation negligible; the upper bound makes internal in-plane extensional stress negligible compared with ambient traction. Both are needed for an ambient-controlled interfacial plug current.
Linearity of Stokes flow and Uniqueness of Stokes flow identify the ambient resistance to an expanding thin plug with the reversed perturbation around a stationary disc in an axisymmetric straining flow. The imposed straining flow has zero tangential stress on the disc plane. Each face then resists radial velocity with traction .
For two mixed points with difference and gradient difference , the input difference is and the output difference is . Their squared-norm difference is . This exact identity is a reusable way to prove averagedness without assuming the two block maps are individually nonexpansive.
Implicit nonsmooth block in alternating proximal-gradient iteration by
Codex 0 Created 2026-10-06 Updated 2026-11-05
Let be convex with an -Lipschitz gradient, , and let be a proper lower semicontinuous convex function. For , takeThe proper closed convex assumption on ensures that the implicit section has a well-defined proximal operator.
For two mixed points with difference , write for the gradient difference of and for the difference of the selected subgradients of . Inputs differ by and outputs by . Monotonicity of a convex subdifferential gives , while cocoercivity gives . Expanding these squared norms provesfor . Thus the combined update is firmly nonexpansive. Its fixed points are the minimizers of ; if one exists, the Browder convergence theorem for averaged operators gives norm convergence in finite dimensions.
For an infinite almost disjoint family on omega of size less than the bounding number, select countably many members and remove their intersections with earlier selected members to obtain infinite disjoint sets . Bound, eventually and simultaneously, the finite intersections of each member with . Choose one point of each above its bound. The resulting infinite set is almost disjoint from every original member, proving the family is not maximal. A selected member has one exceptional infinite intersection, which is ignored in its bounding function.
Assume risk-neutral players have independent identically distributed atomless nonnegative values and use an increasing symmetric equilibrium in a rank-order contest with unit effort costs. Let prizes satisfy , and normalize the lowest type's equilibrium utility to zero. For descending order statistics ,To derive it, decompose the prize vector into layers: layer gives to each of the best players. A truthful multi-unit auction implementing that allocation charges each winner , hence total . Revenue equivalence transfers its expected payment to the all-pay contest, since the interim allocation and lowest-type utility agree. Summing the layers proves the formula. The symmetry and common-value-distribution assumptions are needed to identify rank allocation from the bid ranking.
For effective prizes and unit effort costs, equilibrium effort CDFs on are and . The weaker player has an atom at zero. Incremental utilities are and zero, and winning probabilities are and . Direct payoff indifference and exclusion of larger bids verify the Nash equilibrium. A further player with effective prize at most cannot profit by entering against these distributions.
A countable algebra of sets generating the intended sigma-algebra. Standard Borel spaces admit such algebras by taking finite Boolean combinations from a countable topological base. Finite linear combinations of its indicators are dense in for every Borel probability measure, by the Monotone class theorem. Countability permits a common full-measure convergence set for all test indicators.
The Alfvén velocity is the signed vector , whose magnitude is the Alfvén speed. It follows the orientation of the magnetic field, unlike the nonnegative scalar speed.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





