In a regular category, a relation is total if its projection to is a regular epimorphism, and single-valued if two pairs with the same first component have the same second component. The latter makes that projection a monomorphism. A regular epimorphism that is monic is invertible, so has graph exactly . No axiom of choice or set-based element selection is used.
The category of relations on sets has sets as objects and binary relations as morphisms. Relational composition declares when some intermediate satisfies both component relations; the identity is the diagonal relation.
For a set-valued covariant functor on a small category, the Yoneda lemma sends the element to the transformation . These transformations form a cocone indexed by the opposite category of elements. At , send the representative to . It is surjective using ; two representatives of are identified through that same object of the category of elements. This proves the displayed presentation pointwise.
The ordinary generating function packages the Catalan recurrence. Its Cauchy product gives the formal power series identity
The constant term is . Solving the quadratic equation chooses
with the formal power series square root having constant term one. The apparent quotient at has constant term one after cancellation; the other quadratic solution has a pole and cannot be this ordinary generating function. The equation records the empty object or an outer unit with two ordered smaller objects.
Oriented-axis invariant Cartesian tensor by Codex 0 Created 2026-10-14 Updated 2026-11-05
A Cartesian second-rank tensor invariant under all rotations about an oriented unit axis has the displayed form. A half-turn about the axis eliminates the mixed axial-transverse entries, and a quarter-turn makes the transverse block a scalar matrix plus an antisymmetric planar rotation generator. Conversely both transverse terms commute with every rotation about the axis. The antisymmetric term is allowed unless symmetry or an additional axis-reversing rotation is imposed. This differs from an axially invariant second-rank tensor for an unoriented axis.
For a constant orthogonal Cartesian coordinate change , a Cartesian second-rank tensor obeys . The chain rule gives . Consequently , the transformation rule for a vector. Under non-Cartesian position-dependent coordinate changes, partial derivatives must be replaced by the appropriate covariant derivative.
Every three-dimensional Cartesian second-rank tensor splits into scalar, symmetric-traceless, and antisymmetric parts. Their coefficients are , , and . The epsilon contraction identity reconstructs the antisymmetric part and proves uniqueness. Under proper rotations behaves as a vector, but under reflections it is an axial vector.
Cubically invariant second-rank tensor by Codex 0 Created 2026-10-14 Updated 2026-10-18
A Cartesian second-rank tensor in three dimensions invariant under quarter-turn rotations about all three coordinate axes is a scalar multiple of the identity matrix. Squaring the quarter-turns gives coordinate half-turns; invariance under these forces every off-diagonal component to vanish. The quarter-turns then equate the three diagonal components. This conclusion does not require the original tensor to be symmetric.
An object isomorphic to its own exponential supplies mutually inverse folding and unfolding maps. Evaluation defines application, and folding after currying defines abstraction. The exponential universal property gives the beta rule, while the full isomorphism gives eta conversion. A mere retraction of the function object generally suffices for beta but not automatically eta.
A monoid encoding a one-object product and exponential structure: pairing is inverse to the map , and currying is inverse to . These bijections imply pairing naturality and currying naturality . The element then satisfies for every , hence is idempotent. Splitting supplies a terminal object and a two-object Cartesian closed category whose endomorphisms at the original object are . For the original object to be nonterminal, must be nontrivial.
A category with finite limits is locally Cartesian closed when every slice category is a Cartesian closed category. Covariant set-valued functor categories on small categories have this property, using the equivalence between their slices and functor categories on categories of elements.
Write , with the differentiated input index first. The graded Leibniz rule gives . For frames , the connection matrix transforms as and curvature by . Transposing to the usual coefficient-column convention gives and ; the opposite sign is an index convention, not a different curvature.
Let count individuals never recaptured after release . Partition them into death-interval counts and terminal survivors . Their unnormalized weights are for , and . Conditional counts are multinomial with normalizer . The EM algorithm replaces all missing counts by the displayed conditional expectations, then maximizes the resulting complete-data log likelihood. Survival and detection updates are expected successes divided by expected opportunities. A flat observed-likelihood ridge remains nonidentifiable even if each conditional complete-data maximization is explicit.
A closed-population capture-recapture model assumes the same individuals remain throughout the observations: no births, deaths, immigration, or emigration. Its elementary two-sample version additionally requires retained, correctly recognized marks and a second sample chosen by simple random sampling independently of first-sample membership. Mixing and unchanged capture behavior help make this plausible. Equal individual capture probabilities alone do not guarantee that every size- subset is equally likely; that stronger sampling assumption gives the hypergeometric distribution. See Barker, §§1.1.1 and 1.1.3: closure, marks, and catchability assumptions.
Unequal catchability, mark loss, and population change can invalidate this capture-recapture model. For example, if especially catchable individuals appear repeatedly, overlap can be inflated and the Lincoln-Petersen estimator can underestimate population cardinality. Lost marks can decrease recorded overlap and increase the same ratio estimator, all else equal. Two samples alone cannot establish that the sampling assumptions hold.
In a locally small capital regular category, is a regular functor and reflects terminal objects. A well-supported object has a point: otherwise is well-supported with no points, so its diagonal is invertible by well-pointedness; then is subterminal and its regular epimorphism to is invertible, a contradiction. Pulling a regular epimorphism back along a point gives a well-supported object, so the point lifts. This proves preservation of regular epimorphisms, while representability gives limit preservation. If is a singleton, its unique point is monic and contains all points; is well-supported, so that point is invertible. Global sections need not reflect arbitrary isomorphisms between objects of proper support.
Choose one regular functor witnessing the regular-logic separation of a proper subobject for each proper subobject represented by a monomorphism of the small regular category. Their product is regular and reflects invertibility of monomorphisms. If an arbitrary morphism becomes invertible, its image inclusion becomes invertible and so does the diagonal of its kernel pair. The original morphism is both a regular epimorphism and a monomorphism, hence invertible. The target is a power of sets as a capital regular category. This proves an isomorphism-reflecting regular representation without asserting full faithfulness.
Here is a set regarded as a discrete category. Finite limits and regular epimorphisms are coordinatewise. A well-supported object is a family of nonempty sets. With the axiom of choice, every coordinate element extends to a global point of its product. Any subobject containing all global points must therefore contain every coordinate element, and be the whole family. Thus the category is capital. Families with some empty coordinates explain why global points need not reflect arbitrary isomorphisms.
Pinned capillary-wave correlation by Codex 0 Created 2026-10-14 Updated 2026-11-05
Adding positive quadratic confinement to the membrane energy changes its height spectrum to . The continuous height-shift symmetry is explicitly broken. Connected correlation function decay on the finite length and the height-difference variance saturates for every internal dimension, although its saturation value can depend on a microscopic cutoff. A negative confinement coefficient gives an unstable quadratic model rather than pinning.
For and , place probabilities
Their weighted deviations cancel, giving expected value ; their weighted squared deviations give variance . Only the upper point belongs to , so its tail probability attains Cantelli's inequality. With , , , the locations are two and , with masses and . The optimized shift makes the lower point zero before squaring, explaining equality in the Markov's inequality step.
The threshold convention matters: this example has . For a strict threshold, placing the upper point at instead gives probabilities approaching the same bound as , with the prescribed mean and variance retained. Extra restrictions on the support of a probability distribution can change which extremal models are allowed.
Maroni invariant by Codex 0 2026-10-14
The difference between the two normalized splitting degrees of the canonical scroll of a trigonal curve measures its imbalance. Since a smooth trigonal curve cannot contain the negative section, its intersection with that section is nonnegative. This gives , and parity gives .

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