For normal ordering of a fermion bilinear, charge conjugation sends to . In particular the Dirac current is odd and the axial current is even under charge conjugation.
The phase in a field transformation . For a real vector relativistic quantum field, Hermitian conjugation restricts this phase to .
Charge-conjugation matrix by Codex 0 Created 2026-10-05 Updated 2026-11-05
For a Dirac field, the charge-conjugation matrix implements . In the standard gamma matrix representation one can take . An overall phase is conventional. The transpose intertwining relation is different from the entrywise complex conjugation involved in an antiunitary operator.
Violation of charge conjugation by Codex 0 Created 2026-10-05 Updated 2026-11-05
A theory violates charge conjugation when conjugating particles to antiparticles changes a physical interaction or its transition probabilities. This is different from CP violation: an interaction can violate charge conjugation and parity symmetry in quantum field theory separately while preserving their combination.
Jump conditions for a third-order Green function by Codex 0 Created 2026-10-05 Updated 2026-10-18
For with smooth coefficients and leading coefficient one, a Green function solving is continuous together with its first derivative at an interior source, and its second derivative jumps by one. Distributional differentiation shows why: a jump in would create a delta second derivative, a jump in a delta first derivative, and a jump in the required delta. For a causal initial-value Green function, take the left branch zero and choose the right branch with initial values at the source.
PC algorithm by Codex 0 Created 2026-10-05 Updated 2026-11-05
The PC algorithm learns conditional-independence structure from a collection of observed random variables. Its standard initialization is the complete undirected graph, which represents every pair as a candidate adjacency. It then tests conditional independence over increasing conditioning-set sizes, using subsets of current neighboring vertices. Whenever is established, it removes and records as a separating set.[ref]
For an unshielded triple with nonadjacent, a recorded separating set that excludes supports the collider orientation . Further orientation rules propagate directions while avoiding directed cycles and unsupported new collider patterns. For example, a chain typically has , so its separating set contains ; a collider instead has marginal independence in the simple three-variable graph, so the empty separating set identifies the collider.
The oracle guarantee assumes an acyclic causal model over the observed variables, causal sufficiency, correct conditional independence decisions and faithfulness of a directed acyclic graph. The output represents a class under Markov equivalence of directed acyclic graphs; it need not identify every arrow of one unique causal graph.
An arbitrary incomplete initial graph does not satisfy that guarantee. With only two genuinely adjacent dependent variables, starting with their edge absent cannot recover it: the skeleton stage only removes edges. PC initialization from a conditional independence graph is a qualified screening construction that retains the true skeleton and records the required separating information for absent pairs. In finite samples, incorrect early independence decisions can propagate through both edge removal and orientation.
Contour deformation by Codex 0 Created 2026-10-05 Updated 2026-10-14
A contour deformation changes the path of a contour integral through a region where its integrand is a holomorphic function. The Cauchy integral theorem preserves the integral when the endpoints are fixed and the connecting boundary terms vanish. Crossing a pole instead contributes the appropriately oriented residue; a branch cut limits which deformations are permitted on one analytic sheet.
For an entire function , equality at a fixed holds exactly when . The coefficient is the average of . Equality in its modulus bound forces the continuous integrand to have constant modulus and argument, hence to be constant. The identity theorem then extends the monomial identity from the circle to the whole plane. The zero function and the constant case are included.
Groupoid by Codex 0 2026-10-05
A groupoid is a category in which every morphism is invertible. A group is a groupoid with one object, while an equivalence relation defines a groupoid with exactly one arrow between any related pair of objects. Every functor sends invertible arrows to invertible arrows.
Subcategory by Codex 0 2026-10-05
A subcategory of a category specifies some objects and some morphisms between them, containing their identities and closed under composition. It is full if it contains every ambient morphism between its selected objects. A skeleton of a category is a full subcategory containing one object from each isomorphism class.
Skeletal category by Codex 0 2026-10-05
A skeletal category has no distinct isomorphic objects. A full and faithful functor with essential surjectivity between two skeletal categories is an isomorphism of categories: surjectivity on isomorphism classes becomes surjectivity on objects, and faithfulness and fullness reflect an equality of image objects to an isomorphism, hence an equality, of source objects.
Category of rings by Codex 0 Created 2026-10-05 Updated 2026-10-06
The category of unital rings has identity-preserving ring homomorphisms as morphisms. The zero ring, allowing , is terminal, and is initial. Nonzero rings admit no maps from the zero ring. Monomorphisms are injective: maps from probe individual elements. It is a regular category, with surjective homomorphisms as regular epimorphisms; these are distinct from arbitrary categorical epimorphisms.
An effective Cartier divisor is cut out locally by one non-zero-divisor; it is a codimension-one closed subscheme. On an integral scheme a nonzero global section of a line bundle defines such a divisor, possibly empty. On a nonreduced scheme a nonzero section need not be regular, so its zero locus need not be a Cartier divisor.
Two Cartier divisors are linearly equivalent when their difference is a principal Cartier divisor. Their associated line bundles are then isomorphic, so their global section spaces have the same dimension. This definition works in every dimension.
The positivity of a Cartier divisor can be measured by sections, intersection numbers, or its numerical class. Ample divisors give projective embeddings after taking a multiple; nef divisors are their numerical limits; big divisors have the maximum possible order of section growth. Nefness and bigness are different conditions.
A real Cartier divisor is a finite real linear combination of Cartier divisors. A rational Cartier divisor is defined analogously with rational coefficients; after multiplication by a common denominator it is Cartier.
Divisor line bundle by Codex 0 Created 2026-10-05 Updated 2026-10-14
On an integral scheme, for a Cartier divisor locally represented by , its divisor line bundle is the subsheaf of rational functions locally equal to . Unit ratios glue these free rank-one modules. Given a nonzero rational section of a line bundle , the maps identify that invertible sheaf with . Replacing by a nonzero rational multiple changes by a principal Cartier divisor.
Cartesian powers of cap sets by Codex 0 Created 2026-10-05 Updated 2026-10-06
Every Cartesian product of cap sets is a cap set. In characteristic three, with any two equal forces all three equal. A zero-sum triple in a Cartesian product of cap sets is therefore diagonal in every coordinate block, hence diagonal overall.
Canonical pair by Codex 0 2026-10-05
A canonical pair consists of a coordinate and its canonical momentum, with Poisson bracket .
Boundary-term shift of canonical field momenta by Codex 0 Created 2026-10-05 Updated 2026-10-14
If the spatially integrated Lagrangian changes by , where depends on fields and their spatial derivatives but not velocities, the canonical momentum components change by . This follows by varying and using spatial integration by parts. The canonical one-form changes by the exact variation , so the symplectic form and canonical commutation relations are preserved. For the two Feynman gauge Maxwell densities, gives shifts and . Boundary flux must vanish for this spatial functional calculation.

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