Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a bounded real function, inserting partition points increases its lower Darboux sum and decreases its upper Darboux sum. This follows interval by interval because infima increase on smaller sets while suprema decrease, and the new widths sum to the original width. A common partition refinement consequently proves for arbitrary two partitions.
Cyclotomic units include roots of unity and suitable ratios in cyclotomic fields. Compatible roots make these ratios norm-compatible along cyclotomic towers. Their closed norm-limit module is a concrete submodule of global units, and its local images generate the power series in the Iwasawa main conjecture.
The cut capacity of , with the complement of a set, isOnly outward directed edges contribute; incoming and internal edges contribute nothing.[ref]
FordFulkerson.java. Algorithms, 4th edition by Robert Sedgewick and others; Sedgewick and Wayne, FordFulkerson.java, check method, lines 196–203: sum capacities only from the source side to its complement
Here is the accounting behind the bound, using nonnegative original edge amounts in a finite flow network. Sum the divergence of a flow over the vertices in :An edge with both endpoints in appears once with a plus sign at its tail and once with a minus sign at its head, so those contributions cancel. An outward edge appears only with a plus sign; an incoming edge appears only with a minus sign. Since , and every other vertex satisfies flow conservation, the left side is the flow value. ThusThe inequality uses two facts separately: each forward flow is at most its flow network edge capacity, and each backward flow is nonnegative. This is the weak duality bound underlying the max-flow min-cut theorem. It is an accounting proof, requiring no choice of augmenting paths.
For in the running example, explicitly add the two divergences of a flow:The internal edge cancels. The edge is a genuine original directed edge entering , so its flow is subtracted; this is different from a backward edge in a residual network. Its flow network edge capacity is neither added to nor subtracted from cut capacity, which remains .
Equality in the bound holds precisely when every outward edge is saturated and every incoming edge carries zero flow, becauseand every term is nonnegative. For the two outward edges are saturated and there are no incoming edges, so the gap is zero. For all outward edges are still saturated, but the incoming flow of gives a gap of . This explains exactly why the second cut of a flow network is not a minimum cut.
A minimum cut is a cut of a flow network of least cut capacity for the prescribed source and sink . The max-flow min-cut theorem equates that least cut capacity with the greatest flow value.[ref]
Flows (author-hosted chapter preview). Graph Theory by Reinhard Diestel; Diestel, Flows, §6.2, Theorem 6.2.2, printed p. 159
To certify a particular minimum cut, exhibit a feasible flow whose flow value equals its cut capacity. Every feasible flow is bounded above by every cut capacity, so this single equality proves both optimalities.[ref]
FordFulkerson.java. Algorithms, 4th edition by Robert Sedgewick and others; Sedgewick and Wayne, FordFulkerson.java, check method, lines 180–209: feasibility, source/sink membership and equality of values
In the running example, the four possible source sides , , and have cut capacities , respectively. The feasible flow of flow value therefore certifies three different minimum cuts. A minimum cut need not be unique; the optimum cut capacity is the same for all of them. Merely saturating many edges does not give this certificate: flow conservation and the particular cut of a flow network must also be checked.
Singular distribution functions have zero derivative almost everywhere by
Codex 0 Created 2026-10-07 Updated 2026-11-05
For , every difference quotient at is nonnegative and bounded by . The spherical derivative of a singular measure vanishes, so the two-sided derivative is zero Lebesgue almost everywhere. A singular distribution function need not be constant: differentiation almost everywhere does not recover increments without absolute continuity of a function of the function.
For the nearest-neighbour graph on , a box has graph vertices and outer graph vertex boundary of size . Thus . This boundary-to-volume property is the geometric mechanism that contradicts a positive volume density of trifurcation points in the uniqueness proof. It realizes the boundary-growth property of the translation amenable group on the lattice.
In one critical chiral RNS string sector, light-cone gauge in string theory leaves eight transverse directions. The Neveu–Schwarz sector massless states give eight spacetime bosonic polarizations. The Ramond zero-mode Clifford algebra gives sixteen ground-state polarizations, split into two eight-dimensional spinor chiralities. The supersymmetric GSO projection keeps one chirality, giving eight spacetime fermionic polarizations. Without that projection the massless counts do not agree. Counting a chiral sector is distinct from tensoring left and right sectors into closed-string states.
For convergence in distribution of random elements in a separable complete metric space, one can construct copies of the sequence and its limit on one probability space which converge almost surely. The copies preserve the individual laws; they need not preserve the original dependence between sequence elements. Suitable more general versions permit a separably supported limit in a metric space.
The Pareto distribution describes a positive random variable whose tail probability falls as a power law. In the shape–minimum convention used here, has shape parameter and minimum , with probability support . Its probability density function isThe minimum has the same units as ; the shape parameter is dimensionless. At fixed , changing gives a scale family, since . This convention is also used in uniform-Pareto conjugacy.[ref]
Pareto Probability Density Function. NIST Dataplot Reference Manual; Description: standard Pareto density and lower bound; source gamma,a correspond to alpha,beta here
The survival function and cumulative distribution function areFor , solving gives the quantile functionIts right-hand limit at is ; it tends to infinity as .[ref]
The Pareto Distribution. Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist; The General Pareto Distribution, Distribution Functions: density, CDF and quantiles; source a,b correspond to alpha,beta here
There is no probability mass at : changing a probability density function's value at that single point changes no probabilities.Choose and as an original theoretical example. Then , , the median is , and the 0.99 quantile is . These chosen values and all figures below describe mathematical probability distributions, not actual wealth observations.
On this log-log plot, write to obtain . The slope is , whereas the probability density function has power exponent . Multiplying a threshold by ten divides its tail probability by . A larger therefore concentrates the Pareto distribution nearer ; a smaller makes extreme values more plausible. This exact scaling is useful when modelling large positive losses or sizes over several orders of magnitude.
The Pareto distribution is a heavy-tailed distribution: for every , the exponential moment diverges because eventually grows without bound. In contrast, the Laplace distribution has exponentially decreasing tails and some finite positive exponential moments. The Student's t-distribution also has power tails, but on both sides of the real line, with a smooth central region rather than a positive minimum.
For , this density makes uniform between and . It is a proper finite-interval version of the scale-invariant prior. The chosen logarithm base changes only the endpoint coordinates.
For a matrix with nonnegative entries, row sums at most and column sums at most imply an operator norm at most . Indeed the Cauchy-Schwarz inequality gives . Summing over bounds the result by . Integral kernels and positive weight functions give analogous forms. The symmetric case has equal row and column bounds.
A bounded linear operator preserves positivity when it takes nonnegative functions to nonnegative functions. By linearity it also preserves the pointwise order: implies . For example, integration against a nonnegative kernel preserves positivity, as does the identity operator. This is order positivity, which differs from a positive quadratic form on a Hilbert space.
The value is the least such that all cohomology in degrees greater than vanishes for every discrete -primary torsion module. Vanishing in degree for all such modules suffices by dimension shifting. Dimension does not increase on closed subgroups. For a field, use its absolute Galois group.
For a closed subgroup of a profinite group and a discrete -module , restriction gives . Thus a class restricting to zero on already restricts to zero on one such open subgroup. The property follows by extending continuous finite-image cochains and their identities to a sufficiently small open neighborhood of .
A standardized maturity-and-quantity agreement whose quote changes generate margin payments as gains and losses are marked to market. A newly settled contract has zero value, while its quoted delivery price is generally nonzero. In the continuous-settlement idealization, futures pricing uses a pricing-measure martingale quote.
An agreement to exchange an underlying at a fixed delivery price on a specified maturity, without the futures convention of repeated settlement. Its fair delivery quote is . It may differ from a futures contract quote when rates are stochastic.
A barrier contract paying a specified fixed amount if the underlying touches a specified barrier before expiry. Payment at touch and payment at expiry are different conventions. For payment at touch, valuation uses the truncated discounted Brownian first passage after converting a geometric stock barrier to a log-price level; discounting solely at expiry would price a different contract.
Two sequences of probability laws are mutually contiguous when contiguity of probability measures holds in both directions. A positive mean-one limit of their likelihood ratio is a standard sufficient criterion.
Let be the probability density function of the absolutely continuous part of relative to . If converges in distribution under to almost surely with , then are mutually contiguous. Indeed, and convergence to a mean-one limit imply uniform integrability and vanishing singular mass, giving forward contiguity. For reverse contiguity, , and one first takes and then .
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






