Topological generator Created 2026-10-14 Updated 2026-11-05
A single topological generator of a topological group is an element whose cyclic subgroup is dense:
More generally, a tuple consists of topological generators when the subgroup they jointly generate is dense. Membership in such a tuple does not imply that one element alone generates densely.
In the additive group of p-adic integers, the element one is a topological generator: ordinary integers surject onto every finite quotient . The element generates only the proper closed subgroup . The profinite group has a two-element topological generating set but no single topological generator, since its quotient is not cyclic. [ref]
Topological mixing Created 2026-10-31 Updated 2026-11-05
A continuous map is topologically mixing if for every pair of nonempty open sets , there is an integer such that for every . By comparison, topological transitivity asks only for some hitting time for each pair.
For the full tent map, every open interval contains a sufficiently small branch interval of an iterate. That iterate maps the branch across the whole unit interval. Every later image still contains the whole interval, so it meets every nonempty open . This proves mixing and illustrates why a uniform tail of hitting times is stronger than a single possible visit.
Mixing here describes how open sets overlap under a deterministic map. It is a topological property; a statement about decay of correlations for a specified invariant probability measure is a separate measure-theoretic assertion.
Toric divisor Created 2026-09-24 Updated 2026-11-05
Every toric ray of a normal toric variety determines a torus-invariant prime Weil divisor . An invariant toric toric divisor is an integer combination .
Such a toric divisor is Cartier exactly when each toric cone admits a algebraic torus character satisfying
Then the corresponding local algebraic torus character sections trivialize its divisor line bundle. Without this integral local condition, the toric divisor gives a divisorial rank-one reflexive sheaf and need not define a line bundle. The positive class generator of , for example, has Cartier index two. Thus an arbitrary combination of invariant prime toric divisors must not be silently identified with invertible-sheaf data.[ref]
For a module over an integral domain , a torsion element is an with for some . This includes zero. Equivalently, its annihilator is a nonzero ideal. The torsion elements of a module form the torsion submodule.
For , computed annihilators are
For these three elements, the additive order of a group element is respectively , , and : these are the smallest positive integers killing them. Torsion over agrees exactly with finite additive order of a group element. Over a general integral domain, torsion concerns the chosen scalars instead; the polynomial module from a linear operator gives a torsion example whose nonzero elements have infinite additive order of a group element.
Torsion-free abelian group axiom scheme Created 2026-10-31 Updated 2026-11-05
For an abelian group, the scheme for every positive integer expresses absence of nonzero elements of finite order. Each fixed gives one sentence, while the entire scheme expresses the torsion-free abelian group property.
Torsion-free cancellative commutative monoid Created 2026-10-06 Updated 2026-11-05
A cancellative commutative monoid is torsion-free in this sense when implies for every positive integer . Its Grothendieck group is then a torsion-free abelian group, because forces . This is the condition inherited by a submonoid of a torsion-free abelian group.
Torsion-free divisible Abelian group Created 2026-10-06 Updated 2026-11-05
A divisible Abelian group is torsion-free precisely when division by each nonzero integer is unique. Defining rational scalar multiplication by identifies these groups with vector spaces over the rational numbers, including the zero space.
Torsion-free module Created 2026-09-24 Updated 2026-10-14
A module over an integral domain is torsion-free when with implies , equivalently when its torsion submodule is zero. Every free module over an integral domain is torsion-free, as one can check in each coefficient. Every vector space is torsion-free over its scalar field.
The converse requires hypotheses. A finitely generated module over a principal ideal domain is free if it is torsion-free, but the module over is torsion-free and not free. Any two nonzero rational numbers have a nontrivial integer relation, so a possible basis of a module could have at most one element; no single generates all rational numbers, since for . The finite-generation hypothesis cannot be dropped. See Keith Conrad's Modules over a PID, Corollary 2.6.
Torsion module Created 2026-09-29 Updated 2026-10-14
A torsion module over an integral domain is a module in which every element is a torsion element of a module. Each element may require a different nonzero annihilating scalar. The module is torsion over , and the polynomial module from a linear operator is torsion over .
If the torsion module is a finitely generated module, one common nonzero scalar kills the whole module: multiply annihilating scalars for a finite generating set. Without finite generation this can fail. The quotient module is torsion, since the class of is killed by , but no nonzero integer kills it all: the class of survives multiplication by . See Keith Conrad's Modules over a PID, exercise 6.5(c).
Torsion subgroup killed by an integer Created 2026-10-14 Updated 2026-11-05
For an abelian group and an integer , its -torsion subgroup is , the kernel of multiplication by . In a finite abelian group, every nonempty fiber of this homomorphism has cardinality , so . This follows directly: if , then , and conversely translating by an element of leaves the image unchanged. On the cyclic group , the solutions of number ; divide both integers by their greatest common divisor to see that must be a multiple of .
Torsion submodule Created 2026-09-29 Updated 2026-10-14
For a module over an integral domain , its torsion submodule is
This is a submodule. If and with , then and ; also for every . The integral domain hypothesis supplies both the nonzero product and commutativity. These are the conventions of [ref].
A mixed example is the direct sum . If a nonzero integer kills , then . Conversely, kills every . Thus
The torsion submodule isolates the finite-order part while the quotient module keeps the independent integer directions. In general is a torsion-free module: if with , some kills , so kills .
The hypothesis matters. In the ring viewed as a module over itself, the elements and are killed by nonzero scalars and , but their sum is a unit and is killed by no nonzero scalar. Thus using arbitrary nonzero scalars in a ring with zero divisors need not give a submodule. A common broader convention uses regular elements of a ring as annihilators; the integral domain convention here avoids that ambiguity.
Total correctness 2026-10-18
Total correctness requires partial correctness and algorithm termination for every program state allowed by the precondition. For a deterministic sequential program, every permitted start must reach a final program state satisfying the postcondition after finitely many steps. Thus an infinite execution can satisfy partial correctness, but refutes total correctness for a permitted start.
In the summation loop verification, the loop invariant establishes the answer conditional on exit, and the loop variant establishes exit. Both parts matter: replacing the body by a step that never returns would defeat total correctness even if every completed iteration preserved the loop invariant. Likewise, a terminating loop with the wrong sum fails partial correctness and therefore fails total correctness.
These obligations depend on the formal specification. A program that rejects every input might correctly implement a rejection service, but does not meet a contract promising a sum for every nonnegative integer. A proof of total correctness also gives no particular physical response-time guarantee: time complexity and the execution environment require their own assumptions.
Total number of prime factors Created 2026-10-06 Updated 2026-11-05
The total number of prime factors counts every occurrence of a prime factor in the prime factorization of a positive integer . Equivalently, it adds the prime valuations:
One may also write over all prime numbers, since only finitely many prime valuations are nonzero. The empty sum gives . By contrast, the prime omega function has and counts distinct prime factors. [ref]
Expanding into shows , whereas and . The same calculation for the comparison examples gives
The total number of prime factors agrees for and , although their prime supports of an integer differ. Meanwhile and have the same radical of an integer and prime omega function, but different values of the total number of prime factors. These examples show exactly which information each arithmetic function forgets.
Figure 1.
One box per prime factor occurrence: the total number of prime factors counts boxes, the prime omega function counts groups, and the radical of an integer multiplies one prime number from each group
. Details.
The total number of prime factors is a completely additive arithmetic function:
The proof is that multiplication adds each prime valuation, , and summing preserves that equality. No coprimality condition is needed. For example, and both have total number of prime factors three; their product has six. By comparison, the prime omega function is only an additive arithmetic function: here .
There is a useful way to see the total number of prime factors as a count of elementary building blocks: any expression of as a product of prime numbers has exactly factors, by the fundamental theorem of arithmetic. Equivalently, every factorization tree for has leaves. Repeated prime factors increase this count without introducing new kinds of prime number. The difference is the existing excess prime-factor multiplicity:
Every summand is nonnegative, so if and only if is a squarefree integer, including . In particular, a prime power with has , and .
Historically, Hardy and Ramanujan's 1917 paper explicitly separated the prime omega function from the total number of prime factors, writing them as and , respectively. Their example has counts three and six. That distinction let them compare two measures of how an integer is built from prime factors. [ref]
Totient divisibility along divisors Created 2026-10-14 Updated 2026-11-05
Write and , with . The prime-power formula for the Euler totient function gives an integer contribution to from each prime: it is when , and when . Multiplying proves the divisibility assertion, including with .
Totient divisor-sum identity Created 2026-10-14 Updated 2026-11-05
The divisor sum of Euler's totient function is the identity arithmetic function:
Equivalently, under Dirichlet convolution, with the constant-one arithmetic function. [ref]
To see why, group the integers by . Each is a positive integer divisor of . Within its group, with and , by the scaling identity for greatest common divisors. Dividing by gives a bijection with the integers counted by . The groups form a partition of a set, so
For , the groups with greatest common divisor are respectively . Their sizes are , totaling . Möbius inversion reverses this divisor sum to recover Euler's totient function from .
Trace and odd columns in symmetric RSK Created 2026-10-14 Updated 2026-11-05
For a symmetric nonnegative integer matrix, the two neighboring prefix shapes along the diagonal are equal. In the RSK growth-diagram local rule, set and take alternating sums of row lengths. The two occurrences of the alternating sum of cancel, leaving . Induction along the diagonal proves the formula. Each column contributes one to this alternating sum exactly when its length is odd.
Transcendental number Created 2026-09-24 Updated 2026-11-05
A transcendental number is a complex number that is not an algebraic number. No nonzero polynomial with coefficients in the integers vanishes at it. Familiar examples are and ; proving their transcendence requires substantially more than proving their irrationality.
There are only countably many integer-coefficient polynomials, and each nonzero one has finitely many roots. Consequently the algebraic numbers are countable, while the real numbers are uncountable; transcendental real numbers therefore exist in abundance. This counting proof establishes existence without identifying a particular example. Every real transcendental number is an irrational number, but shows that the converse fails.
For an integrable periodic function of period , its integral over an interval of length is independent of the starting point. Write with an integer and . By a change of variables and the defining identity of a periodic function,
No differentiability is required. This also allows the Fourier coefficients of a periodic function to be computed on any interval of one full period.
Translation invariants of Fourier-mode phases Created 2026-10-14 Updated 2026-11-05
Let a translation symmetry with displacement act on nonzero complex Fourier modes by
Each phase changes by . Therefore a real linear combination of locally unwrapped phases, , is unchanged exactly when . This is a kernel of a linear map calculation for the matrix whose columns are the wavevectors.
A globally defined expression on angular phases requires more care: is independent of the representatives chosen modulo precisely when every is an integer. The globally defined translation-invariant characters therefore satisfy both and . An arbitrary real vector in the matrix's kernel of a linear map gives a local unwrapped invariant, but need not give a single-valued function of the angular phases.
For example, take four planar wavevectors , , and . The two independent angular combinations are and , each interpreted modulo . Translations can set the first two phases to zero; the other two then equal these combinations.
More generally, when four planar wavevectors span a common reciprocal lattice of rank two, their translation action has a closed two-dimensional torus as its image and the quotient of the four-phase torus is two-dimensional. Real rank two alone guarantees only two local independent combinations; without a commensurability condition, the translation image can be dense in a larger torus. At zero amplitude, a phase is undefined, so smooth centre manifold equations should first use real parts and imaginary parts of the complex amplitudes.
Trial division 2026-10-14
Trial division searches for divisors of an integer by testing candidate divisions. For primality testing of an integer , testing the prime numbers up to suffices: any composite number has a prime factor in that range. After finding a prime factor, repeated division removes its prime power, and testing the remaining quotient gives an elementary integer factorization method. This is useful for small inputs, but the number of candidates can grow rapidly with the input's digit count.