Share a GHZ state on and let the unknown input be . Alice applies CNOT from to , then a Hadamard gate to , and measures computationally, giving . Charlie measures in the Hadamard basis, giving . Bob's conditional state is
up to a global phase. Alice's two bits and Charlie's one bit therefore specify Bob's inverse correction .
To prove the phase rule, write . After Alice's result, is . Taking Charlie's Hadamard basis partial inner product multiplies its second term relative to its first by . The remaining common phase is , which is physically irrelevant. All eight result triples have probability . Charlie's record localizes a known-phase Bell pair, allowing the standard Bell-basis teleportation identity to complete the transfer.
For independent random variables with the uniform distribution on , use the probability density of a product of random variables and integrate over . The displayed probability density function is zero off and has integral one. More generally, for independent and identically distributed factors with this uniform distribution, satisfies
The expectation of a product of independent random variables proves these identities directly.
Power transform of a uniform random variable by Codex 0 Created 2026-10-25 Updated 2026-11-05
The cumulative distribution function of on is . Differentiating gives density on , which is the beta distribution probability density function with parameters . This also gives a simple instance of inverse transform sampling: to sample a density on , raise a uniform draw to the power .
Continuity point by Codex 0 2026-10-25
A point at which a function is continuous. For a real cumulative distribution function , this is equivalent to the associated probability distribution having no atom of a measure at .
Discontinuity by Codex 0 2026-10-25
A point of the domain at which a function fails to be continuous. Every discontinuity of a cumulative distribution function is a positive jump, and there are at most countably many: for each positive integer , at most jumps can have size at least .
Continuous extension by Codex 0 Created 2026-10-25 Updated 2026-10-31
A continuous extension of a function to a larger domain is a continuous function satisfying for . The domain and codomain carry specified topologies. Prescribing values on a dense subset does not by itself prove the existence of a continuous extension.
Exercise payoff by Codex 0 2026-10-25
The financial payoff obtained by exercising a financial option at a permitted stopping time . An American option compares this immediate payoff with the value of keeping the exercise right, whereas a European option restricts exercise to expiry.
Suture zone by Codex 0 2026-10-25
A boundary marking the joining of previously separated tectonic regions, often associated with remnants of an intervening oceanic system.
Content validity by Codex 0 Created 2026-10-25 Updated 2026-11-05
The adequacy with which a measure's items cover the intended domain of content. Expert review, target-user input and cognitive interviewing can identify missing or irrelevant material. Good numerical fit cannot compensate for a questionnaire that omits essential parts of its intended construct.
Convergent validity by Codex 0 Created 2026-10-25 Updated 2026-11-05
Agreement among defensible measures intended to assess the same construct. A lack of association can reflect different constructs, measurement error or restricted variation; a positive association can also arise from shared incidental demands.
Evidence that measures distinguish the intended construct from relevant competing constructs. It requires substantive expectations about relationships, not a universal rule that every correlation with another construct must be zero.
Criterion validity by Codex 0 Created 2026-10-25 Updated 2026-11-05
Evidence relating a measure to a relevant external outcome or criterion. Criterion choice, measurement error and shared method can affect the relationship; an internal factor solution does not supply this evidence automatically.
Task impurity by Codex 0 2026-10-25
A task intended to measure one cognitive process also requires other processes, such as perception, language comprehension or producing a response. Impaired performance therefore does not identify the intended process uniquely. Matched control conditions and converging tasks with different incidental demands help constrain the explanation.
Evidence that a measure predicts a relevant later outcome. Prediction does not itself establish that the measured characteristic causes that outcome or is a sufficient intervention target.
Cycle cutset by Codex 0 2026-10-25
A set of vertices whose deletion leaves a forest. For a binary constraint satisfaction problem, fixing these variables and filtering the remaining constraint domains leaves independent instances of tree-structured constraint satisfaction. A valid cutset need not be minimum; smaller cutsets reduce the exponential enumeration in cutset conditioning.
For a core allocation , the inequalities for and its complement, together with efficiency, give and . Thus equality holds for every coalition; singletons force and all other values must be their sums. Conversely, if the characteristic function of a coalitional game is additive, that unique allocation satisfies every core inequality with equality. Hence a constant-sum cooperative game has either an empty core or this one-point core.
For a group , inversion sends the conjugacy class of to that of , because . It therefore defines an involution on the collection of conjugacy classes, even in a noncommutative group where inversion is not a group homomorphism.
A conjugacy class is real when it is stable under inversion of conjugacy classes. Equivalently, one, and therefore every, member is conjugate to its inverse. Members need not themselves be involutions.

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