Root lattice Created 2026-09-24 Updated 2026-11-05
For a crystallographic root system, the root lattice is the integer span of the roots, equivalently of the simple roots.
Root-space reducedness lemma Created 2026-10-06 Updated 2026-11-05
For a complex semisimple Lie algebra, restrict the module to the sl2 subalgebra associated with a root. All its weights are even. Its raising operator maps the weight-zero space onto the one-dimensional line of the chosen root vector, so there is exactly one nontrivial irreducible summand: the adjoint module of highest weight . Thus the root spaces at are one-dimensional and is not a root. For any parallel root , the integers and have product ; excluding double and half roots leaves only .
Root SU(2) subalgebras of SU(3) Created 2026-10-14 Updated 2026-11-05
Each root of the SU(3) Lie algebra defines an SU(2) Lie algebra generated by and in the root-length-one convention. They obey and . These subalgebras explain root strings, Weyl group reflections and the integer Dynkin labels of highest weights.
// Target: lie-theory.bigb
Root system Created 2026-09-24 Updated 2026-11-05
In the general reflection convention, a root system in a finite-dimensional real inner product space is a finite spanning set such that every root reflection
permutes . In particular whenever . A reduced root system additionally requires . A crystallographic root system additionally requires all Cartan integers to be integers. Some authors include these extra conditions in the term root system; they are stated separately here.
For example, the A2 root system is in the plane . Its six roots form a regular hexagon, and their reflections generate a Weyl group isomorphic to . The roots of a complex semisimple Lie algebra form a reduced crystallographic root system: its root-space decomposition converts infinitesimal Lie brackets into this finite Euclidean geometry. The Dynkin diagram then records enough simple-root data to classify its simple components.[ref]
Root-system finiteness lemma Created 2026-09-24 Updated 2026-11-05
In a reduced crystallographic root system, for roots ,
where is their angle. Integrality gives an integer, and nonparallelism makes it strictly smaller than four.
Rosser–Schoenfeld totient bound Created 2026-10-07 Updated 2026-11-05
For every integer , the Rosser–Schoenfeld totient bound states
where is Euler's totient function, is the Euler--Mascheroni constant and the logarithms are natural logarithms. The original theorem bounds above; its positive right side can be inverted to obtain this lower bound.[ref]
Thus the fraction of congruence classes modulo which are units is . It can be much larger: for a prime number it equals .
For a positive integer with , the Euler's totient product formula also gives : the product for omits some factors from the product for . A certified lower estimate for the ambient value therefore controls every divisor ratio, including , without evaluating at small values.
Rotational order 2026-11-05
A rotational order expresses a signal’s frequency relative to a specified reference shaft’s rotational frequency:
Thus means one oscillation per reference revolution and means one oscillation per two reference revolutions. A rotational order is dimensionless and need not be an integer. It is especially useful when a machine changes speed: a shaft-synchronous feature can keep the same rotational order while moving through many frequencies in an ordinary frequency spectrum.[ref]
The reference is essential. Suppose shaft A turns at and shaft B at . The same signal has rotational order relative to A and relative to B. Changing the reference has changed the dimensionless label, not the measured vibration. Likewise, a 24-tooth gear turning at has a gear mesh frequency of . Its mating 8-tooth gear turns at , giving the same gear mesh frequency but rotational orders and relative to the two shafts.
For a component with unwrapped phase and reference angle , the instantaneous version is
where the reference angular velocity is nonzero and both angles use the same units. A constant rotational order gives . This explains why angular resampling makes a speed-following component periodic as a function of shaft angle. A vibration fixed at instead changes from rotational order to when the reference shaft accelerates from to .
An order tracking measurement therefore pairs a vibration sensor, such as an accelerometer, with a shaft-angle or speed reference, such as a tachometer. An order peak identifies a speed relationship; it does not by itself establish which part is damaged. A resonance can greatly change the amplitude as speed changes even when the excitation’s rotational order stays fixed.
Rotation content of induced Lorentz representations Created 2026-10-07 Updated 2026-11-05
In the compact picture of a principal-series group representation of the Lorentz spinor double cover, functions on SU(2) have a fixed right-torus character . Expanding into spin matrix coefficients leaves one right weight in each allowed spin, giving the displayed multiplicity-one rotation decomposition. The boost action couples these spaces. The central element acts by ; even yields integer rotation spins and a group representation of the connected Lorentz group.
Rough number Created 2026-10-06 Updated 2026-11-05
A -rough integer has no prime factor below ; is included. Some authors instead exclude prime factors at most , so the endpoint convention should be stated.
The rounded Bernstein polynomial replaces each coefficient in the unnormalized basis by its floor function. It therefore has integer coefficients in the ordinary monomial basis. If , only interior rounding errors remain and
To prove this, bound each interior rounding error by one. On , sum the resulting powers as a geometric series of ratio at most and maximize ; reflect for . On the middle interval each degree- product is at most . integer endpoints are necessary for this convergence: a noninteger endpoint produces a fixed nonzero rounding error there.
Round-trip testing Created 2026-10-24 Updated 2026-11-05
Test a conversion together with its intended inverse. Equality of representations may need normalization, while equality of numerical values can be limited by floating-point rounding or truncation. Distinct strings can encode the same value, so a value round trip and a character-for-character round trip are different properties.
An independent oracle is still needed: the wrong functions and satisfy both composition identities on integers, although neither implements an intended identity conversion. Thus passing inverse-consistency tests does not alone establish the specification of either conversion.
Row lattice of an integer matrix Created 2026-10-05 Updated 2026-11-05
The row lattice of an integer matrix with rows is the set of their integer linear combinations. It is an Euclidean lattice in its real span, since it is contained in the discrete set and spans that real vector space. For a nonsingular two-by-two integer matrix, the row Hermite normal form in rank two gives a canonical basis and proves that its index in is the absolute value of its determinant.
RSA cryptosystem Created 2026-09-24 Updated 2026-11-05
In the two-prime RSA cryptosystem, choose distinct odd prime numbers , set , and choose an integer coprime to . A private exponent satisfies . The public key is ; the private key permits the inverse modular exponentiation. For a message representative ,
Correctness holds even when is not coprime to : modulo each prime the zero case is immediate, while the nonzero case follows from Fermat's little theorem; the Chinese remainder theorem recombines the two congruences.
For example, , , and give ; encrypts to and decrypts back to . These tiny parameters only illustrate the arithmetic. The raw deterministic exponentiation is textbook RSA; practical encryption uses an encoding scheme rather than encrypting an unencoded message directly.[ref]
Safe tuple relational calculus restricts tuple relational calculus so that output values come from the finite input relations or explicit constants, with suitable restrictions on quantification. This prevents an apparently simple database query from demanding an infinite result over an unrestricted value universe. Database query safety is a semantic requirement; merely writing a familiar-looking formula does not ensure it.[ref]
For a finite unary relation , the database query safely returns . In contrast, over all integers requests every other unary database tuple, an infinite collection. Restricting negation to tuples already drawn from another finite relation gives an expressible finite set difference. Under the usual finite relational model, the safe calculus and relational algebra express the same queries.
Sample depth Created 2026-10-14 Updated 2026-11-05
The sample depth is the number of bits allocated to one stored sample. An unsigned -bit integer has codes, . This is per component, not automatically per pixel: three eight-bit components require 24 payload bits per pixel. A raster image with pixels and such components requires payload bits before data compression, padding or a file header.
For a toy normalized shade , define uniform quantization with endpoints included by
The floor function implements rounding to the nearest code, with exact halves rounded upward. The reconstruction step is , and . For , the levels are ; for they are . Increasing sample depth refines this value grid without changing the spatial grid. These levels are uniform in ; if is encoded sRGB, they are not uniform in relative luminance.
PNG uses a bit-depth field per sample or palette index. Its grayscale type without alpha permits 1, 2, 4, 8 or 16 bits per sample; its truecolour type permits 8 or 16 bits per component. These are format-specific restrictions, not a rule for every raster image.[ref]
Let the numerical support of a probability distribution be . Its cumulative distribution function counts how many values have been passed:
It is zero below , equals on for , and is one at and above . Every jump is , even when the horizontal gaps differ.
For inverse transform sampling, take an ideal continuous uniform distribution for on . Partition that interval into intervals of width and output
Each interval has probability , proving the desired discrete uniform distribution. Using the floor function, the index is ; for consecutive integer values the output is . With the usual quantile function convention , one instead writes for , using the ceiling function. The endpoint conventions differ only at a finite set of points with probability zero under the ideal continuous uniform distribution.
For , the four intervals , , , and select , respectively. Thus selects , while selects . The upper half of the interval selects values at least four, recovering probability . Equal widths refer to the sampling probability coordinate, not to distances between output values. This is an exact mathematical construction assuming an ideal continuous uniform distribution; a finite computer random-number source needs its own justification of equal output chances.
Sampling an integer-shape gamma distribution Created 2026-09-24 Updated 2026-11-05
Let be a positive integer, , and independent uniform random variables on . Then
has a gamma distribution of shape and rate , also called an Erlang distribution. The unit interval is essential: an unspecified uniform distribution on another interval would not give this algorithm.
For , . Each summand therefore has an exponential distribution with rate , and additivity of independent gamma distributions with a common rate proves the result. For , the output has expected value and variance . The formula directly covers integer shapes; replacing by a noninteger number of draws does not define a sampler for a general gamma shape.
Saturated sublattice Created 2026-10-14 Updated 2026-11-05
A subgroup of a finitely generated free abelian group is saturated if for a nonzero integer implies . Equivalently is torsion-free. It is then free abelian and the quotient map splits, so is a direct summand. Intersecting with a real linear subspace always gives a saturated sublattice.
// Target: algebra.bigb
Relevant locators: remainder %, gcd, isValidInt and toInt. Scala's BigInt provides arbitrary-precision integer arithmetic; representability must be checked before conversion to a fixed-width integer because narrowing conversion need not preserve the exact value. The archived API corroborates the operations used in the solution without claiming a particular installed Oxford course library version.
Scaled Heisenberg lattice Created 2026-10-14 Updated 2026-11-05
For a positive integer , in the real Heisenberg group with multiplication , the displayed set is a discrete cocompact subgroup. Writing , , gives and central. Hence its abelianization is . The right quotient maps to by its first two coordinates; each fibre is the central circle .