Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For , and , this probability density function has cumulative distribution function . Differentiating gives the density, while the endpoint limits are zero and one. Its quantile function is for , enabling inverse transform sampling.
Expanding the denominator as a geometric series givesTermwise integration, justified by the monotone convergence theorem, and the gamma function integral yield raw moments . Thus the polylogarithm expresses its mean, variance and higher moments. Here is the complement of the series parameter ; parameter conventions must be checked when comparing formulas.
For continuous maps and , a continuous lift of through is a continuous map with . Existence and uniqueness require additional hypotheses; the lifting criterion for a covering space states a useful existence criterion when is a covering map and is path-connected and locally path-connected.
A continuous bijection is a continuous map that is a bijection. It need not be a homeomorphism, since its inverse function need not be continuous. The compact-to-Hausdorff continuous bijection theorem supplies a useful sufficient condition for the stronger conclusion.
A continuous map that is also an injective function. A continuous injection need not be a topological embedding: its inverse on its image need not be continuous. If its source is a compact space and its target is a Hausdorff space, however, the compact-to-Hausdorff continuous bijection theorem makes that inverse continuous.
Convergence on a dense subspace under a uniform operator bound by
Codex 0 Created 2026-10-25 Updated 2026-10-31
Let , , be bounded linear operators from a normed space into a Banach space, with . If converges as for each element of a dense subspace , then converges for every . The limit defines a bounded linear operator with .
For , the triangle inequality givesApproximate by and use the Cauchy criterion for a function limit on . The completeness of supplies the limit; passing to the limit preserves linearity and the bound. When every limit on is zero, the inequality shows .
A financial option grants a right, without a corresponding obligation to exercise, to transact at specified terms. A call option is a right to buy and a put option is a right to sell. The contract specifies its permitted exercise times and strike price; the value of that right differs from the exercise payoff at any particular time.
For an contingency table with observations and positive row and column totals, Cramér's V rescales the Pearson chi-squared statistic to a dimensionless measure of statistical association. It lies between zero and one and is unchanged by reordering category labels. It therefore describes the magnitude of dependence, without an ordinal direction. A small p-value can accompany a small in a large sample: evidence against independence and the magnitude of the departure answer different questions. The displayed quantity is the usual uncorrected sample measure.
Predict categorical response by a most frequent category. Without knowing , the number of mistakes in a contingency table is . Allowing a separate most frequent response for each predictor row gives . Goodman and Kruskal's lambda is the fractional reduction in those mistakes when . Its direction matters, and it can vanish despite statistical association: if every row has the same most frequent response category, knowledge of changes no modal predictions even when the row distributions differ.
For a contingency table with Pearson chi-squared statistic and sample size , the nonnegative magnitude is sometimes reported as generalized phi. It does not encode an ordinal direction. In a two-row or two-column table it coincides with Cramér's V; in larger tables it can exceed one, so the normalization in Cramér's V matters. In a two-by-two table it is the absolute value of the Pearson correlation coefficient of binary category indicators; a signed binary phi requires a stated coding convention.
The contingency coefficient transforms the Pearson chi-squared statistic as . It is an unsigned measure of statistical association, not a p-value or a direction of an ordinal relationship. Writing gives . Unlike Cramér's V, its attainable maximum depends on table dimensions, so comparisons between differently sized tables need care.
The set of values permitted for a variable in a constraint satisfaction problem. All assignments before relational constraints form the Cartesian product , whose cardinality is for finite domains. Unary restrictions can be incorporated directly into the constraint domain by deleting forbidden values.
A restriction involving two variables in a constraint satisfaction problem, represented by the allowed value pairs . Multiple restrictions on the same pair can be combined by intersection. For bundle allocation, disjointness and the two directional envy-free allocation inequalities together define one compatibility relation.
For a binary constraint satisfaction problem, the undirected graph with one vertex per variable and an edge for each variable pair sharing a binary constraint. Unary conditions restrict constraint domains but add no edges. A more general constraint can be represented in a primal constraint graph by joining every pair of variables in its scope; such edges do not make a genuinely many-variable constraint binary.
After restricting constraint domains, a binary constraint can become automatically satisfied for every remaining pair of values. Removing such constraints can reveal a tree and enable tree-structured constraint satisfaction.
A directed requirement for a binary constraint : every remaining has at least one support with . Revising the arc deletes unsupported values from ; it does not directly delete values from . Full arc consistency requires the condition in both directions on every edge of the constraint graph. On general graphs, it need not imply that a complete solution exists.
A binary constraint satisfaction problem whose constraint graph is a tree. Restrict constraint domains by unary conditions first. Choose a rooted tree orientation and process children before parents. For each child of , retain in only values having a compatible value in the already reduced . Thus every retained parent value has support in each child subtree.
If the root constraint domain becomes empty, no solution exists. Otherwise choose any root value, then recursively choose supported child values. A child-to-parent arc consistency pass need not enforce full arc consistency in both directions; the chosen directional condition suffices for this construction.
The proof uses mathematical induction on subtrees. A retained leaf value satisfies its unary requirements. Each retained parent value has a supported value in every child subtree. Those subtree solutions can be combined because the tree has no edges between different child subtrees. Therefore every retained parent value extends to a whole subtree solution, and every retained root value extends to a complete solution without backtracking.
For variables and maximum constraint domain size , scanning all value pairs once per edge costs time complexity in Big O notation, when one binary constraint evaluation has unit cost. If a constraint requires summing bundle values, its evaluation cost must also be counted.
Place queens on an chessboard so that none share a row, column or diagonal. One constraint satisfaction problem encoding uses a column variable for each row, with and whenever . The pigeonhole principle explains why one queen per row loses no solutions. Prescribed occupied cells give the queens completion problem.
A restriction on the value of one variable. In a finite-domain constraint satisfaction problem, it can be applied by deleting disallowed values from that variable's constraint domain before search. It introduces no edge in the binary constraint graph.
Choose an unassigned variable constrained to the greatest number of other unassigned variables. This is commonly a tie-breaker after minimum remaining values. The relevant vertex degree is computed in the remaining constraint graph, rather than counting neighbors already assigned. It aims to make each decision constrain many future decisions without changing the solution set.
Enumerate assignments to a cycle cutset, reject internal violations, filter all crossing binary constraints, and solve the residual forest by tree-structured constraint satisfaction. A full solution restricts to one enumerated cutset assignment; the residual tree passes preserve all its values. Conversely, a consistent cutset assignment combined with supported residual solutions satisfies every constraint. These observations prove completeness and soundness.
With variables, maximum constraint domain size and cutset size , there are at most assignments and residual tree work per assignment. Internal cutset and crossing-constraint tests require additional accounting. The method is attractive when a small cycle cutset is available.[ref]
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





