Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Chiral symmetry allows independent flavor rotations of left-handed and right-handed fields. For two massless quark flavors, the non-Abelian chiral transformations form . The additional vector symmetry of baryon number acts trivially on the pion field . The low-energy pion field transforms as . Its derivative Skyrme model terms are invariant under constant . A chosen vacuum preserves the diagonal subgroup , which acts by conjugation and is the isospin symmetry. An ordinary common nonzero pion mass explicitly breaks the independent left/right symmetry to that vector subgroup; vacuum selection in the massless theory is instead spontaneous symmetry breaking. The singlet axial anomaly is a separate issue and is not part of this two-flavor non-anomalous group.
The additive flavor symmetry quantum number combines baryon number with strangeness. For the quark triplet its values are . The Gell-Mann--Nishijima formula is . This is distinct from the normalization of electroweak hypercharge.
An additive flavor symmetry quantum number: a strange quark has , its antiquark has , and up and down quarks have . The strong interaction conserves net strangeness. Together with baryon number, it determines flavor hypercharge .
For flavor symmetry acting on , trace-orthonormal Hermitian diagonal generators are and . The isospin and flavor hypercharge operators are and . Their multiples by lie in the compact SU(3) Lie algebra.
The flavor symmetry rotating down and strange quarks, with the up quark a singlet. Since down and strange quarks have equal electric charge, the charge operator commutes with all U-spin generators, and every irreducible U-spin multiplet has a common charge. Unequal down- and strange-quark masses break this symmetry.
The first polar sine and cosine harmonics of a circular boundary represent displacements of its centre. A complete translation leaves perimeter and area unchanged, so line tension supplies zero stiffness to these modes. The centre of an unconfined domain has no normalizable positional thermal equilibrium in an infinite plane; recentering the boundary removes this freedom from a shape spectrum.
Robinson arithmetic is a finitely axiomatized first-order theory in the language . Its seven axioms are the universal closures ofThey describe successor, addition and multiplication without an induction schema. Each calculation on particular standard numerals can still be verified: repeated use of the recursion equations proves, for example, . This finite computational strength is enough for representing computable finite calculations and for the diagonal lemma used in crude incompleteness theorem. Peano arithmetic adds induction for arbitrary arithmetic formulas.[ref]
Introduction to the Theory of Computation: Computability, Complexity, and the Lambda Calculus by Jean Gallier and Jocelyn Quaintance (2020). Chapter6, printed p.156, seven axioms and induction schema
An arithmetic theory is sound if all its theorems hold in the standard natural numbers. Arithmetic soundness implies consistency and rules out a proof of the negation of a true sentence. It is a semantic property, distinct from effective axiomatizability.
A structure embedding is an injective map respecting constants and operations and preserving and reflecting relations. Equivalently it preserves all atomic formulas and their negations. It identifies the source with a substructure of the target. An elementary embedding additionally preserves every first-order formula.
For , its difference quotient equals in L2 space. Thus , and translation of a function gives in L2 space. Conversely, bounded difference quotients have a weakly convergent subsequence as . Against a test function, , so that weak limit is the weak derivative of . It lies in L2 space, which is precisely the first-order Sobolev space condition.
The H1 space is the first-order Sobolev space whose elements and first weak derivatives belong to L2 space. It is a Hilbert space with inner product given by the sum of the L2 inner products of the functions and of their first weak derivatives.
On a connected open set, a Sobolev space function with zero weak gradient is constant almost everywhere. Local mollification gives constant smooth representatives on interior balls; overlaps and connectedness identify their constants. Without connectedness, the constant may differ between components. This explains the constant ambiguity in a Neumann Poisson problem.
A first-order term is built recursively from variables and constant symbols by applying function symbols to existing terms. Evaluation in a first-order structure follows the same recursion. An atomic formula applies a relation to terms, or asserts their logical equality.
For coding arithmetic computations, the signature in use is . Bounded remainder tests and polynomial equations use only these symbols. This is a statement about the language: interpretation in the natural numbers does not impose the axioms of a ring.
A signature specifies the sorts, operation symbols with their input and output sorts, and relation symbols with their input sorts. The logical connectives and quantifiers are supplied separately by the chosen logic. This separates the nonlogical vocabulary from the rules defining a coherent theory.
Least-squares projection of filament deformation velocity by
Codex 0 Created 2026-10-06 Updated 2026-11-05
At first order, the transverse drag depends on . Its zero force and torque conditions make this residual orthogonal to and . Thus is the linear least-squares projection of the prescribed transverse deformation velocity onto the span of and . This recasts a force-balance calculation as a projection.
First-order periodic transverse swimming velocity by
Codex 0 Created 2026-10-06 Updated 2026-11-05
The first-order lateral translation and rotation of a prescribed planar filament are time derivatives of fixed linear spatial averages of its shape. A periodic shape therefore gives zero temporal mean of both quantities. Net laboratory displacement can still arise at second order.
A primitive positive formula is generated from atomic formulas using only logical conjunction and existential quantification. It can be put in the form with each atomic. The exam terminology tame formula refers to this fragment. Its reduced product transfer needs only filter intersection and upward closure, together with coordinatewise choices of witnesses.
The quantifier rank of a first-order formula is the maximum nesting depth of quantifiers. Atomic formulas have rank zero; negation preserves rank, binary Boolean connectives take the maximum, and either quantifier increases rank by one. It is not the total number of quantifiers.
At NS level , the light-cone families are , , and three distinct oscillators. Their dimensions are . All have odd fermion-excitation parity. They assemble into the massive Spin group representations , a symmetric traceless tensor and a three-form of Spin(9).
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





