In algebra and number theory, a distribution is a function on a system of finite sets into an abelian group which is analogous to an integral: it is thus the algebraic analogue of a distribution in the sense of generalised function.
The original examples of distributions occur, unnamed, as functions φ on Q/Z satisfying [1]
Such distributions are called ordinary distributions. [2] They also occur in p-adic integration theory in Iwasawa theory. [3]
Let ... → Xn+1 → Xn → ... be a projective system of finite sets with surjections, indexed by the natural numbers, and let X be their projective limit. We give each Xn the discrete topology, so that X is compact. Let φ = (φn) be a family of functions on Xn taking values in an abelian group V and compatible with the projective system:
for some weight functionw. The family φ is then a distribution on the projective system X.
A function f on X is "locally constant", or a "step function" if it factors through some Xn. We can define an integral of a step function against φ as
The definition extends to more general projective systems, such as those indexed by the positive integers ordered by divisibility. As an important special case consider the projective system Z/nZ indexed by positive integers ordered by divisibility. We identify this with the system (1/n)Z/Z with limit Q/Z.
For x in R we let ⟨x⟩ denote the fractional part of x normalised to 0 ≤ ⟨x⟩ < 1, and let {x} denote the fractional part normalised to 0 < {x} ≤ 1.
The multiplication theorem for the Hurwitz zeta function
gives a distribution relation
Hence for given s, the map is a distribution on Q/Z.
Recall that the Bernoulli polynomials Bn are defined by
for n ≥ 0, where bk are the Bernoulli numbers, with generating function
They satisfy the distribution relation
Thus the map
defined by
is a distribution. [4]
The cyclotomic units satisfy distribution relations. Let a be an element of Q/Z prime to p and let ga denote exp(2πia)−1. Then for a≠ 0 we have [5]
One considers the distributions on Z with values in some abelian group V and seek the "universal" or most general distribution possible.
Let h be an ordinary distribution on Q/Z taking values in a field F. Let G(N) denote the multiplicative group of Z/NZ, and for any function f on G(N) we extend f to a function on Z/NZ by taking f to be zero off G(N). Define an element of the group algebra F[G(N)] by
The group algebras form a projective system with limit X. Then the functions gN form a distribution on Q/Z with values in X, the Stickelberger distribution associated with h.
Consider the special case when the value group V of a distribution φ on X takes values in a local field K, finite over Qp, or more generally, in a finite-dimensional p-adic Banach space W over K, with valuation |·|. We call φ a measure if |φ| is bounded on compact open subsets of X. [6] Let D be the ring of integers of K and L a lattice in W, that is, a free D-submodule of W with K⊗L = W. Up to scaling a measure may be taken to have values in L.
Let D be a fixed integer prime to p and consider ZD, the limit of the system Z/pnD. Consider any eigenfunction of the Hecke operator Tp with eigenvalue λp prime to p. We describe a procedure for deriving a measure of ZD.
Fix an integer N prime to p and to D. Let F be the D-module of all functions on rational numbers with denominator coprime to N. For any prime l not dividing N we define the Hecke operatorTl by
Let f be an eigenfunction for Tp with eigenvalue λp in D. The quadratic equation X2 − λpX + p = 0 has roots π1, π2 with π1 a unit and π2 divisible by p. Define a sequence a0 = 2, a1 = π1+π2 = λp and
so that
In mathematics, the gamma function is one commonly used extension of the factorial function to complex numbers. The gamma function is defined for all complex numbers except the non-positive integers. For every positive integer n,
In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann.
In mathematics, the Hurwitz zeta function is one of the many zeta functions. It is formally defined for complex variables s with Re(s) > 1 and a ≠ 0, −1, −2, … by
In mathematics, the Lerch zeta function, sometimes called the Hurwitz–Lerch zeta function, is a special function that generalizes the Hurwitz zeta function and the polylogarithm. It is named after Czech mathematician Mathias Lerch, who published a paper about the function in 1887.
In mathematics, the explicit formulae for L-functions are relations between sums over the complex number zeroes of an L-function and sums over prime powers, introduced by Riemann (1859) for the Riemann zeta function. Such explicit formulae have been applied also to questions on bounding the discriminant of an algebraic number field, and the conductor of a number field.
In functional analysis, a branch of mathematics, it is sometimes possible to generalize the notion of the determinant of a square matrix of finite order (representing a linear transformation from a finite-dimensional vector space to itself) to the infinite-dimensional case of a linear operator S mapping a function space V to itself. The corresponding quantity det(S) is called the functional determinant of S.
In number theory, the law of quadratic reciprocity, like the Pythagorean theorem, has lent itself to an unusually large number of proofs. Several hundred proofs of the law of quadratic reciprocity have been published.
In mathematics, holomorphic functional calculus is functional calculus with holomorphic functions. That is to say, given a holomorphic function f of a complex argument z and an operator T, the aim is to construct an operator, f(T), which naturally extends the function f from complex argument to operator argument. More precisely, the functional calculus defines a continuous algebra homomorphism from the holomorphic functions on a neighbourhood of the spectrum of T to the bounded operators.
In algebra, the Bring radical or ultraradical of a real number a is the unique real root of the polynomial
Axial multipole moments are a series expansion of the electric potential of a charge distribution localized close to the origin along one Cartesian axis, denoted here as the z-axis. However, the axial multipole expansion can also be applied to any potential or field that varies inversely with the distance to the source, i.e., as . For clarity, we first illustrate the expansion for a single point charge, then generalize to an arbitrary charge density localized to the z-axis.
In number theory, Ramanujan's sum, usually denoted cq(n), is a function of two positive integer variables q and n defined by the formula
In mathematics, the multiplication theorem is a certain type of identity obeyed by many special functions related to the gamma function. For the explicit case of the gamma function, the identity is a product of values; thus the name. The various relations all stem from the same underlying principle; that is, the relation for one special function can be derived from that for the others, and is simply a manifestation of the same identity in different guises.
In mathematics, the multiple zeta functions are generalizations of the Riemann zeta function, defined by
In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average".
In cryptography, Learning with errors (LWE) is a mathematical problem that is widely used in cryptography to create secure encryption algorithms. It is based on the idea of representing secret information as a set of equations with errors. In other words, LWE is a way to hide the value of a secret by introducing noise to it. In more technical terms, it refers to the computational problem of inferring a linear -ary function over a finite ring from given samples some of which may be erroneous. The LWE problem is conjectured to be hard to solve, and thus to be useful in cryptography.
In probability theory and directional statistics, a wrapped Cauchy distribution is a wrapped probability distribution that results from the "wrapping" of the Cauchy distribution around the unit circle. The Cauchy distribution is sometimes known as a Lorentzian distribution, and the wrapped Cauchy distribution may sometimes be referred to as a wrapped Lorentzian distribution.
Least-squares support-vector machines (LS-SVM) for statistics and in statistical modeling, are least-squares versions of support-vector machines (SVM), which are a set of related supervised learning methods that analyze data and recognize patterns, and which are used for classification and regression analysis. In this version one finds the solution by solving a set of linear equations instead of a convex quadratic programming (QP) problem for classical SVMs. Least-squares SVM classifiers were proposed by Johan Suykens and Joos Vandewalle. LS-SVMs are a class of kernel-based learning methods.
In statistics, the generalized Marcum Q-function of order is defined as
In complex analysis and geometric function theory, the Grunsky matrices, or Grunsky operators, are infinite matrices introduced in 1939 by Helmut Grunsky. The matrices correspond to either a single holomorphic function on the unit disk or a pair of holomorphic functions on the unit disk and its complement. The Grunsky inequalities express boundedness properties of these matrices, which in general are contraction operators or in important special cases unitary operators. As Grunsky showed, these inequalities hold if and only if the holomorphic function is univalent. The inequalities are equivalent to the inequalities of Goluzin, discovered in 1947. Roughly speaking, the Grunsky inequalities give information on the coefficients of the logarithm of a univalent function; later generalizations by Milin, starting from the Lebedev–Milin inequality, succeeded in exponentiating the inequalities to obtain inequalities for the coefficients of the univalent function itself. The Grunsky matrix and its associated inequalities were originally formulated in a more general setting of univalent functions between a region bounded by finitely many sufficiently smooth Jordan curves and its complement: the results of Grunsky, Goluzin and Milin generalize to that case.
In mathematics, infinite compositions of analytic functions (ICAF) offer alternative formulations of analytic continued fractions, series, products and other infinite expansions, and the theory evolving from such compositions may shed light on the convergence/divergence of these expansions. Some functions can actually be expanded directly as infinite compositions. In addition, it is possible to use ICAF to evaluate solutions of fixed point equations involving infinite expansions. Complex dynamics offers another venue for iteration of systems of functions rather than a single function. For infinite compositions of a single function see Iterated function. For compositions of a finite number of functions, useful in fractal theory, see Iterated function system.