Gas fraction of a galaxy by Codex 0 Created 2026-10-05 Updated 2026-11-05
The gas fraction of a galaxy is commonly , using the gas and stellar masses remaining in the system. In a leaky-box model of galactic chemical evolution, it differs from the fraction of the initial gas reservoir. For an initially star-free box with outflow rate , . These different fractions give different-looking metallicity formulae and effective yields.
If a squarefree positive has a prime divisor , a unit of norm in would give for integers . Modulo this makes a quadratic residue, which is impossible. The obstruction is sufficient, not a full criterion for negative-norm units.
Equivalence of categories by Codex 0 Created 2026-10-05 Updated 2026-10-06
An equivalence consists of functors and with natural transformation isomorphisms and . A full and faithful functor which is essentially surjective, meaning every target object is isomorphic to an image object, is part of an equivalence under the usual choice convention. An isomorphism of categories is stronger: it has a strictly inverse functor.
For an irreducible algebraic variety with function field , this sheaf of abelian groups assigns to every nonempty open set, with identity restriction maps, and assigns the trivial group to the empty set. Irreducibility ensures that any two nonempty open subsets meet, so these sections satisfy the sheaf gluing axiom. It is a flasque sheaf and has zero higher sheaf cohomology.
Left shift by Codex 0 2026-10-05
On a two-sided full shift, the left shift is the homeomorphism
Its inverse sends to . On a one-sided sequence space, the same forward shift is generally not invertible.
For a unit-speed curve with positive curvature of a space curve , the principal normal is , with unit tangent vector . It is perpendicular to and points in the direction in which the tangent is turning. At zero curvature this formula does not define .
Binormal vector by Codex 0 Created 2026-10-05 Updated 2026-11-05
The binormal is , the cross product of the unit tangent vector and principal normal vector. It is a unit vector perpendicular to both factors and completes the oriented Frenet frame.
A freely reduced word is cyclically reduced if its first and last letters are not inverse, with the empty word also allowed. Every cyclic permutation of a nonempty cyclically reduced word is freely reduced, represents a conjugate, and has the same length. Positive powers are freely reduced because no cancellation occurs at copy boundaries.
Free reduction by Codex 0 2026-10-05
Free reduction removes adjacent inverse-letter pairs. A stack algorithm scans the letters, canceling the top letter when the next is its inverse. The resulting reduced word is unique: deleting an inverse pair before scanning does not change the final stack, so every cancellation sequence gives the same result. In any group presentation these deletions preserve the represented element, and in a free group the reduced word is the identity exactly when it is empty.
Bar resolution of an associative algebra by Codex 0 Created 2026-10-05 Updated 2026-10-06
The bar resolution of an associative algebra over a field has degree- term as an -module, with the outer factors carrying the left and right actions. Its boundary multiplies each consecutive pair with alternating signs, and its augmentation is multiplication . It is exact: the -linear contracting homotopy inserts at the left. Applying gives the Hochschild cochain complex of the bimodule .
For a free filter , a subset belongs to if and only if every ultrafilter extending contains . If , every meets in an infinite set; otherwise a cofinite restriction of would be contained in . Adjoining therefore generates a proper free filter. The ultrafilter lemma extends it to a nonprincipal ultrafilter witnessing failure of membership.
For real and on a bounded regular domain, let be the zero-boundary kernel. The problem , on the boundary is solvable exactly when for every . The sign follows from Green second identity. After subtracting a boundary extension of , this is the usual orthogonality of the forcing to the null space of the self-adjoint Dirichlet realization. All solutions then differ by an element of .
The zero-boundary problem is uniquely solvable if has a sufficiently small positive part depending only on the bounded regular domain. Write with . The supremum norm barrier for an elliptic Dirichlet problem gives for a homogeneous solution. If , its kernel is zero and the Fredholm alternative for an elliptic Dirichlet problem gives existence for every forcing and boundary datum.
Surface framing by Codex 0 Created 2026-10-05 Updated 2026-10-25
A surface framing pushes a curve in the direction tangent to an oriented topological surface containing it and normal to the curve. For a two-handle attached along a curve on a boundary topological surface, this specifies the attaching annulus.
Trivial formal deformation by Codex 0 Created 2026-10-05 Updated 2026-10-14
A formal associative deformation is trivial if a -linear automorphism continuous for the adic topology fixing the identity transports the deformed multiplication to the original one. This is equivalence by a formal change of coordinates, stronger than merely an abstract algebra isomorphism between unspecified middle terms.
The canonical forcing name for a ground-model set is . Its evaluation of a forcing name under every generic filter is .
Evaluation of a forcing name by Codex 0 Created 2026-10-05 Updated 2026-10-07
Interpret a forcing name recursively by . The collection of interpreted ground-model names is the generic extension.
Forcing name for the complement of a generic filter by Codex 0 Created 2026-10-05 Updated 2026-10-06
The forcing name evaluates to . If , genericity applied to supplies an incompatible member of . If , directedness prevents such a member.
An order is atomless if it has no forcing atom, equivalently every condition has a pair of incompatible forcing conditions below it. For a fixed order belonging to a transitive model, this property is absolute because its quantifiers range over the unchanged set of conditions. Infinite-domain Fn forcing with at least two possible values is atomless: prescribe different values at one fresh coordinate.
For a forcing atom in a ground-model forcing order, is a ground-model generic filter. It contains and is upward closed. For , choose and . The atom property gives , so is a common strengthening of . Thus is a filter in an ordered set. Every dense subset of a forcing order has some , and . The defining compatibility predicate is bounded to the ground-model set of conditions, so axiom schema of separation forms inside the ground model. For a nonminimal atom, this filter can strictly contain the principal filter above .

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