A process has conditionally symmetric increments if, for all deterministic and bounded measurable ,
Equivalently, the conditional characteristic function of every increment is invariant under changing the sign of its argument. This property is stronger than unconditional symmetry and is different from independent increments. It supplies identities between positive and negative exponential terminal martingales.
Suppose are continuous, start at zero, and is increasing. If and are local martingales, their logarithms first recover adaptation of and the semimartingale property of . In the decomposition , the two Itô drift measures give and . Thus and . All real exponential parameters may be assumed, but these two suffice.
For a contact form on a -manifold, is nondegenerate: the contact condition says its top exterior power is nowhere zero on the hyperplanes. This fiberwise symplectic form identifies contact-plane vectors with covectors on that plane and determines the horizontal generator of contact stability.
For CRRA utility of a consumption satisfaction stock, jointly scaling initial portfolio wealth, consumption satisfaction and controls gives homogeneity of degree . The value function therefore depends on one dimensionless ratio after factoring out . The effective consumption coefficient becomes .
If consumption contributes to the Hamilton-Jacobi-Bellman equation and has no finite upper bound, finite value requires . Strict inequality makes zero consumption optimal locally. Equality describes an active transfer boundary, often reached through singular consumption control.
In singular stochastic control, an unrestricted consumption rate can approximate instantaneous transfers from portfolio wealth into a consumption satisfaction stock. In the relaxed problem a nondecreasing control records these transfers. A transfer decreases portfolio wealth and increases consumption satisfaction by the same amount. Rate controls need not attain the supremum when the relaxed optimum has a jump.
For simple loops surrounding a marked point, containment in two simply connected domains is containment in their intersection component containing that point. Finite deficits therefore determine all finite intersections of avoidance events by inclusion-exclusion. Restrict to finite windows and use the sigma-finite uniqueness theorem for measures; as these windows exhaust the pointed loop space. Finiteness of the windows is essential to this argument.
A previous outcome may affect a subsequent outcome after controlling both measured covariates and persistent unobserved heterogeneity. This is true state dependence. An observed lagged-outcome association alone does not establish it, because omitted individual propensities can create apparent persistence.
The accumulated number of previous successes may enter the conditional mean in a history-dependent logistic regression. Its coefficient exponentiates to the conditional success odds ratio per previous success. For a specified future path, update this cumulative predictor after each outcome before multiplying the conditional probabilities.
Countably many completely Ramsey-null sets can be avoided simultaneously in a stem-preserving Ellentuck topology refinement. Select an increasing sequence with nested infinite remaining tails. At stage , thin the tail to avoid the th set for every stem , where ranges over all subsets of the first selected points. There are only finitely many such stems. Any infinite subset of the final selected sequence uses some such before stage and has all remaining points in the thinned tail. Thus it avoids every forbidden set. This explains why an argument checking only the full selected prefix is insufficient.
In barycentric coordinates with unit primary separation, a small secondary mass fraction gives distances from that secondary to the two neighboring Lagrange points at leading order. This is the dimensionless Hill radius. The opposite exterior L3 Lagrange point has coordinate .
Cup square after a diagonal sphere attachment by Codex 0 Created 2026-10-07 Updated 2026-10-14
For even , attach an -cell to along the diagonal. The cellular chain complex has boundary for the new cell. The degree- cohomology generator restricts to , and the top generator restricts to . Naturality of the cup product therefore gives , since . Thus the resulting cohomology ring is , with and . This distinguishes the attachment from a wedge of spheres, whose positive-degree products vanish.
Coleman power series by Codex 0 Created 2026-10-07 Updated 2026-11-05
A Coleman power series encodes a norm-compatible sequence of local units in a cyclotomic tower by a single integral power series evaluated at . A logarithmic derivative and trace correction give a measure, relating the local images of cyclotomic units to p-adic L-functions.
Chebyshev estimate from central binomial coefficients by Codex 0 Created 2026-10-07 Updated 2026-11-05
The central binomial coefficient satisfies . Prime factors between and give a dyadic upper bound for the Chebyshev theta function. The prime-power exponents in the factorial quotient are sums of zeros and ones, so the central coefficient gives a linear lower bound for the second Chebyshev function. Higher prime powers contribute only ; hence the prime-counting function has upper and lower bounds of order .
Iwasawa invariants by Codex 0 Created 2026-10-07 Updated 2026-11-05
The invariants of a finitely generated torsion Iwasawa module measure its -power elementary factors and distinguished-polynomial factors. Vanishing of means that the module is finitely generated over , up to finite error. It does not mean that the module is finite: a factor has and is .
Character of a finite abelian group by Codex 0 Created 2026-10-07 Updated 2026-11-05
A character of a finite abelian group is a homomorphism into the complex unit circle. Equivalently it is a linear character; finite order forces each character value to be a root of unity. These are the elements of the character group of a finite abelian group and form the orthogonal Fourier basis of functions on the group.
Extension of a character across a cyclic quotient by Codex 0 Created 2026-10-07 Updated 2026-11-05
If is a subgroup of a finite abelian group, , and is the least positive integer with , then each character of a finite abelian group on has exactly extensions to . The displayed root choice makes the extension well-defined. Starting with the trivial subgroup and adjoining generators proves that the number of characters equals the group order without using a decomposition into cyclic groups.
A contracting homotopy on a chain complex is a degree-one map whose displayed identity makes the identity chain-homotopic to zero. It implies that all homology vanishes. The converse is not valid for arbitrary complexes of modules.

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