Linear disjointness by Codex 0 Created 2026-10-14 Updated 2026-11-05
More generally, two field extensions inside a common overfield are linearly disjoint field extensions when the multiplication map from their tensor product of fields into that overfield is injective. The following basis criterion is the finite-degree case.
Finite extensions and are linearly disjoint when products of basis elements form a basis of their compositum. In particular,
Extensions of coprime finite degrees are linearly disjoint.
Field automorphism group by Codex 0 Created 2026-10-14 Updated 2026-11-05
The field automorphism group fixing consists of all field automorphisms of fixing pointwise, with composition. It is defined without assuming that is Galois. For with algebraic degree , the action on the roots of the minimal polynomial inside is faithful, so this group embeds in and is finite.
For all finite-dimensional density operators, including pure states and mixed states, the unsquared quantum fidelity and trace distance obey
In the squared quantum fidelity convention this is . The bounds translate a high quantum fidelity into a small operationally meaningful trace distance. If with , then ; if , then . The upper bound is attained by the pure-state trace distance and fidelity identity. For the fidelity of commuting mixed states example, the bounds read . [ref]
A POVM gives outcome probability distributions and by the Born rule. Their classical overlap, the Bhattacharyya coefficient, is . Fuchs and Caves showed that minimizing this overlap over all POVMs gives the unsquared quantum fidelity:
The same POVM is applied to either possible input quantum state. Each measurement in quantum mechanics has ; some measurement attains equality, including when the density operators have zero eigenvalues. Thus quantum fidelity quantifies the smallest classical overlap that observation can reveal. For fidelity of commuting mixed states, measurement in a common eigenbasis attains the minimum. This operational interpretation compares statistics without assigning a probability that two mixed states are equal. [ref] [ref]
When two density operators are commuting elements, choose a common orthonormal eigenbasis and write , . Their quantum fidelity becomes the classical overlap of the two probability distributions, while their trace distance becomes total variation distance:
This follows by computing the positive square root of an operator entry by entry in the common eigenbasis. For the qubit mixed states and ,
The two contributions to quantum fidelity are about and . In contrast, the chance that two independent computational basis measurements, one on each preparation, print the same label is . That particular event has a specified probability; neither nor is that probability.
Figure 1.
Commuting mixed-state probabilities, square-root overlap contributions to unsquared fidelity F, squared fidelity Fsq, and trace distance D
. Details.
Here trace distance means an equal-prior quantum state discrimination success of by the Holevo–Helstrom theorem. Measuring in the common computational basis and guessing on outcome zero and on outcome one achieves . Also : the pure-state trace distance and fidelity identity is an equality for pure states, rather than a formula for arbitrary mixed states.
For any unitary , the unique positive square root of an operator obeys . Conjugating the positive operators appearing in trace distance and quantum fidelity therefore conjugates their square roots. Cyclicity of the trace removes the unitary factors, proving invariance of both quantities under simultaneous unitary transformations of the states.
For normalized pure states and , the trace distance and quantum fidelity satisfy
The last two expressions distinguish the unsquared quantum fidelity from the squared quantum fidelity. Identical pure states give , and orthogonal pure states give . The equality need not hold for mixed states; the Fuchs-van de Graaf inequalities give bounds in that case.
Brief proof: for two distinct pure states, their two-dimensional span contains the nonzero part of . This restriction has trace zero and determinant , hence eigenvalues . Its trace norm is twice the positive eigenvalue, giving trace distance . For identical pure states, directly.
This is the square of the unsquared quantum fidelity, another common convention for fidelity of quantum states. If one state is the normalized pure state , then
By the Born rule, the squared quantum fidelity here is the probability that a measurement in quantum mechanics with acceptance orthogonal projector accepts . For two pure states it is : the comparison of with has acceptance probability and unsquared quantum fidelity .
For two general mixed states, neither quantum fidelity nor squared quantum fidelity is a probability that the states are equal. Equality of two specified density operators is a definite mathematical condition. The measurement characterization of quantum fidelity instead describes overlap between outcome probability distributions. The ensemble average used in reliable quantum source compression is normally the average squared quantum fidelity with the emitted pure state; the convention must be stated when comparing formulas.
Nielsen–Thurston classification by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a connected oriented topological surface of finite type with negative Euler characteristic, every orientation-preserving mapping class has a periodic representative, preserves an essential multicurve, or has a pseudo-Anosov map representative. In the usual disjoint classification, the reducible case means a nonperiodic class preserving such a multicurve. The assertion concerns representatives up to isotopy, rather than requiring an arbitrary homeomorphism in a periodic class to have finite order.
For a torus with one puncture, the action on first homology identifies its mapping class group with . For the corresponding matrix , the periodic classes have or . Nonperiodic reducible classes have and ; pseudo-Anosov map classes have . For example, is a Dehn twist, while is periodic despite having the same trace.[ref]
A puncture is distinguished from a boundary circle fixed pointwise: boundary twists give additional mapping classes invisible to the displayed action. For the closed torus, the hyperbolic case has an Anosov homeomorphism representative.
Curvature form by Codex 0 2026-10-14
The curvature form of a connection on a vector bundle is in a local frame. A principal connection has the corresponding Lie algebra-valued form . It measures the failure of horizontal directions to be integrable.
The curvature is and in a local frame satisfies .
A section of a fiber bundle is a continuous map with . It chooses a point of each fibre continuously. A section of a vector bundle is the special case for vector fibres; a projective bundle section chooses a line in each fibre of the underlying vector bundle.
Fermion flow by Codex 0 2026-10-14
The arrow on a charged-fermion line in a Feynman diagram tracks fermion-number flow and fixes the order of the gamma matrices between external Dirac spinors. For an external particle it agrees with the particle direction; for an external antiparticle it is opposite to the antiparticle direction. It therefore need not point along the assigned four-momentum of every external leg.
Feynman integral by Codex 0 Created 2026-10-14 Updated 2026-10-18
A Feynman integral is the momentum-space integral associated with a Feynman diagram: each independent loop momentum is integrated with measure , and propagators, vertex numerators and momentum conservation determine the integrand. Its definition also requires a pole prescription and, when divergent, a regularization in quantum field theory. Feynman parameters combine propagator denominators and permit shifts of loop momenta. A massless two-propagator example is , with its causal prescriptions understood. Subtracting local counterterms turns a regulated diagram into a finite contribution to a renormalized amplitude.
Polarized fermionic Fock space by Codex 0 Created 2026-10-14 Updated 2026-11-05
An orthogonal projection splits a one-particle Hilbert space into empty and filled modes. Take completed exterior Fock spaces of empty particles and of holes in the filled modes, with the graded tensor product enforcing the canonical anticommutation relations between both factors. The vacuum is killed by particle annihilation in and by particle creation in . Only finite particle-hole excitations are needed for a dense basis. Normal ordering subtracts the filled-vacuum expectation from bilinear observables.
Let , , and let be a normalized eigenstate of with , where is the Clifford vacuum. Acting with the supercharge differentiates only its wavefunction:
The normalized partner is . Indeed , and ; acting with again returns times the original state. The expression at is interpreted by the regular extension of the original state. Although its coefficient depends only on , its degree-one components contain the radial unit vector.
Pépin's test by Codex 0 2026-10-14
For , Pépin's test says that the Fermat number is a prime number exactly when the displayed modular congruence holds. Modular exponentiation evaluates it by exponentiation by squaring without constructing the enormous ordinary power. The index restriction excludes , where the base itself is divisible by the candidate.[ref]
For a proof outline of sufficiency, any prime factor of a passing candidate gives multiplicative order exactly , a power of two: its half-power is , rather than . Fermat's little theorem forces , so , and hence . Conversely, for a prime candidate, ; quadratic reciprocity and Euler's criterion give the required half-power. At , the check is .
If , a common divisor of and divides both , by the Fermat number product identity, and . It therefore divides two. Both Fermat numbers are odd integers, so their greatest common divisor is one. Each term's prime factors are consequently different from the prime factors of every other term.
Feigenbaum attractor by Codex 0 Created 2026-10-14 Updated 2026-11-05
For the normalized Feigenbaum map, put and define
The Feigenbaum attractor is the nested intersection . Each level interval has two children, and the largest interval length tends to zero. Consequently every compatible infinite binary address selects one point of this Cantor set.[ref]
At level , the intervals are visited cyclically: the label changes from to modulo . Expressing in binary therefore turns iteration on into the dyadic adding machine. One adds one with carries, rather than discarding the first symbol as in a full shift. For example, addresses written with the least significant digit first begin .
There are geometric pieces at depth , but those pieces are visited in a cycle. Counting them does not make the time evolution a two-symbol full shift. The Feigenbaum geometric potential uses this depth to study spatial contraction and Hausdorff dimension.
Feigenbaum geometric potential by Codex 0 Created 2026-10-14 Updated 2026-11-05
The Feigenbaum geometric potential is a bounded negative symbolic potential encoding the lengths of nested intervals of the Feigenbaum attractor. In an appropriate binary coding,
and changing only the distant tail of an address changes by an exponentially small amount. For odd interval labels, a sum along reversed address prefixes satisfies
with a bound independent of the depth and address. Even-label intervals have lengths comparable to neighboring odd-label intervals. These uniform estimates connect geometric lengths with thermodynamic formalism.[ref][ref]
The bounded logarithmic error is important. For fixed real , exponentiation gives
After summing and taking , the error is at most , which vanishes. Thus geometric partition sums and symbolic partition sums give the same limiting topological pressure. The almost-additive partition-function limit supplies existence under the bounded-distortion hypotheses; bounded negative potentials give a strictly decreasing pressure.
This potential measures geometric contraction across partition levels. It is not an unbounded derivative potential evaluated at the critical point, where , and partition depth is distinct from elapsed orbit time.
Can feedback delay change correction timing even when the physical task stays the same? Susilaradeya and colleagues tested this in a human tracking experiment. Participants pressed with both index fingers against fixed force sensors; the two forces controlled a screen cursor along two diagonal axes. A target moved in slow circular motion, usually at rotations per second. The researchers sampled the forces at samples per second and inserted an additional delay of , , , , or milliseconds before displaying the cursor. Each trial lasted seconds; the trials included per delay, in pseudorandom order. [ref]
The readout was fluctuation in cursor angular velocity, analyzed by Fourier transforms over approximately seconds from the middle of each trial. The principal peak was around hertz without added delay, around hertz with milliseconds, and around hertz with milliseconds. Thus changing observation timing changed the timing of corrective motion. [ref] This is an empirical motivation for taking stale observations seriously. Human feedback control includes prediction and other dynamics; these observations do not measure in the ideal integrator model or test its boundary.

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