Symmetric-group characters are integer-valued Created 2026-10-14 Updated 2026-11-05
The character of a Young permutation module counts fixed tabloids and is integer-valued. Dominance order on partitions makes its decomposition into Specht modules triangular with diagonal multiplicity one. Descending induction in any order refining dominance therefore expresses each irreducible Specht character as an integer combination of permutation characters, proving integrality.
Suppose nonzero algebraic numbers form a Galois-stable set, with Galois-invariant integer weights , and is an integer. Choose vanishing at all with , and a positive integer making all algebraic integers. For a large prime , put and , and let be the sum of its derivatives. The weighted sum is an integer, nonzero modulo when . If the displayed exponential expression vanished, integrating along the finitely many segments to would bound that nonzero integer by . This contradiction proves the obstruction and supplies direct proofs for and .
Symmetric residue summation Created 2026-09-24 Updated 2026-11-05
When a residue theorem argument encloses increasingly many poles, the resulting infinite sum needs a specified grouping and convergence justification. Symmetric summation means taking poles in matched groups, such as and , before sending the contour size to infinity.
The meromorphic function has a simple pole of residue at each integer . Its partial-fraction expansion is
The paired terms are uniformly on each compact set avoiding the poles, so the paired series converges absolutely and locally uniformly. The individual one-sided terms are only ; one cannot infer absolute convergence from the unpaired expression.[ref]
This example separates two mechanisms: symmetry can improve the decay of a pair, while alternating signs can permit conditional convergence. Neither mechanism licenses arbitrary regrouping of an unproved infinite residue sum.
For a group of Euclidean isometries, every element preserves the displayed union of images of a set, because left multiplication permutes its group indices. Its full setwise isometry group can be larger even when itself has no nonidentity symmetry. Take to be the integer translations of the plane and . By rigidity of a scalene triangle, has trivial stabilizer subgroup. Yet , whose quarter-turn about the origin is a symmetry outside the translation group.
Syndetic set Created 2026-10-14 Updated 2026-11-05
A subset is syndetic if it has bounded gaps: some positive integer makes every block meet . The quantifier applies at every integer location, including negative ones. A corresponding one-sided definition uses and nonnegative starting locations.
For example, the even integers are syndetic with , while the positive perfect squares are not: the gap between and is and grows without bound. In a one-sided syndetic set, partitioning the first integers into blocks of length gives at least elements, so its lower asymptotic density is at least .
Positive lower density alone does not ensure bounded gaps. Remove from each block for . The removed blocks have unbounded lengths, but at most removed points lie below . The remaining set has asymptotic density one and is not syndetic. Thus a condition on every interval is stronger than a condition on the long-run proportion.
Tail probability Created 2026-10-03 Updated 2026-10-14
For a real random variable , an upper-tail probability has the form and a lower-tail probability has the form . Each is the probability of an event lying beyond a chosen threshold in one direction. A tail probability need not be small: the threshold determines how much of the probability distribution it includes. A concentration inequality bounds such probabilities, often for deviations from an expected value.
Endpoint conventions matter. Write for the cumulative distribution function and . The complement rule of probability gives four distinct formulas:
The strict upper-tail convention is the survival function . Its value differs from the inclusive upper tail probability by exactly the probability mass at the threshold:
A singleton with positive probability mass is an atom of a measure. Thus excludes an atom of a measure at , whereas includes it. These endpoint identities follow directly from the cumulative distribution function properties in Kyle Siegrist, Distribution and Quantile Functions: endpoint probabilities and right tails.
As the threshold increases, both upper tail probabilities are nonincreasing functions. The strict survival function is a right-continuous function; the inclusive upper tail probability takes the upper endpoint value at a downward jump, equal to the left limit of the survival function. Both tend to zero as for a real random variable, but the speed of that decay differs across probability distributions. The cumulative distribution function properties and their proof from continuity of probability measures are given in MIT 6.436J, Lecture 4: random variables and cumulative distribution function properties.
For a fair six-sided die , the discrete uniform distribution assigns probability mass to each of . At threshold four,
Between four and five, both upper tail probabilities equal . At the largest possible outcome the distinction is especially visible: , but . The diagram shows exact probabilities for this mathematical model; its dots specify which endpoints belong to each step function.
Figure 1.
Exact fair-die probabilities: including or excluding a threshold changes the tail by one atom
. Details.
If a probability distribution has a probability density function , then every singleton has zero probability mass and
For an exponential distribution of rate two, for and zero otherwise, so for and for . Hence . This tail probability is an integral of the probability density function, not its height . A mixed probability distribution retains endpoint jumps even with a smooth component: give zero probability mass and choose this exponential distribution with probability . Then , , and for .
A two-sided tail probability can measure the absolute value of displacement from a specified center . For , the two extreme events are disjoint events, so
For strict displacement , replace the last expression by . The condition prevents overlap; at adding inclusive tails double-counts any probability mass at . For a uniform distribution on , take and : the two tail probabilities are each and their sum is . Equal tails follow from this symmetric probability distribution, not from the phrase two-sided alone; for a uniform distribution on with , the two tail probabilities are zero and .
The tail-sum formula for expectation turns a whole curve of tail probabilities into an expected value. For any nonnegative random variable , without assuming a probability density function or a finite expected value,
For a proof outline, write pointwise and exchange the expected value and Lebesgue integral using Tonelli theorem; is an indicator function. The inclusive version has the same Lebesgue integral: positive probability masses occur at only a countable set of thresholds, which has Lebesgue measure zero. For a nonnegative integer-valued random variable , the tail-sum formula instead gives . The integer hypothesis is essential for these sums. The integral identity, its indicator function proof, and the integer version appear in Kyle Siegrist, Additional Properties of Expected Value: integration and summation of right tails.
For the fair die, this tail-sum formula yields , equal to the direct weighted arithmetic mean . For the rate-two exponential distribution, the area under the survival function is , its expected value. The first panel below shades an integral of the probability density function for a single threshold; the second shades an integral of the survival function across all nonnegative thresholds. These are analytical illustrations, with the displayed curves truncated at three; their exact total areas use an infinite integration range.
Figure 2.
Exponential model: one tail probability is density area, while expectation is total survival area
. Details.
Nonnegativity is essential to interpreting the upper tail probability area as : for a general real random variable that area equals the expected value of its positive part. An integrable random variable satisfies , subtracting the expected value of its negative part; infinite terms cannot be canceled. Even when is finite almost surely, its expected value can be infinite. For the shape-one Pareto distribution on , on and for , so the area is . The finite versus infinite expected value distinction is illustrated in Kyle Siegrist, Definitions and Basic Properties: exponential and Pareto expected values.
Why are tail probabilities useful? They answer threshold questions directly, and a concentration inequality can bound them without knowing the full probability distribution. For nonnegative with finite expected value, Markov inequality gives for : a large threshold relative to the expected value forces rarity. The quantile function reverses the question by choosing a threshold for a prescribed cumulative level. If with , then ; an atom of a measure may prevent equality. For the die, , with strict upper tail probability zero and inclusive upper tail probability .
A tail probability describes rarity under a specified probability distribution; it is not automatically a conditional probability after extra information. For with ,
because the threshold events are nested. Thus the die has but . Conditioning changes the sample space and renormalizes its probability measure; the same extreme outcomes can become common in that restricted population.
Tail-sum formula Created 2026-09-24 Updated 2026-10-18
The tail-sum formula expresses an expected value as the area under a survival function. For every nonnegative random variable ,
This Lebesgue integral and the expected value may both be ; a probability density function is unnecessary. For a random variable taking values in the nonnegative integers, the corresponding sum is
The events and coincide because takes integer values. Thus the strict sum starts at zero, while the inclusive sum starts at one.[ref]
For an original example, let the probability mass function of be
Its expected value computed directly is . The strict tail probabilities at thresholds are : their sum is again . There is no probability mass at two, yet the event still has probability . The survival function has heights on the successive intervals ; each interval has length one, so its integral is the same sum.
Figure 1.
The same expected value from probability masses and survival columns
. The exact constructed probability mass function assigns to . The contribution appears in one survival column, while the contribution appears in three. Filled endpoints give the strict survival function at its jumps; open endpoints show the preceding height. The shaded area is . Details.
The indexing matters numerically. Starting the inclusive sum at zero adds , giving for this example. Starting the strict sum at one omits , giving . For a general nonnegative random variable, replacing with inside the integral is harmless: the difference is , nonzero at only a countable set of thresholds. For each positive integer , at most thresholds can have probability mass at least ; their countable union contains all thresholds with positive probability mass and has Lebesgue measure zero. This reasoning concerns an integral, not equality of the two survival function conventions at every point.
For a continuous original example, take the uniform distribution on the interval . Its survival function is for and zero for . The area is a triangle of base four and height one:
Directly integrating against the probability density function gives the same expected value, . The integral of the probability density function alone is one; it is the survival function whose area is the expected value.
Figure 2.
A uniform density has total probability one and survival area two
. Exact curves for the uniform distribution on . The probability density function has integral one, while the survival function has integral two. Splitting the survival area at gives before the cap and beyond it, the expected values of and the positive part , respectively. Details.
The proof counts layers of each outcome. For a realized value , the indicator function equals one over an interval of length , so
Tonelli theorem permits the interchange because the indicator function is nonnegative; no finite expected value is assumed. Similarly, an outcome contributes one indicator random variable for each of the events that occur:
Again Tonelli theorem applies to the nonnegative sum, or equivalently the monotone convergence theorem applies to its partial sums. This exchanges counting layers within each outcome with averaging across outcomes. The existing integer-valued hypothesis in the tail-sum formula explains what changes when the values are not integers; the tail integral formula for moments weights the layers to obtain higher moments.
For an integrable random variable that can have either sign, apply the nonnegative formula separately to its positive part and negative part :
Integrability makes both integrals finite. More generally the difference defines an extended expected value when at least one is finite; if both are infinite, subtraction does not define an expected value.[ref]
Tail probabilities are often easier to measure or bound than a whole probability density function. For a device's survival time, the survival function records the probability of still operating at each threshold; its integral gives the mean operating time. A finite observation window naturally gives the expected value of a capped nonnegative random variable. For a mathematical bound, for all implies . The tail-sum formula turns control of a whole family of events into control of an average.
For a smooth real function satisfying the displayed equation with positive integer , differentiating makes . On any compact interval, all derivatives are therefore bounded by the maximum of the bounds of . The Taylor formula with integral remainder consequently has error at most , which tends to zero uniformly for . Hence the function equals its globally convergent Taylor series. For and initial derivatives , it is .
Tensor-nilpotent module Created 2026-09-24 Updated 2026-11-05
An -module is tensor-nilpotent when for some positive integer . A nonzero finitely generated module cannot be tensor-nilpotent: localize at a maximal ideal in its support and reduce modulo that maximal ideal, obtaining a nonzero tensor power of a nonzero vector space.
Terminating decimal Created 2026-10-14 Updated 2026-11-05
A terminating decimal is a decimal representation with only finitely many nonzero fractional numerical digits. For a reduced fraction with , this occurs exactly when every prime factor of is or .
If the representation terminates after fractional digits, write for an integer . Since are coprime integers, divides . This proves necessity. Conversely, if , choose . Then , making an integer and giving a finite representation.
For example, because divides . The reduced fraction has a denominator factor , so its decimal representation cannot terminate. A zero tail is distinct from a nonzero repeating block; the latter is measured by decimal period from multiplicative order.
Ternary quadratic form Created 2026-10-03 Updated 2026-11-05
A ternary quadratic form is a quadratic form in three variables. A diagonal integral example is with integer coefficients .
Tetration 2026-10-20
Repeated exponentiation with right association: and . For example, , rather than . Computing its remainder modulo an integer often uses a chain of smaller exponent moduli; applying Euler's theorem requires checking its coprimality hypothesis at every level.
The first-order theory of a bijection with named inverse and no finite cycles has first-order models consisting of disjoint integer orbits. Atomic logical formulas reduce to for integer . An existential logical variable is either fixed by such a logical equality or must avoid finitely many points. This proves quantifier elimination and completeness. There is one complete one-type; the complete two-types are the integer offsets and the nonprincipal different-orbit partial type. There are countably many finite-arity partial types but countable first-order models with different numbers of orbits are not isomorphic.
In the first-order language of logical equality, assert that there are at least elements for every positive integer . Eliminating one existential logical variable either substitutes a logical equality or avoids finitely many points, so this first-order theory has quantifier elimination and is complete. It is categorical in every infinite cardinal. Its complete -types are the logical equality partitions of coordinates and are counted by the Bell numbers.
Theta function Created 2026-09-24 Updated 2026-11-05
A theta function is formed by summing an exponential quadratic expression over a Euclidean lattice. A basic one-dimensional example, in period-one spatial normalization, is
[ref]
Gaussian decay gives local uniform convergence, so it is an entire function of and a holomorphic function of . Its value at is the Jacobi theta function in the convention:
The theta function with characteristics shifts the summation lattice and its phase; evaluating at gives a theta constant.
These sums translate geometric counting into analytic functions. The coefficient of in counts ordered integer -tuples with sum of squares . For instance, the coefficient of in the square is , from and . Poisson summation relates the sum over a Euclidean lattice to the sum over its dual lattice, producing the lattice theta functional equation. Termwise differentiation also gives the heat equation for theta functions with characteristics. These connections explain the role of theta functions in modular forms, Euclidean lattice geometry, and diffusion.
Theta function with characteristics Created 2026-10-14 Updated 2026-11-05
For real characteristics and , Gaussian decay gives normal convergence, an entire function of and holomorphic dependence on . Integer shifts of alpha leave the function unchanged; a unit shift of beta multiplies it by . Its spatial quasi-periods are and . Binary characteristic labels often mean alpha and beta divided by two, so the convention must be stated.
Three-dimensional lens space as a circle bundle Created 2026-10-03 Updated 2026-11-05
For an integer , the diagonal quotient is the unit circle bundle of a complex line bundle over whose Euler class is times a generator. Its Gysin sequence gives
while for prime , for .
Thue–Morse sequence Created 2026-10-14 Updated 2026-10-20
Here is the sum of the binary digits of the nonnegative integer . The sign version is . Concatenating binary digits gives for . It supplies cancellation controlled by binary blocks rather than multiplicative factorization.
Thue-Siegel auxiliary polynomial Created 2026-09-24 Updated 2026-11-05
For an algebraic number of degree and a small , Siegel lemma constructs integer polynomials of degree at most and exponentially bounded coefficients for which has a zero at of order close to . A Wronskian then prevents every specialization from having a high-order zero at a rational point. This is the auxiliary-polynomial mechanism in the Thue-Siegel method.
Topological degree Created 2026-09-24 Updated 2026-11-05
For a continuous map between connected closed oriented manifolds of the same positive dimension , the topological degree is the integer determined by
The chosen fundamental classes fix the signs. This homology definition makes sense without differentiability and is invariant under homotopy. For spheres, it is the integer by which the induced map multiplies their top homology group.[ref]
If is smooth and is a regular value, the finite preimage gives
where the sign compares the chosen orientations in source and target. Thus opposite local signs can cancel: topological degree is a signed count, rather than the number of preimages.
For the circle map , with and an integer, the topological degree is . An orientation-reversing reflection has topological degree , while a constant map has topological degree zero. A nonzero topological degree forces surjectivity; a homotopy between continuous maps preserves their topological degree.