Vanishing of infinitely divisible integer sequences Created 2026-10-25 Updated 2026-11-05
If an element of the module is divisible by every power of two within that module, then every coordinate is an integer divisible by every power of two. A nonzero integer cannot be divisible by , so each coordinate is zero and . This argument applies to any index set and to powers of any fixed integer with .
For coefficients supported on an interval of consecutive integers, set and . Then
The orthogonality of roots of unity gives . The distinct fractions have circular spacing at least ; now apply the exponential-sum large sieve.
Vaughan identity for the Möbius function Created 2026-10-07 Updated 2026-11-05
The displayed identity is exact for all positive integers and all positive cutoffs. Expand and use . The two truncated terms are short sums; the negative term is a type I sum over divisors at most ; the last term is a type II sum with both factor variables larger than a cutoff. This form of the Vaughan identity is specific to Möbius weights.
Veronese map Created 2026-09-29 Updated 2026-11-05
For an integer , the degree- Veronese map sends a projective point to all degree- monomials in its homogeneous coordinates:
Multiplying the original coordinates by multiplies every output by , so the map is well-defined on projective points. It is a closed immersion, given by the complete linear system of .
For , the formula is . Its image in the projective plane satisfies , a smooth plane conic. On the chart , the ratio recovers ; the chart recovers . The degree- construction similarly makes homogeneous degree- expressions into linear coordinates in a larger projective space.
Vinogradov mean-value method for a bilinear exponential sum Created 2026-10-06 Updated 2026-11-05
Expand moments of the inner sum and group equal power-sum differences. Their multiplicities are bounded by through the Cauchy-Schwarz inequality. Two applications of the Holder inequality yield a bound for containing and a product of short geometric-sum bounds over the moment differences. Thus a sharp mean-value estimate combines with rational approximation or spacing of the coefficients to prove cancellation. When all coefficients are integers, , so mean-value estimates alone cannot force cancellation.
Vinogradov's three-primes theorem Created 2026-10-14 Updated 2026-11-05
Every sufficiently large odd integer is a sum of three primes, with repetitions allowed. The weighted count is asymptotic to . Siegel–Walfisz theorem controls the major arcs, and Type I/II estimates for the prime exponential sum make the minor arcs negligible. Removing prime-power contributions gives genuine prime representations. This is the sufficiently-large theorem, not by itself a proof for every small odd integer.
Virtual character Created 2026-09-28 Updated 2026-11-05
A virtual character is an integer linear combination of characters, equivalently an element of the Grothendieck group of finite-dimensional representations.
Von Mangoldt function Created 2026-09-24 Updated 2026-11-05
The Von Mangoldt function assigns a natural logarithm weight to each positive power of a prime number. For a positive integer ,
Here and throughout the Chebyshev functions, means the natural logarithm. In particular, : the exponent must be positive, even though the convention in prime power allows exponent zero. The support of a function of therefore consists precisely of the prime powers greater than one. [ref]
For example, and , whereas . A composite number can have a nonzero weight: has just one distinct prime factor. But has two distinct prime factors, so its weight is zero. At the weight is , not . This choice lets successive powers record successive copies of the same prime factor in the Von Mangoldt divisor identity.
The Von Mangoldt function is useful because it connects two views of the prime numbers: the prime factorization of an individual integer, through a divisor sum, and the accumulated weights below a cutoff, through the second Chebyshev function. The latter turns questions about the distribution of prime numbers into questions about a partial sum of an arithmetic function.
Waveguide cutoff frequency Created 2026-10-14 Updated 2026-10-18
The waveguide cutoff frequency separates oscillatory axial propagation from exponential decay for a particular normal mode. For the vacuum-filled rectangular electromagnetic waveguide, the dispersion relation is
For a transverse electric mode of a rectangular waveguide, are nonnegative integers but not both zero. For a mode with and nonzero , both indices must be positive. The lowest cutoff for is consequently , or ordinary frequency .
A square cross-section instead gives equal and cutoffs. The absence of a transverse electromagnetic mode is specific to this hollow pipe, rather than all electromagnetic waveguides.[ref]
For , choose real for propagation toward . For , a field decaying into a semi-infinite guide has
A finite section can contain both growing and decaying axial solutions set by its two ends; the single decaying solution is not a complete finite-section transmission calculation. At exact cutoff , the two axial solutions become a constant and a linear function of : there is no finite axial wavelength for a traveling sinusoid.
In the chosen guide at , the branch has . Its amplitude decay length is ; after , its normalized wave amplitude is . This is geometric evanescence even with ideal walls, not Joule heating. A single decaying branch has zero cycle-averaged axial Poynting vector: substituting makes a quarter-cycle out of phase with . Coupling across a finite section requires the complete boundary-value solution.
Figure 1.
Original TE10 model: propagating dispersion above cutoff and spatial amplitude decay below cutoff
. The left panel uses and to plot . The secant slope is phase velocity divided by ; the tangent slope is group velocity divided by . The right panel is the single decaying branch at , not an experimental transmission curve or a curve for dissipated power. Details.
Wavevector selection rule for equivariant monomials Created 2026-10-14 Updated 2026-11-05
Consider complex Fourier modes transforming under a translation symmetry as . A monomial
transforms by multiplication with . It can occur in the equation for of an equivariant dynamical system only if
This follows because must transform with the same wavevector as . The condition enforces translation equivariance; other symmetries can impose additional restrictions on the polynomial coefficients.
Writing , a monomial with total polynomial degree and a prescribed integer vector exists exactly when and is an even integer. To prove this, write and with nonnegative integers . Then . Conversely, any nonnegative even surplus can be distributed among the .
For one nonzero wavevector, a cubic term in its own equation must have and , giving . With several Fourier modes, a relation instead permits the quadratic term in the third equation. The wavevectors decide whether this resonant interaction is possible before any polynomial coefficient is calculated.
A weakly linear partial function on the real numbers has a domain closed under rational scalar multiplication and addition, and it preserves addition on that domain. A nonempty domain is a vector space over the rational numbers, and additivity implies rational homogeneity of an additive function by integer multiplication and division. The empty function also satisfies the defining conditions vacuously. This terminology does not assert homogeneity under arbitrary real scalars.
WebAssembly 2026-11-05
WebAssembly is a portable, low-level code format with precisely specified execution and validation rules. Programs are organized into WebAssembly modules, often produced by compilation from another programming language. Its type system and stack machine semantics make operations explicit. Although designed with web applications in mind, the core format does not require a web browser.[ref]
Here is a small WebAssembly text format module exporting addition: (module (func (export "add") (param i32 i32) (result i32) local.get 0 local.get 1 i32.add)). The two local.get instructions put the arguments on the operand stack; i32.add consumes them and produces one 32-bit result. The function maps inputs 3 and 4 to 7.[ref]
Integer addition wraps modulo . For example, adding one to the bit pattern representing produces zero, rather than an arbitrarily large integer. This is a rule of the machine format, not a numerical approximation.[ref]
A WebAssembly module obtains external facilities through its host and imports. WebAssembly linear memory is a controlled memory abstraction, not unrestricted access to every host address. Validation and runtime checks provide specified boundaries, but they do not make every allowed computation harmless: an imported operation has the authority that the host gives it.
WebAssembly text format 2026-11-05
The WebAssembly text format is the readable textual encoding of WebAssembly modules. Parenthesized declarations describe the same structured program that can be encoded in binary. Symbolic identifiers such as $add help readers refer to definitions; numeric indices determine references in the underlying module.[ref]
For example, (module (func (export "add") (param i32 i32) (result i32) local.get 0 local.get 1 i32.add)) declares and exports a function accepting two 32-bit integers. The local.get instructions push its arguments onto the operand stack; i32.add consumes them and produces the result. Inputs 3 and 4 give 7. The folded instruction (i32.add (local.get 0) (local.get 1)) is an alternative notation for the same instruction sequence.[ref]
The parentheses of a folded instruction make operand grouping visible, but do not introduce a different arithmetic operation. Decoding either spelling yields the same instruction structure. Textual readability and runtime behavior are separate: indentation can help a human follow the WebAssembly module, while the declared types and instruction order govern execution.
Weighted Burnside lemma Created 2026-10-14 Updated 2026-11-05
Let a finite group act on a finite set , with an orbit-invariant weight in a commutative ring. Double counting gives the division-free identity
Indeed, each is counted times, and each orbit contributes copies of its common weight. If is invertible in , dividing gives the weighted average formula of Burnside's lemma. For formal monomial weights one can first count over the integers and then specialize into any commutative ring; this avoids dividing by zero in modular characteristic.
Weighted Gaussian theta sum of a complex lattice Created 2026-09-28 Updated 2026-11-05
For an even nonnegative integer ,
Poisson summation and the Fourier eigenfunction identity for give
Weighted voting game Created 2026-10-06 Updated 2026-11-05
A weighted voting game assigns nonnegative weights to players and a threshold , and declares a coalition winning when
Nonnegative weights make the rule monotone. The empty coalition loses, and the grand coalition wins when ; under that nontrivial condition this is a simple cooperative game.
If all weights are integers, the strict threshold is equivalent to the weak quota . It becomes quota when is itself an integer. This distinction matters for noninteger thresholds.
For example, three unit weights and give two-of-three majority. Nonnegative weights do not imply a convex cooperative game: , while , violating the supermodular inequality.
Weight lattice Created 2026-09-24 Updated 2026-11-05
The weight lattice is the set of vectors for which is an integer for every root .
Weil pairing Created 2026-09-24 Updated 2026-11-05
Let be an elliptic curve and an integer prime to the characteristic. The Weil pairing is the canonical perfect pairing
where the arguments are geometric -torsion points of an elliptic curve and is the group of th roots of unity. It is bilinear and alternating, so and . Perfection means that every nonzero first argument pairs nontrivially with some second argument.[ref]
It is compatible with the absolute Galois group: . For an isogeny and its dual isogeny, . In a torsion basis, alternation makes the action on the pairing equal to the determinant; hence the determinant of the torsion Galois representation is the cyclotomic character. In characteristic , the pairing on geometric -torsion points cannot have this same prime-to-characteristic interpretation: has only one geometric point.
A base case and a decreasing natural number measure work together. Check that every invocation satisfies its precondition, each base case finishes with the correct output, and every other invocation makes finitely many recursive calls with strictly smaller measure. All local work must also terminate. By well-founded induction, the children finish, so their caller finishes; if their answers are correct and the combination rule preserves the postcondition, the caller is correct too. This proves total correctness, not just correctness conditional on return.
Strict decrease without a lower bound is insufficient: subtracting one forever from a negative integer never reaches zero. Even a positive real-valued measure can decrease indefinitely, as shows. A well-founded relation rules out that descent. In structural recursion, a proper child subtree of a finite binary tree supplies progress without numeric arguments. The proof obligation is the relation between parent and child instances, together with terminating local work and complete base cases.
Well-ordering principle for the natural numbers Created 2026-10-07 Updated 2026-11-05
Every nonempty subset of the natural numbers has a least element in their usual order. Applying this principle to positive integer linear combinations proves Bézout's identity. This principle for the usual natural-number order is distinct from the general well-ordering theorem asserting that every set can be equipped with some well-order.