Weyl integration formula for U(n) 2026-10-14
For the unitary group, the diagonal maximal torus has coordinates and Weyl group . The Weyl integration formula weights independent uniform angles by . The Vandermonde determinant has squared torus integral , by Fourier orthogonality. Multiplying an irreducible character of highest weight by this determinant gives an alternating Laurent polynomial. Its leading alternant has coefficient one; character orthogonality for compact groups forces every other alternant coefficient to vanish. This yields the quotient .
Weyl sigma matrices 2026-10-14
For mostly-minus metric signature, the Weyl sigma matrices are and , where are the Pauli matrices. The Pauli matrix multiplication law provesA real Lorentz four-vector is equivalently a Hermitian matrix with . The transformation for preserves this determinant and gives the Lorentz spinor double cover. The indices therefore convert a vector index into one undotted and one dotted Weyl spinor index. They are the invariant tensors in the mixed supercharge anticommutator .
Wronskian Created 2026-09-24 Updated 2026-10-18
For two differentiable functions on an interval , their Wronskian is the functionThe order matters: exchanging and reverses the sign. For sufficiently differentiable functions, the Wronskian is the determinant .[ref]
1 Algebraic and Analytic Methods. NIST Digital Library of Mathematical Functions; §1.13(i), equation 1.13.4 and the following n-argument definition
The Wronskian measures whether the vectors and supply independent value-and-derivative data at that point. For real-valued functions, its absolute value is the area of the parallelogram they span. If a constant linear combination is zero throughout , then too. A nonzero Wronskian at even one point makes this pair of linear equations invertible and forces . Thus a nonzero Wronskian somewhere always proves linear independence of the functions on .
For an explicit example, the exponential functionssolve the same homogeneous linear differential equation on the whole real line: substitution gives and , respectively. Their Wronskian isFor the initial value problem , , the linear combination requires and . Hence , , and . The nonzero Wronskian makes the two initial conditions independently adjustable.
Independent exponential functions supply independent initial data, with Wronskian equal to the oriented parallelogram area
. Details. The stronger converse requires a common equation. Suppose solve with continuous functions on one interval . Then the functions are linearly independent if and only if their Wronskian is nonzero at one point, equivalently at every point. If , choose constants , not both zero, making satisfy . The superposition principle makes a solution of a differential equation for the same equation, and the uniqueness theorem for ordinary differential equations forces to be identically zero. This proves linear dependence.[ref]
The Wronskian. 18.03 Supplementary Notes by Haynes Miller; Chapter 15, The Wronskian, printed pp. 72–73: initial-data system (3) and the zero-or-nowhere-zero theorem
For arbitrary differentiable functions, an identically zero Wronskian need not imply linear dependence. Consider, on ,Both functions have three continuous derivatives. On each side of zero, is a constant multiple of , so ; at zero their values and first derivatives are all zero, so the Wronskian is zero there too. Nevertheless evaluated at gives , while evaluation at gives . Hence : these functions are linearly independent on the whole interval. There is no single constant multiplier valid on both sides of the common zero.
An identically zero Wronskian can coexist with linear independence when the common regular equation hypothesis is absent
. Details. These functions cannot both solve any equation with continuous functions throughout : even alone would contradict uniqueness because but is not identically zero. They do solve the singular equation , whose leading coefficient vanishes at zero. Dividing by gives only away from zero; Abel's identity cannot be applied across that point. The example pinpoints why checking the equation and its interval is essential before using a zero Wronskian to infer linear dependence.
X-ray spectral attenuation operator 2026-10-18
For a fixed homogeneous absorber in a narrow-beam geometry, define the X-ray spectral attenuation operator on L1 space over a bounded positive energy interval. A physical input is an integrable function giving incident photon rate density. Let its linear attenuation coefficient be a measurable function, with . The transmitted uncollided density isHere is a fixed bounded detector response described by a measurable function; background has been subtracted. This is a positive linear operator on L1 space. Since , it cannot increase the integrated absolute incident rate. Multiplication of exponentials proves for successive layers of the same material. Ignore secondary radiation entering the detector, saturation and changes to the source. Discrete spectral lines use the finite-sum version below instead of an ordinary rate density.
For a chosen filter, stipulate , and input line rates in a common arbitrary rate unit. Assume equal calibrated detector weight for both lines. At ,The selected line's fraction rises from to , but its absolute rate falls by about . Filtering improves purity at the cost of signal. It multiplies existing components and cannot create a new emitted spectral line.
With just one integrated reading, , the two unknown line rates are underdetermined. If the source is unchanged between an empty-path reading and a filtered reading, the ideal inverse problem becomesThe determinant is nonzero, so these two ideal readings determine the two stipulated line rates uniquely. Identical coefficients would give zero determinant and destroy that separation. This small linear algebra example explains why absorber contrast supplies information, while also showing its limit: unknown scattered components or unknown detector weights add unknowns that two readings cannot determine.
An invertible matrix need not admit the unpivoted Thomas algorithm. For example,Here and , but makes undefined. Interchanging the two equations instead gives the upper triangular matrix system , , solved immediately by back substitution. Even a nonzero first diagonal does not guarantee all later pivot elements: has determinant , yet .
For a general tridiagonal matrix, use a solver with partial pivoting when these structural guarantees are unavailable or a dangerously small pivot element occurs. Adjacent row interchanges can introduce a second upper diagonal, so a pivoted solver must track that additional fill-in; it cannot blindly continue the unpivoted recurrence relations. LAPACK's
DGTSV explicitly performs partial pivoting, stores this extra upper diagonal, and includes it in back substitution. Its fixed-width storage and bounded work per row retain time for one right-hand side and storage.[ref]DGTSV (LAPACK 3.12.1) by LAPACK project. DGTSV, Purpose lines 34–39; DL argument lines 63–69; adjacent interchange lines 188–199; back solve lines 295–305


