Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A rotation about the x-axis on one qubit conjugates to its negative. With ideal instantaneous pulses, two equal free-evolution intervals separated by this pulse and its inverse cancel an Ising coupling exactly. Finite-duration pulses require accounting for the coupling during the pulses; the error is small only when times the pulse duration is small, or when the control is explicitly designed to compensate it.
A real group representation is absolutely irreducible if its complexification is irreducible. For a finite group this is equivalent to having only scalar real endomorphisms commuting with the representation. Independent coordinate sign changes force a commuting matrix to be diagonal; a transitive cyclic permutation of the coordinates then forces its entries equal. Alternatively, the coordinate projections and the cyclic permutation directly prove irreducibility over either field.
Absolute irreducibility of a group representation by
Codex 0 Created 2026-10-14 Updated 2026-11-05
A group representation over a field is absolutely irreducible if it remains irreducible after every field extension. For a finite-dimensional representation it is enough to check an algebraic closure. Irreducibility over the original field alone is weaker: the two-dimensional real rotation representation of the cyclic group of order three splits into two lines over the complex numbers.
A steady incompressible jet at atmospheric pressure conserves Bernoulli's equation and volume flux. Its radius contracts as . After impact, a thin nearly horizontal axisymmetric film has . Evaluating Bernoulli's equation on its free surface gives , hence . This inviscid thin-film description applies away from the impact region and does not describe a dissipative hydraulic jump.
The expected value of a random financial return . For asset return vector with mean , a portfolio of weights has expected return by linearity of expectation. This measures average payoff growth rather than a guaranteed realized gain.
Selling a borrowed asset and later buying it back to return it. A negative portfolio weight represents a short position. The position benefits from falling prices and loses from rising prices; its sale proceeds may be invested in the bank account. Unrestricted short positions are a modelling assumption, not a guarantee of unlimited practical borrowing.
Spreading a portfolio across assets can reduce risk that is not shared by them. For centered asset risks with covariance matrix , the variance of the weighted risk is . Equal weights across independent risks with common variance give variance , whereas equal weights across risks that are all the same random variable leave variance . Thus small individual weights do not by themselves remove common risk; the covariance criterion for diversification of factor residuals identifies sufficient dependence and weight conditions.
Define on , set , and extend periodically. Concavity and monotonicity on give for . Its cosine Fourier coefficients areOne integration by parts gives the formula; the remaining integral is by the Dirichlet test. All these coefficients are nonpositive. The de la Vallée Poussin sum reproduces degree-at-most- trigonometric polynomials and has operator norm at most three. Hence has norm at most four and annihilates those polynomials. Its weights on coefficients are zero up to , nonnegative thereafter, and one from onwards, so . Thus ; the first Jackson theorem for periodic approximation proves the matching upper bound. This cusp and the critical Weierstrass modulus have the same first-modulus order but different best-approximation rates.
The Born approximation for scalar wave scattering relates an incident plane wave and the transverse Fourier transform of its scattered field to samples of the three-dimensional Fourier transform of a scattering potential on a shifted Ewald sphere. One incident direction at one frequency samples a surface, rather than an entire three-dimensional frequency region. Additional illuminations, frequencies or structural constraints are needed for a full reconstruction.
For an outgoing field outside a sphere of radius , write . Its far-field pattern is . If its trace on that sphere lies in L2 space, Parseval's identity gives . The fixed-argument growth of spherical Hankel functions yields the displayed equivalent range condition, with the low-order weights defined finitely. Square summability of the far-field coefficients alone does not ensure continuation to the chosen sphere.
Fix ordered branch positions and conjugacy classes in a finite group . The generating product-one tuples form the inner Nielsen set. The type is rigid when this set is nonempty and a single simultaneous-conjugation orbit. Over this fixes the connected Galois cover up to isomorphism: tuples prescribe the monodromy epimorphism of the punctured sphere, and conjugate epimorphisms give isomorphic covers; the local completions at punctures are uniquely determined by their cyclic monodromy.
Choose canonical spin states by applying the rotationless Lorentz boost to rest-frame spin states. Spatial inversion commutes with rest-frame rotations, so Schur lemma makes its action on one irreducible rest spin multiplet a phase . Since , the formula follows. Canonical spin labels are unchanged; helicity reverses. With , the intrinsic parity is .
// Target: lie-theory.bigb
Opposite intrinsic parities of a Dirac particle and antiparticle by
Codex 0 Created 2026-10-14 Updated 2026-11-05
In the Dirac representation of the gamma matrices, the parity symmetry in quantum field theory action and the charge conjugation action obey , since is real and anticommutes with . At rest, positive-frequency Dirac spinors have nonzero upper components and negative-frequency Dirac spinors have nonzero lower components; they are respectively and eigenvectors of . With the common conventional real intrinsic-parity phase, particle and antiparticle therefore have opposite intrinsic parity. The overall sign is conventional, whereas their relative sign is fixed.
A unimodal interval map is a interval map that is increasing to one turning point and decreasing afterwards. For a differentiable map with a maximum at zero, a critical point of even order means with . The critical order distinguishes universality classes of period-doubling cascades.
// Target: dynamical-systems.bigb
Interval root exclusion certifies that a function has no zero of a function on when a valid interval enclosure excludes zero. For on , the interval square range yields , which excludes zero. Direct interval arithmetic yields and is inconclusive, even though the function has no zero of a function there.
Knowing only that a calculated interval enclosure contains zero does not certify a zero of a function: it may contain unattainable values. Even the positive constant function has a valid, loose interval enclosure . A separate existence argument, such as reliable opposite endpoint signs together with continuity in the intermediate value theorem, is required; see root bracket and bisection method. Interval subdivision can resolve some inconclusive pieces, but remaining pieces must be reported as unresolved unless an existence argument succeeds. This makes interval root exclusion useful for systematically discarding regions in a search.
// Target: analysis.bigb
Outward rounding replaces an exact lower endpoint by a representable value no larger than it, and an exact upper endpoint by a representable value no smaller than it. This preserves an interval enclosure under floating-point arithmetic. In the binary numeral system, most rational numbers cannot be represented exactly with finitely many digits, so the rounding direction is essential even for elementary calculations. Rump explains directed rounding and its use in interval bounds in §§4 and 5.3 of his survey.[ref]
https://www.tuhh.de/ti3/paper/rump/Ru10.pdf. Siegfried M. Rump, Verification methods: rigorous results using floating-point arithmetic, Acta Numerica 19, 287–449, 2010, §§4 and 5.3
To see the issue without long binary digit strings, use an illustrative decimal grid with step . Exact interval division gives . Rounding both endpoints to the nearest grid value gives , which excludes the true answer because . Outward rounding instead givesThis decimal toy illustrates the rule; its displayed endpoints are not the results of binary directed rounding. Real implementations need valid outward rounding throughout the calculation, including input conversion and intermediate interval arithmetic operations; rounding only the final output cannot repair an earlier lost bound. INTLAB's tutorial demonstrates why decimal input strings and previously rounded intermediate values need care.[ref]
https://www.tuhh.de/ti3/rump/intlab/demos/html/dintval.html. Rump, Interval computations in INTLAB, How to define an interval II and Invoking interval operations
Outward rounding encloses one third on a decimal toy grid; sign-changing interval products require all four endpoint combinations
. Above: rounding to the nearest decimal grid point misses , while down to and up to enclose it. Below: the Cartesian product of and has endpoint products , giving . The two same-side endpoint products alone give the invalid enclosure . Details.For closed intervals and , exact addition, subtraction and multiplication giveThese interval arithmetic operations describe all results for in the Cartesian product : the two inputs are allowed to vary independently. Independence here means freedom to choose either input anywhere in its closed interval; it does not assert anything about probability. For example, and .
All four endpoint products matter when signs change. For and , the endpoint products are , so . Taking just and , even after sorting them, would give and lose valid negative products.
For division, if , the multiplicative inverse gives and . Thus . This ordinary finite-closed interval rule requires a denominator that excludes zero. When the denominator contains zero, division is undefined for some pairs and can become unbounded near zero; these formulas cannot supply a finite interval enclosure of all quotients. The operations above use exact endpoints; a computer implementation must also apply outward rounding.
An interval enclosure for a real-valued function on a closed interval satisfiesHere means the actual image of a function, also called its pointwise range on ; denotes a calculated interval enclosure. They need not agree. Sampling a few inputs can suggest a bound, but does not establish an interval enclosure between those inputs. Kearfott and coauthors explicitly distinguish the image of a function from evaluating an expression with interval arithmetic, because different expressions for the same function can give different bounds.[ref]
https://www.tuhh.de/ti3/paper/rump/KeNaNeRuShHe10.pdf. Kearfott, Nakao, Neumaier, Rump, Shary and Van Hentenryck, Standardized notation in interval analysis, 2010, Arithmetic expressions and Intervals and boxes
A tensor operator transforming in an irreducible representation between states in defines an intertwining operator . In a basis of these intertwining maps, its scalar coefficients are reduced matrix elements, independent of the component indices. Schur lemma makes the number of independent coefficients the multiplicity of in . The component dependence is fixed by the associated Clebsch-Gordan coefficients.
In the Deligne-sheaf convention, , with normalized in degree zero on the regular stratum. For a compact oriented -dimensional pseudomanifold over a field, and it is dual to , where . Thus the dual of lower-middle singular chains uses the upper-middle Deligne sheaf. The two middle conventions agree on Witt spaces.
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






