Matrix pencil 2026-10-14
A matrix pencil is an affine one-parameter family of matrices. For square matrices of size , its determinant is a polynomial of degree at most . If is invertible, its leading coefficient is , so at most distinct parameters give a singular matrix. This translates linear dependence in a family of bases into polynomial root counting.
Matrix norm 2026-10-14
A matrix norm is a norm on a vector space of matrices; common choices include induced operator norms and the Frobenius norm. A submultiplicative matrix norm additionally satisfies . The matrix 2-norm is the norm induced by Euclidean norms and equals the largest singular value.
Cauchy matrix 2026-10-14
A Cauchy matrix has entries with nonzero denominators. If are distinct, it is positive definite: is the Gram matrix of linearly independent exponential functions. This form occurs in finite-rank inverse scattering transform reconstructions.
Integer matrix 2026-10-14
An integer matrix is a matrix whose entries are integers. Sums and products of compatible integer matrices remain integer matrices, but a nonsingular square integer matrix can have a nonintegral inverse matrix. The unimodular matrix condition characterizes exactly when that inverse matrix also has integer entries.
In a singular first-order equation with coefficient , an outer correction proportional to cannot be evaluated at the endpoint. The inner scale changes it to . Matching retains the logarithmic constant, which is larger than a plain order-epsilon correction. For , , the exact solution verifies the displayed endpoint asymptotic and its remainder.
A decaying algebraic tail in an inner asymptotic expansion can become a fractional-order outer correction after rescaling. For an inner tail proportional to and outer variable , the outer correction is proportional to . If the next outer correction contains , expressing it in the inner variable produces both and . Omitting the latter loses a term larger than a plain correction. Matching must include all these scales and constants, rather than only the leading algebraic powers.
Multiplication by makes this example exactly integrable once: . Its homogeneous solution is . A solution with that remains uniformly bounded needs , hence . The scales and connect the small outer solution to the order-one endpoint value. Bounded homogeneous contributions remain invisible to algebraic matching at the right boundary.
For fixed and endpoint values , , the outer solution is . The left boundary layer has width . At the right, a layer of width carries the order-one rise, and a translated layer of width connects its inner edge to the small plateau. The dominant balance depends on both amplitude and derivative scale; using the same scale at both ends loses a necessary match.
An asymptotic matching condition requires the inner expansion and outer expansion, re-expressed in a common overlap region, to agree to the retained order. Both function values and slopes may constrain the free constants. In the square-root reaction problem with nested boundary layers, the shared small plateau sets the first integral of a square-root reaction layer, while its large-field fourth-power tail fixes the neighboring broad layer.
For , matching , fixes the first integral to . Hence endpoint values above cannot match this outer branch. The upper family is . An endpoint value strictly between and admits two translations, one initially approaching and one initially moving towards the turning value . Values below give the unique lower family with . Matching to zero instead gives , which forbids a nonconstant real approach to zero. These are leading boundary layer classifications, not exact multiplicity theorems at degenerate endpoint data.
A growing linear mode can make a formally small derivative nonlinearity order one at large distance. After the crossover scaling, the equation reduces to a logistic differential equation in for . Matching at small gives and the displayed primitive with . It changes from quadratic growth to linear growth without a finite turning singularity.
For , , , the exact outer solution is and the mismatch is at the right endpoint. In , matching gives and . Differentiation at gives the displayed endpoint slope. The order-one term requires the first inner correction; differentiating only the leading boundary layer loses it.
Massless p-form duality 2026-10-14
For a free massless p-form gauge field with , its field equation makes closed. The Poincaré lemma writes it locally as , giving a dual potential of degree . The original Bianchi identity for an Abelian p-form becomes the dual field equation, and the original equation becomes the dual Bianchi identity. The two descriptions have equal little group counts . Global fluxes and top forms require separate treatment.
// Target: quantum-field-theory.bigb
Massive p-form duality 2026-10-14
For a free massive p-form field, the displayed dual has degree . The massive field equation reconstructs locally from with the signature-dependent sign. It also gives and . The polarization counts agree because . The construction depends on nonzero mass and therefore differs from massless p-form duality by one potential rank.
// Target: physics.bigb
Stueckelberg mechanism 2026-10-14
For , introduce a -form and replace the mass term of a massive p-form field by one built from . The transformations , leave this combination and invariant. Gauge fixing recovers the original massive theory. Its massless-component counts add as , explaining the longitudinal degrees of freedom and the corresponding assembly of nonzero Kaluza-Klein modes.
The massive N=1 vector multiplet contains spins . Its massless helicity content splits into a CPT-complete vector multiplet with helicities and , and a CPT-complete chiral multiplet with helicities and . The longitudinal vector polarization becomes one of the two scalar polarizations; the other comes from the original real scalar. This is the representation-theoretic inverse of the supersymmetric Higgs mechanism.
Let independent increments equal or with probabilities each, and zero otherwise. Every partial sum is integrable and is a martingale. The Borel-Cantelli lemma makes only finitely many increments nonzero almost surely, so has a finite almost-sure limit . Yet : the disjoint events that only the th increment is nonzero have probabilities at least for , and contribute at least each. This does not contradict the martingale convergence theorem, whose integrability conclusion requires a uniform first-moment bound.
// Target: markov-process.bigb
Trace plot 2026-10-14
A trace plot displays an observable along successive iterations of a Markov chain Monte Carlo algorithm. Its horizontal axis is iteration and its vertical axis is the observed parameter or function value. Trends suggest an initial transient or slow exploration, separated regimes suggest transitions between posterior regions, and exact plateaus show repeated states. The plot should be read with acceptance statistics, autocorrelation and multiple starting states; its visual appearance alone cannot prove stationarity or identify the unique cause of poor mixing.
For a chain map , use and . The chain map identity makes . The short exact sequence of chain complexes has connecting homomorphism in degree . Its long exact sequence in homology shows that the homology of vanishes precisely when every is an isomorphism.
Spectrum homotopy 2026-10-14
A spectrum homotopy between compatible maps is a map from the cylinder spectrum restricting to them at the endpoints. Thus the homotopies at all levels must themselves respect the structure maps.

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