Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a real random variable on a probability space, is the smallest sigma-algebra making a measurable function into the Borel sigma-algebra on . The collection of all inverse images of Borel sets is already a sigma-algebra, since inverse images preserve complements and countable unions; this proves the displayed formula without completing any measure.
A sigma-algebra on the same underlying set as , with . In probability theory it represents information retained from the original probability space and is a possible conditioning collection for a conditional expectation.
The union of an empty family of sets is the empty set: membership would require a member of that family containing the proposed set element, and there are no members.
A set function is normalised when its value at the empty set is zero. Subtracting the constant normalises any real-valued set function and preserves submodularity and the monotone set function property.
A real-valued set function is monotone in the nondecreasing convention whenFor a finite ground set , this is equivalent to every marginal increment being nonnegative. Necessity follows by comparing and . Conversely, enumerate the finitely many elements of and add them one at a time; summing their nonnegative increments gives . A normalised set function with this property is a nonnegative function.
The finiteness condition in that converse matters. On , define for finite and for infinite . Adding one element never changes whether is finite, so all marginal increments are zero. Yet , so the set function is not monotone. Single-element tests alone cannot compare sets differing in infinitely many elements.
A set function on the power set of a ground set is symmetric when complementary subsets have equal values. A hypergraph cut function has this property because swapping the two sides changes no crossing hyperedge. If a symmetric set function is also a monotone set function, it is constant: .
On a finite ground set, a modular set function is a set function satisfying the displayed equality for every pair of subsets. Equivalently,To prove this representation, apply the equality to disjoint and : . Add these fixed marginal increments along any ordering of . Conversely, the contributions of each element and of the constant cancel in the displayed identity. Thus a modular set function need not be a normalised set function; its normalised instances are precisely the real-valued set functions with finite additivity on a finite power set. Adding or subtracting a modular set function preserves submodularity.
The marginal increment measures how much a set function changes when one new element is added. Usually is required; if , the displayed difference is zero. The marginal increments of a modular set function depend only on . The marginal increments of a submodular set function can only decrease as the input subset grows without acquiring .
Let be a nonempty finite set with real weights . For nonempty subsets put and choose . This defines a monotone set function and a submodular set function on the full power set.
To check diminishing returns, for the marginal increment is . If , then , so . Choosing the value of the empty set no larger than every weight makes this calculation valid even for .
The case of the Sérsic surface-brightness profile, approximately useful for many bright elliptical galaxies: . Real galaxies can have other Sérsic indices.
A series whose terms are multiples of sines and cosines of integer multiples of a variable. A Fourier series is the special case with coefficients extracted from a specified function by integration.
Assign distinct rooms along a hallway to participants. A participant's utility is their own room value plus a positive bonus if their designated friend receives a physically adjacent room; participants without friends receive only their room value. When friendships form disjoint pairs, consecutive choosing slots allow each pair to settle its own adjacency before later participants act. Consecutive slots in serial dictatorship do not themselves require adjacent allocated rooms.
A positive sequence is superincreasing if each term exceeds the sum of all earlier terms. If , a geometric series proves . Distinct finite subsets of its indices have distinct sums: cancel their common terms and compare the largest remaining term with the sum of all smaller terms. This gives uniqueness of minimum spanning trees and of simple graph paths with fixed endpoints when a finite weighted graph has such separated edge weights.
A sequence formed by an ascending part followed by a descending part, or the reverse arrangement, with either part possibly empty. In sorting algorithms, the monotonicity convention normally allows equal keys. Joining one ascending sequence to the reversal of another ascending sequence produces a bitonic sequence.
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





