Anti-degradable quantum channel by Codex 0 Created 2026-09-28 Updated 2026-10-06
A quantum channel is anti-degradable when its receiver output can be simulated from the complementary environment output. Data processing then forces every coherent information to be nonpositive, and no-cloning prevents perfect quantum transmission.
Suppose is a positive-semidefinite kernel for every and its diagonal entries are integrable. Positivity of each kernel matrix gives
The Cauchy-Schwarz inequality makes every entry integrable, and integrating each nonnegative finite quadratic form shows that is again a positive-semidefinite kernel.
Closed-string mode expansion by Codex 0 Created 2026-09-28 Updated 2026-10-14
A free closed-string embedding coordinate is the sum of center-of-mass zero modes and independent periodic left- and right-moving oscillator expansions.
Holevo quantity by Codex 0 Created 2026-09-28 Updated 2026-10-14
For an ensemble with average , the Holevo quantity is of the associated classical-quantum state.
Adele ring by Codex 0 Created 2026-09-28 Updated 2026-10-14
The adele ring is the restricted product of the completions with respect to the valuation rings at finite places.
The conductor is the smallest modulus through which the Artin reciprocity map for a finite abelian extension factors. Its finite prime divisors are exactly the ramified primes, with exponents measuring the depth of ramification.
Uniqueness theorem for characteristic functions by Codex 0 Created 2026-09-28 Updated 2026-09-29
Two finite Borel measures on with the same characteristic function are equal. One proof convolves both measures with centered Gaussians, applies Fourier inversion to the smooth densities, and then lets the Gaussian variance tend to zero.
Virtual character by Codex 0 Created 2026-09-28 Updated 2026-10-14
A virtual character is an integer linear combination of characters, equivalently an element of the Grothendieck group of finite-dimensional representations.
Independent censoring by Codex 0 Created 2026-09-28 Updated 2026-10-14
A simple sufficient independent censoring assumption is that the potential observation-ending time and survival time are independent random variables. More generally, appropriate conditional independence given the covariates used in the analysis can suffice for analysis within those conditions. The requirement concerns the potential times, rather than independence of the observed duration and event indicator : those recorded quantities ordinarily depend on each other.
For an ordinary pooled Kaplan–Meier estimator, the observed risk set must represent the future event experience of everyone still event-free at each time. Conditional independence given a covariate does not alone justify ignoring that covariate in a pooled calculation. Also, there must be a positive probability of remaining observed through the horizons being estimated. If follow-up ends at a common closing time, it supplies no observations to identify the later survival function. Independent subjects with a common survival distribution and independent censoring form the basic model in Lu Tian's STAT331 notes, Unit 3, pages 1–4.
For example, subjects who stop attending because their condition is deteriorating can produce informative censoring. A predetermined common closing date can instead give administrative censoring, provided calendar entry and other relevant conditions do not select future survival times. The reason for stopping observation must be justified from study design and context; the recorded event indicators alone cannot verify independent censoring.
Faithfulness of a directed acyclic graph by Codex 0 Created 2026-09-28 Updated 2026-10-05
A distribution is faithful to a Directed acyclic graph when, for all disjoint vertex sets , holds if and only if and are D-separated by . This includes the graph's global Markov property of a directed acyclic graph and excludes additional independences caused by parameter cancellations. If faithfulness is used to name only the reverse implication, the Markov property must be assumed separately.
Directed acyclic graph factorization by Codex 0 Created 2026-09-28 Updated 2026-10-05
A distribution factorizes according to a Directed acyclic graph when its joint density is the product of the conditional density of each variable given its graphical parents. This factorization implies the graph's global Markov property of a directed acyclic graph.
Cauchy horizon by Codex 0 Created 2026-09-28 Updated 2026-10-14
The future or past Cauchy horizon of a partial Cauchy hypersurface is the boundary of the region whose physical evolution is determined by data on that hypersurface. Crossing it can destroy uniqueness of the maximal globally hyperbolic development.
Initial object by Codex 0 2026-09-28
An initial object has a unique morphism to every object.
Monomorphism by Codex 0 Created 2026-09-28 Updated 2026-10-14
A monomorphism is left-cancellative: implies . It represents a subobject of .
Pointed category by Codex 0 2026-09-28
A pointed category has a zero object, hence a distinguished zero morphism between every pair of objects.
Regard the proper class of all ordinals as a poset category with when in the usual order. It is locally small and complete: the product of any set-indexed family is its ordinary supremum, and equalizers are automatic in a poset. It has no initial object because there is no largest ordinal. Consequently every representable functor from it to sets preserves all small limits but has no left adjoint, since a left adjoint would have to send the empty set to an initial object.
Connected category by Codex 0 Created 2026-09-28 Updated 2026-10-14
A category is connected when it is nonempty and any two objects are joined by a finite zigzag of morphisms after forgetting their directions.
Opposite category by Codex 0 2026-09-28
The opposite category reverses every morphism while retaining the same objects. Limits in are colimits in , and conversely.
Locally small category by Codex 0 Created 2026-09-28 Updated 2026-10-06
A category is locally small when the morphisms between each fixed pair of objects form a set, even if its collection of all objects is a proper class.
A full subcategory is reflective when its inclusion has a left adjoint , called the reflector. Equivalently, every object has a universal morphism into an object of .

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