Rational Schur module Created 2026-10-07 Updated 2026-11-05
For a dominant integer tuple , choose and define , using the polynomial Schur module on the right. The alternant character formula for the general linear group shows that a larger admissible shift yields the same irreducible representation.
Rayleigh quotient with one Neumann endpoint Created 2026-10-14 Updated 2026-11-05
For a nonzero real solution of on a finite interval, integration by parts gives in the displayed form. A Neumann boundary condition only at the lower endpoint does not remove the upper boundary term. Equality with additionally requires . With the lower condition, nonconstant oscillatory solutions satisfy this when their phase advance is an integer multiple of ; affine solutions must be constant, while nonzero hyperbolic-cosine solutions fail the condition. Infinite intervals additionally require convergence of both integrals.
Razborov closure Created 2026-09-28 Updated 2026-11-05
Fix a finite ground set , an integer and a size limit . The Razborov closure of a set family repeatedly adjoins a set of size at most whenever existing members satisfyAll adjoined sets remain in the same truncated ambient family. The process terminates because that family is finite. The final family is the least family containing that is closed under the rule, so the result does not depend on the order of additions.
Reachability-total layering criterion Created 2026-10-25 Updated 2026-10-31
A positive-integer labeling with and exists exactly when the condensation graph is totally ordered by reachability. Mutual paths force equal labels, and equal labels force mutual paths. Two incomparable components would require strict inequalities in both directions. Conversely number the components in topological order; total comparability forces every earlier component to reach every later one, proving both conditions. Compute the labeling in linear time. Reachability here includes length-zero paths.
Real Heisenberg quotient has no faithful finite-dimensional representation Created 2026-09-24 Updated 2026-11-05
Let be the real Heisenberg group, let be its center of a group, and let be the integer subgroup of . Every finite-dimensional continuous representation of a topological group of kills the central circle group , hence is not a faithful representation.
To prove this, lift to and differentiate. The Heisenberg Lie algebra has with central. Applying the Lie theorem to the complexified Lie algebra representation makes all representing matrices upper triangular. Its derived algebra is consequently represented by strictly upper triangular matrices, so is nilpotent. Choose the normalization for which generates . Descent to gives . Since the finite matrix logarithm of is , this forces . Hence for all real , proving the claim. This distinguishes the faithful Lie algebra representation supplied by Ado theorem from a faithful group representation of a prescribed global Lie group.
Real number Created 2026-09-24 Updated 2026-11-05
A real number is an element of the complete ordered field . This includes integers, rational numbers such as , and irrational numbers such as . The number line represents each real number by a point, and the total order distinguishes which of two different points is larger.
The field operations permit addition, subtraction, multiplication and division by nonzero real numbers. Completeness adds the least-upper-bound property: every nonempty set of real numbers that is bounded above has a supremum in . For example, the positive real numbers whose squares are less than two have supremum . That supremum is not a rational number, illustrating why the rational numbers alone leave a gap.
The density of the rational numbers means every real number can be approximated arbitrarily closely by rational numbers. Constructions through Cauchy sequences or Dedekind cuts make those approximations into a precise description of .
Real torus Created 2026-10-14 Updated 2026-11-05
A real torus is the compact Lie group obtained by identifying real vectors differing by integer vectors, with addition induced from Euclidean addition. It is a finite product of circle groups and has normalized Haar measure. Dimension two is the familiar surface torus, but toral dynamics and Fourier characters naturally use arbitrary finite dimension.
Reciprocal fractional-part sum near a rational Created 2026-09-28 Updated 2026-11-05
Reciprocal primes in a fixed arithmetic progression Created 2026-10-14 Updated 2026-11-05
For fixed coprime integers , the Prime number theorem in the arithmetic progression gives . Partial summation expresses the reciprocal-prime sum as . The integral of the relative error is : fix a threshold beyond which that error is at most , bound its remaining integral by , and then let decrease to zero. The modulus is fixed in this statement.
Recurrent Markov chain Created 2026-09-24 Updated 2026-11-05
A Recurrent Markov chain returns to its states rather than eventually leaving them forever. A state is recurrent if its positive first return time satisfies . A chain is recurrent when every state is recurrent. Within an irreducible class, recurrence is shared by every state, so testing one state suffices.
The Strong Markov property at successive return times shows that a Recurrent state is visited infinitely often almost surely when starting there. If its return Probability is , the number of visits including time zero has a geometric distribution on the positive integers, with mean . Consequently the Green-function criterion isTonelli's theorem identifies this sum with the expected number of visits. recurrence does not require a finite mean return time: null recurrence and positive recurrence distinguish infinite from finite mean recurrence time. simple symmetric random walk on the integers is null recurrent, whereas every finite irreducible chain is positive recurrent.
Recursive process 2026-10-18
A computation that retains pending operations while further calls run, then completes those operations as results return. A recursive procedure can instead describe an iterative process: passing an updated accumulator onward may leave no arithmetic pending. Avoiding growing call stack storage in that case depends on the implementation. A fixed number of variables also does not imply fixed storage in bits when their integer values grow.[ref]
Structure and Interpretation of Computer Programs by Harold Abelson and others. Structure and Interpretation of Computer Programs, second edition, §1.2.1: deferred operations, state variables, and implementation dependence of space use; bit-storage qualification added here
Redistribution of polynomial factors for dice Created 2026-10-14 Updated 2026-11-05
Encode a fair die with face labels by . Its probability generating function is . Two independent dice with polynomials have the same sum probability distribution as another pair if and all four dice have faces. Redistributing polynomial factors can construct unexpected examples, but each resulting polynomial must have nonnegative integer coefficients, no constant term if labels must be positive, and value at . For example, reallocating from one copy of to the other gives face labels and .
Reduced forms of discriminant minus thirty-two Created 2026-10-14 Updated 2026-11-05
The reduced-form bound leaves . Checking and the boundary sign convention gives precisely the displayed forms. The middle one is imprimitive and represents the prime two. Odd represented primes are or modulo eight by the discriminant criterion for prime representation by a binary quadratic form. The first form represents only modulo eight among odd integers, and the last only , so a prime is represented by exactly when it is modulo eight.
Reduced fraction Created 2026-10-06 Updated 2026-11-05
A reduced fraction has coprime integers and positive denominator . Distinct reduced fractions with denominators at most differ by at least , since their difference has a nonzero integer numerator over a denominator at most .
Reduced positive definite binary quadratic form Created 2026-09-24 Updated 2026-11-05
An integral binary quadratic form with and negative discriminant of a binary quadratic form is reduced whenwith the additional convention whenever or . These inequalities bound the polynomial coefficients without changing the represented integers.
Every proper equivalence class of positive definite forms has exactly one reduced representative with this boundary convention. For primitive binary quadratic forms, this is the classical reduction theorem; the general case follows by dividing by the common content, which is invariant under proper equivalence.[ref]
Binary Quadratic Forms and the Ideal Class Group by Seth Viren Neel. §2.2, Definition 1 and Theorem 2.3, printed p. 5: primitive positive definite reduction and uniqueness
The sign rule removes actual duplicates. A shear takes to , and the determinant-one rotation takes to . Keeping the nonnegative middle polynomial coefficient chooses one boundary copy. For example, is not reduced; the reduction algorithm for a positive definite binary quadratic form takes it back to .
Reduction algorithm for a positive definite binary quadratic form Created 2026-10-03 Updated 2026-11-05
For a positive definite integral binary quadratic form with discriminant of a binary quadratic form , choose an integer so that lies in . The determinant-one shear givesThe last polynomial coefficient is also . If , use the determinant-one rotation to replace the form by , and repeat.
Each rotation strictly decreases the positive integer leading polynomial coefficient. Thus only finitely many rotations occur. At termination, . The chosen interval already gives when ; if and , one final rotation changes its sign. Every step preserves proper equivalence and the discriminant of a binary quadratic form, so this constructs a reduced positive definite binary quadratic form.
For example, start with , of discriminant of a binary quadratic form . Taking gives . Rotate to , then take again to obtain . The coefficients can shrink dramatically while the represented integers remain unchanged. Using a plain swap of variables would instead have determinant minus one; the sign in the rotation keeps every step proper.
Reduction map on unit groups Created 2026-09-24 Updated 2026-11-05
Reduction modulo an ideal of a commutative ring gives a group homomorphism . It need not be surjective: the units of do not lift the classes two and three in .
A useful sufficient condition is , the Jacobson radical. If , then is a unit by the unit criterion for the Jacobson radical, and consequently is a unit. Every invertible residue class then lifts.
For positive integers , reduction is always surjective. Start with a representative coprime to and use the Chinese remainder theorem to choose a congruent representative avoiding each additional prime dividing . This explicit integer result should be distinguished from unrestricted reduction in an arbitrary ring.
Reduction modulo one Created 2026-10-31 Updated 2026-11-05
For a real number , its reduction modulo one is its fractional partThe floor function is used, including at negative inputs: . Truncating toward zero would instead give , outside the required interval.
Two real numbers have the same fractional part exactly when their difference is an integer. Thus reduction chooses representatives for the quotient group , the circle group. Applied to two coordinates, it selects representatives in for a torus, obtained from a closed unit square by identifying opposite edges.
Reference parameter Created 2026-10-31 Updated 2026-11-05
A reference parameter designates the caller's actual storage. Assigning through it can change what the caller subsequently observes; passing a complete independent copy would instead change only the local copy. A value parameter containing an object reference is another case: copying that reference does not copy the referenced software object.
In Oberon, a variable parameter is marked
VAR and stands for the supplied actual variable. For example, a procedure accepting VAR x: INTEGER can increment the caller's integer through x.[ref]The Programming Language Oberon by Niklaus Wirth. revision 3 May 2016, sections 9.2 and 10.1, variable versus value parameters
A read-only algorithm can use a reference parameter to avoid copying a large array, while its formal specification still prohibits writes. Reference aliasing remains relevant: two parameters can designate overlapping storage. A proof of algorithm correctness must account for the actual aliasing rules rather than assume that different parameter names denote independent values.
Reflexive pair in an additive category is an internal groupoid Created 2026-09-28 Updated 2026-11-05
Let be a reflexive pair in an additive category with finite limits, with common section . Regard as source and as target. For arrows satisfying , defineThe identity at is , and the inverse of is . These operations define an internal groupoid. The finite limits hypothesis supplies the objects of composable arrows needed for the groupoid diagrams.
The source of the composite is , and its target is . The common-section identities prove both identity laws and both inverse laws. For a composable triple , either parenthesization gives , proving associativity. Bilinearity makes these formulas compatible with precomposition in .
The limit hypothesis cannot simply be discarded. Take the full subcategory of finite-dimensional vector spaces whose dimensions are , for nonnegative integers . A projection has a common section with itself, but its composable-pair pullback in a category in vector spaces has dimension , which is not of the allowed form. Testing the pullback in a category property on would force that same dimension, so the smaller category has no such pullback in a category. The reflexive-pair groupoid formula in a preadditive category still makes sense on generalized arrows without asserting existence of this object.
