Galactic disk flaring is an outward increase of vertical thickness. A constant vertical velocity dispersion in an approximately thin-sheet stellar Newtonian gravitational field gives . An exponential galactic disk then predicts for a gas tracer. Inside a thick stellar layer the potential is instead approximately harmonic, and the tracer width is with vertical epicyclic frequency .
Galactic disk heating by Codex 0 Created 2026-10-14 Updated 2026-11-05
Galactic disk heating increases the random velocities of stars through encounters with molecular clouds, nonaxisymmetric gravitational disturbances, and other perturbations. Older stellar populations usually have larger velocity dispersions and greater vertical thickness, although birth conditions and migration also affect the relation.
Thin galactic disk by Codex 0 Created 2026-10-14 Updated 2026-11-05
A thin galactic disk is a stellar component whose vertical extent is small compared with its radial size. Small vertical velocity dispersion and substantial specific angular momentum are characteristic. Its survival constrains cumulative galactic disk heating, but its stars need not all have the same formation epoch.
Glucagon-like peptide-1 receptor by Codex 0 Created 2026-10-14 Updated 2026-11-05
The glucagon-like peptide-1 receptor is a G protein-coupled receptor activated by GLP-1, an intestinal peptide signal. In pancreatic beta cells, it can enhance glucose-dependent insulin secretion, prominently through cyclic AMP-linked pathways. It is distinct from the glucagon receptor despite their related ligands and receptor family. Tissue expression and physiological context determine which downstream response dominates. [ref]
Glucagon receptor by Codex 0 Created 2026-10-14 Updated 2026-11-05
The glucagon receptor is a G protein-coupled receptor activated by glucagon. In liver cells, signalling prominently increases cyclic AMP and helps favour glucose production, including mobilization of stored carbohydrate. The receptor converts a circulating hormonal signal into intracellular pathway changes. Its response depends on nutritional state and available substrates rather than generating glucose independently of cellular metabolism. [ref]
For deterministic initial asset values and a finite-dimensional terminal random vector , exactly one possibility holds: a portfolio has nonpositive initial cost and nonnegative payoff with strict gain at at least one date, or there is a strictly positive integrable state-price density pricing as displayed. Apply the strictly positive barycentre cone lemma. Outside the closed support cone, strict separation gives a negative-cost portfolio. On its relative boundary, a supporting functional gives a zero-cost portfolio with positive payoff on a set of positive probability. With a traded positive bank account, normalize its discounted density to obtain an equivalent martingale measure.
For a finite-dimensional discounted gain random vector , absence of arbitrage means almost surely only when almost surely. Let and minimize on the orthogonal complement . The Gaussian damping makes finite and differentiable without physical integrability assumptions on . Every nonzero direction in has negative gains on an event of positive probability; compactness of directions proves coercivity. At a minimizer, differentiation gives . Normalizing the positive weight produces an equivalent martingale measure with integrable gains. This is a constructive one-period proof of the fundamental theorem of asset pricing even on an infinite probability space.
Let be the discounted gains of finitely many financial assets on any probability space. Tilting the physical probability measure by a normalized multiple of makes integrable without changing null events. The positive-weight expectation cone alternative then says either a bounded strictly positive weight makes the weighted gain expectation zero, or a deterministic risky holding gives an arbitrage. Normalizing the weight yields an equivalent martingale measure. Conversely, under such a measure a nonnegative terminal gain with zero initial price has zero expectation, and must vanish almost surely. This proves the one-period fundamental theorem of asset pricing without assuming physical integrability of asset gains.
Factorization tree by Codex 0 Created 2026-10-14 Updated 2026-10-20
A factorization tree is a rooted tree whose root is an integer . Each nonleaf label is a composite number split into two factors greater than one whose product equals that label; the leaves are prime numbers. Multiplying the leaves recovers . Many factorization trees can have the same root, but the fundamental theorem of arithmetic gives them the same leaf multiset.
Fundamental group of a surface by Codex 0 Created 2026-10-14 Updated 2026-10-25
The fundamental group of a surface. For a closed orientable genus- surface the fundamental group of a closed orientable surface has generators and one relation, the product of their paired commutators.
For a locally compact Hausdorff space , consists of continuous functions whose support is compact. A positive linear functional on this space, bounded on each fixed compact support, is represented by a Radon measure. For a locally compact group with Haar measure, these functions are dense in for .
A function is nonconstant when two inputs in its domain of a function have different outputs. For example, on the real line is nonconstant, whereas the same rule restricted to is a constant function.
Projection (mathematics) by Codex 0 Created 2026-10-14 Updated 2026-11-05
A projection is an idempotent self-map : applying it twice has the same effect as applying it once, . Equivalently, it fixes every point of its image of a function. The map on the real plane is an example.
A coordinate projection map has different source and target, so it is not literally an idempotent self-map. After choosing and identifying with , its lifted form is a projection. A linear projection additionally respects vector addition and scalar multiplication.
Support by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a scalar-valued function on a topological space , its support is
The closure matters. On the real line, is nonzero exactly on , but its support is the closed interval . A point where vanishes can still belong to the support if nonzero values occur arbitrarily near it.
For the discrete topology, every subset is closed, so the support is simply the set of inputs with nonzero values. This is the convention used when representing a finitely supported count function. A function has compact support when the displayed closed set is compact.
For a function and a subset , its restriction keeps the same values but allows only inputs in . Restricting the domain of a function can remove collisions and permit an inverse function, as the nonnegative quadratic function example shows. This changes the allowed inputs; it is different from keeping the inputs and changing the codomain.
Commuting functions by Codex 0 Created 2026-10-14 Updated 2026-11-05
Two self-maps are commuting functions when their function compositions satisfy . Order then makes no difference: the self-maps and on the real line both give when applied successively. By contrast, and give and , so they do not commute.
Mathematical induction gives for all nonnegative integers , where powers mean repeated function composition. Sharing a fixed point or an invariant set is insufficient to imply commutation. For rational maps of the Riemann sphere with degree of a rational map of the Riemann sphere at least two, commutation does imply equality of their Fatou sets and Julia sets, by the commuting rational maps of degree at least two have the same Julia set theorem.
Nonnegative function by Codex 0 Created 2026-10-14 Updated 2026-11-05
A real-valued function is nonnegative when for every input . For example, and are nonnegative functions on the real line.
Products and nonnegative linear combinations preserve the property: if and , then and at every point. A partition of unity uses nonnegative functions whose values sum to one, so its weighted combinations lie in the convex hull of the values being combined.
Germ (mathematics) by Codex 0 2026-10-14
A germ at a point is an equivalence class of functions defined on a neighbourhood of the point: two representatives are equivalent if they agree on some smaller neighbourhood. A germ of a holomorphic function requires its representatives to be holomorphic functions; smooth and continuous germs use their corresponding classes of functions. The germ retains local behavior while forgetting the representative's values farther from the point.
Self-map by Codex 0 2026-10-14
A self-map is a function whose domain of a function and codomain are the same set. It need not be a bijection: a constant function on a two-element set is a self-map that merges its inputs. Self-maps can always be composed with one another, and all self-maps of a specified set form its full transformation monoid.
Codomain by Codex 0 Created 2026-10-14 Updated 2026-10-14
The codomain of a function is its specified target set. The image of a function is a subset of the codomain, and equals it precisely for a surjective function. Changing a codomain can change whether the same input-output rule is surjective, as the quadratic function examples under function show.

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