Massless two-flavor QCD symmetries Created 2026-10-14 Updated 2026-11-05
The gauge-covariant kinetic term for two massless quarks separates into left- and right-handed parts. Independent constant unitary quark flavor rotations preserve these terms, giving classical internal symmetry in addition to local color . The singlet axial has a chiral anomaly, while the nonsinglet chiral symmetry and vector baryon number remain exact quantum symmetries, up to their shared discrete identifications. Equal nonzero quark masses reduce the continuous flavor symmetry to .
Ancilla qubit Created 2026-10-14 Updated 2026-11-05
An ancilla qubit is a two-dimensional quantum ancilla. It is the quantum version of an ancilla bit; an auxiliary quantum register can contain several such qubits.
Extension axioms for an unrestricted binary relation Created 2026-10-14 Updated 2026-10-31
For a binary relation with no symmetry or loop restrictions, an extension axiom demands a fresh element realizing any prescribed choices of incoming edges, outgoing edges and its own loop relative to a finite list of distinct parameters. All such axioms together eliminate quantifiers: the quantifier-free type of a parameter tuple determines which witness patterns can occur. These axioms differ from the undirected loop-free theory of the random graph.
For a positive nonsquare integer and positive integers , the integer is nonzero. Therefore . If , the denominator factor is at most ; otherwise the approximation error already exceeds one. This proves that a quadratic irrational of this form is a badly approximable number. For , splitting instead at gives the strict bound .
// Target: analytic-number-theory.bigb
Indefinite quadratic form 2026-10-14
A real quadratic form is indefinite when it takes both positive and negative values. For a real symmetric matrix representing it, this means that its eigenvalues include both signs. For example, has and ; a zero value at the nonzero vector does not imply positive semidefiniteness.[ref]
Arf invariant of a quadratic form Created 2026-10-14 Updated 2026-11-05
Let be a quadratic form whose polar bilinear form of a quadratic form is nondegenerate, so . For a symplectic basis , define
This does not depend on the symplectic basis. The hyperbolic plane has Arf invariant zero; has Arf invariant one and vanishes only at zero. Every such quadratic form is an orthogonal direct sum of hyperbolic planes, with one copy of the latter plane replacing a hyperbolic plane when the Arf invariant is one.[ref]
A useful basis-independent test is
On one two-dimensional summand with symplectic basis , write ; the four terms sum to . Multiplication over the orthogonal direct sum proves the formula and the invariance of its sign. Consequently the number of zeros is . For a fixed and , the numbers of binary quadratic refinements with Arf invariant zero and one are respectively and .
Off-diagonal all-ones quadratic form Created 2026-10-14 Updated 2026-11-05
Its symmetric matrix is . The line spanned by has eigenvalue and its orthogonal complement has eigenvalue . Thus for it is nondegenerate with inertia ; for it vanishes. This gives a useful explicit example for Sylvester's law of inertia.
Integral quadratic lattice Created 2026-10-14 Updated 2026-11-05
An integral quadratic lattice is a finite-rank free abelian group with a nondegenerate integral symmetric bilinear form. Its norm convention here is . A basis gives an integral Gram matrix; basis changes preserve its determinant up to multiplication by the square of a unit.
Polar bilinear form of a quadratic form Created 2026-10-14 Updated 2026-10-20
The displayed bilinear form is the polar form of a quadratic form. In odd characteristic of a field, recovers the quadratic form; in characteristic of a field two, different forms can have the same alternating bilinear form. Over , two such forms differ by a linear map to the field, giving the affine parametrization of binary quadratic refinements.
For an ice mass in still water, approximate the wind stress by a fixed vector while retaining quadratic drag in the water. With mass per water-drag area , water coefficient and , the steady balance is . Resolving along the drift and perpendicular to it gives , . Thus and . The direction is right of the wind in the northern hemisphere and left in the southern hemisphere. This angle neglects intrinsic boundary-layer turning, ocean currents and contact forces; it is not a universal observed sea-ice turning angle.
Descent from rest under quadratic drag Created 2026-10-14 Updated 2026-10-25
For positive downward speed, gravity and quadratic drag give , . Separation and the integral of give the displayed approach to terminal velocity. The fallen distance is . The limit as recovers and distance .
Gilmore-Lawler bound 2026-10-14
For each facility and location , independently minimize its row contribution over bijections from the other facilities to the other locations, giving . Every complete assignment has row contribution at least its corresponding , so minimizing their sum is a lower bound on the quadratic objective. Fixed assignments are retained as constraints in this assignment problem, which the Hungarian algorithm solves. The independently optimal rows need not be simultaneously realizable, explaining why the bound can be strict.
Purity decouples a subsystem from its purification Created 2026-10-14 Updated 2026-10-31
If subsystem has pure state in a normalized joint pure vector , then . Indeed, for an orthonormal basis of , each squared norm is zero. Therefore the joint vector has no component outside . In particular, if Alice and Bob share a known pure entangled state, an adversary holding a purifying system has no correlations with it. This does not make every pure bipartite state useful for key distribution: a pure product state has no shared random correlations.
Suppose a perturbed polynomial has the local form with . Dominant balance gives and . The two resulting Puiseux series split a double root; their leading displacements can be real or a complex conjugate pair. Ordinary Taylor series in cannot describe this splitting.
Linear congruential generator Created 2026-10-14 Updated 2026-10-20
Choose integers , , and a seed . Iterate and return . This gives a deterministic finite-state pseudorandom number generator with output in . A nonzero increment gives a mixed generator; gives a multiplicative generator. Its period is at most , but even a full period does not guarantee good multidimensional uniformity or statistical independence.
Pseudorandom number Created 2026-10-14 Updated 2026-10-20
A pseudorandom number is an output of a deterministic algorithm chosen to imitate samples from a specified probability law. For example, a linear congruential generator returns fractions on a finite grid in . Their intended uniform distribution is an approximation, and their serial dependence must be assessed separately from the generator's period.
Pseudo-Riemannian metric 2026-10-14
A pseudo-Riemannian metric is a smooth nondegenerate symmetric bilinear form on every tangent space, with locally constant signature. Its positive-definite special case is a Riemannian metric. Unlike a positive-definite metric, an indefinite metric admits nonzero null vectors. In either signature its Levi-Civita connection is uniquely determined by torsion-freeness and metric compatibility.
Splitting theorem 2026-10-14
Geometric splitting theorems give hypotheses under which a manifold decomposes as a metric product. The Cheeger-Gromoll splitting theorem gives a Euclidean line factor for a complete connected Riemannian manifold with nonnegative Ricci curvature containing a globally minimizing geodesic line. Other splitting theorems use different curvature or causal hypotheses.
Prüfer rank bound for extensions Created 2026-10-14 Updated 2026-11-05
For a normal subgroup with Prüfer rank and quotient of rank , let . Choose at most elements generating the image of . Write with . The finitely generated subgroup needs at most generators, so needs at most . The full intersection need not be finitely generated.
Lindenbaum algebra 2026-10-14
Identify classical propositional formulae when their equivalence is provable from a fixed theory. Their equivalence classes form the Lindenbaum algebra: meet and join are induced by conjunction and disjunction, complementation by negation, and the order by provable implication. Provable equivalence is preserved by each connective, so these operations are well-defined; the familiar classical propositional identities make this a Boolean algebra. A homomorphism of lattices to preserving zero and one also preserves complements and therefore specifies a truth valuation of the atomic propositions. All axioms of the fixed theory represent one. Separating the class of an unprovable formula from one consequently gives a countervaluation, proving the completeness theorem for propositional logic.

There are unlisted articles, also show them or only show them.