Period-two martingale corrector for a birth-death chain Created 2026-10-14 Updated 2026-11-05
For a birth-death chain on the integers with right/left probabilities depending on parity , define . It is a harmonic function for a Markov chain exactly when
equivalently . The correction is bounded. Stopping this martingale at boundaries gives a lower exit Probability tending to as , even though the original position need not be a Martingale.
// Target: markov-process.bigb
Permanent (mathematics) Created 2026-10-14 Updated 2026-10-20
The permanent of a matrix adds the products obtained by choosing one entry in each row and one in each column. For an matrix with entries in the real numbers or complex numbers,
Here each permutation chooses column in row , and the symmetric group lists every such bijection. The formula resembles the Leibniz formula for determinants, but omits the sign of a permutation. For a two-by-two matrix,
The absence of alternating signs makes the permanent of a matrix particularly useful for counting allowed assignments.
For a zero-one matrix, let rows represent people, columns represent jobs, and mean that person can do job . This is the biadjacency matrix of a bipartite graph. A product in the permanent is one exactly when all the selected assignments are allowed; otherwise it is zero. Each surviving permutation assigns every person a different job, which is a perfect matching. Thus the permanent counts perfect matchings. This interpretation and the definition are given in Yufei Zhao, Probabilistic Methods in Combinatorics, §10.2, pp. 178–179.
For a fully enumerated example, take
Among the six permutations of three columns, exactly three give nonzero products: , and . These tuples list the chosen column in each successive row. Each product is one, so . Their permutation signs are , giving . The diagram displays all three allowed assignments.
Figure 1.
Three allowed one-to-one assignments contribute positively to the permanent, while their permutation signs give a determinant of minus one
. Details.
A zero determinant need not mean that no assignment exists. The two-by-two all-ones matrix has permanent and determinant : its two assignments cancel in the determinant. The nonzero determinant criterion for a perfect matching is sufficient for existence, but the converse fails for a fixed zero-one matrix.
For nonnegative entries, the permanent instead sums assignment weights, with each assignment weighted by the product of its selected entries. It is then a total weight rather than necessarily an integer count. With arbitrary entries in the real numbers or complex numbers, even the permanent can have cancellation; the counting interpretation specifically uses zero-one entries. The permanent as probability of distinct independent choices gives another useful nonnegative interpretation.
There are terms in the defining sum, linking direct evaluation to the factorial. For the all-ones matrix, every term is one and the permanent is exactly ; the identity matrix has permanent one. Finding one allowed assignment and counting all allowed assignments are different questions. Their relationship to computational complexity theory was studied in L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science 8(2), 189–201, 1979. The elementary sum is useful for small examples, while the existing dense permanent approximation describes a more specialized way of estimating large counts.
For a dividend-free Black-Scholes model with , , and positive integer , the optimal stopping value of the power put option is
In the continuation region the stationary Black-Scholes equation has powers and . Boundedness at infinity removes . Value matching gives the coefficient , maximized at the displayed ; equivalently this is the smooth fit boundary.
For a verification beyond constant-trigger policies, let . The maximum property of gives . For the infinitesimal generator , above . Below , set ; then
The candidate is continuously differentiable across , so the generalized Itô formula has no derivative-jump local time of a semimartingale term. The discounted candidate is a nonnegative supermartingale, bounding every stopping reward by optional stopping. First hitting of attains the bound; the remainder at infinite time vanishes since and . For this recovers the perpetual put option. At the value is for , approached but not attained at a finite exercise time. At the perpetual value is infinite, because exercise at deterministic times tending to infinity has unbounded discounted expected value.
Perron's formula Created 2026-10-14 Updated 2026-11-05
Perron's formula recovers coefficient partial sums from a Dirichlet series by the Mellin inversion formula. Suppose is absolutely convergent at a fixed real . For ,
The prime on the sum means that the term with receives weight if is an integer; for noninteger it is the ordinary sum over . The integral is taken as a symmetric vertical limit, not asserted absolutely convergent on the infinite line.
The scalar truncated Perron kernel estimate tends to when , to when , and to when . Absolute convergence on the line allows the coefficient sum to be interchanged with the finite integral and justifies passing to this limit. In analytic number theory, one then shifts the contour through poles and past controlled singularities: their residues supply main terms and error terms in the summatory function. The truncated Perron formula makes the finite-height error explicit.
Phigital number Created 2026-10-20 Updated 2026-11-05
A phigital number is a number represented using golden ratio base, with digits weighted by powers of . The word describes the representation rather than a separate kind of arithmetic object.
For example, . Since , distinct strings can represent the same value unless a normalization convention is imposed. Finite phigital expansions belong to , because , so even negative powers can be reduced to integer combinations of .
Pierre de Fermat Created 2026-10-13 Updated 2026-11-05
Pierre de Fermat (1601–1665) was a lawyer and government official whose mathematical work helped shape number theory, early calculus and probability. His 1654 correspondence with Blaise Pascal on games of chance helped turn questions about fair division of stakes into systematic probability calculations.[ref]
Fermat's little theorem states that for a prime number and an integer ; it gives a reusable arithmetic relation, not a guarantee that every number satisfying one modular test is prime. Fermat's last theorem is the separate assertion that has no positive-integer solution for . The two statements illustrate the range of his arithmetic questions and must not be conflated with one another or with a proof of the latter assertion by Fermat himself.
Figure 1.
Portrait of Pierre de Fermat
. Rolland Lefebvre (1608–1677); portrait in Musée des Beaux-Arts de Narbonne; reproduction via source listed on Commons. Public domain (life-plus-100, pre-1931 U.S. publication) and faithful reproduction / PD-Art. Source and usage information on the linked Wikimedia file page. Source.
Pigeonhole principle Created 2026-09-24 Updated 2026-10-18
Place objects into boxes, assigning each object to exactly one box. Here is a nonnegative integer and is a positive integer. The pigeonhole principle says that if , some box contains at least two objects. Equivalently, a function from an -element finite set to an -element finite set cannot be an injective function when . The boxes may stand for categories rather than physical containers. [ref]
For thirteen objects and twelve boxes, a box containing at least two is unavoidable. Thinking of thirteen people and their birth months gives the same conclusion: at least two share a birth month. Twelve people could occupy the twelve months one apiece, so thirteen is the smallest number that forces a shared month. The generalized pigeonhole principle quantifies how many objects must share a box when there are still more objects.
The useful surprise is that the pigeonhole principle proves existence without needing to locate the objects involved. Choosing a good assignment rule is often the creative step: equal labels can mean equal remainders, nearby points, or repeated states of an algorithm. Once the rule is chosen, a short count can force a relationship among a much larger collection of objects. The pigeonhole principle itself does not name the crowded box. When the objects and their assignments are explicitly available, a simple algorithm finds one: scan the objects, keep the first object seen in each box, and stop when a later object enters an occupied box. At most scanned objects are needed when .
A geometric example. Any five points in a square of side one contain two whose Euclidean distance is at most . Give each point Cartesian coordinates . Divide both ranges into the intervals and , making four cells. Thus belongs to the left half and to the right half; belongs to the lower half and to the upper half. This convention assigns every boundary point to exactly one cell.
The pigeonhole principle puts two of the five points in the same cell. Their differences in Cartesian coordinates have magnitude at most , so the Pythagorean theorem gives their Euclidean distance the bound
For the plotted points , , , and , the first two occupy the lower-left cell and have Euclidean distance . These Cartesian coordinates exhibit the forced pair; the argument applies to every placement of five points.
Figure 1.
The pigeonhole principle places two of five points in one of four cells of a square, bounding their Euclidean distance by
. Details.
An arithmetic example. Assign eight integers to their seven residue classes modulo the integer modulus . The pigeonhole principle gives two with the same residue class, so is an integer divisor of their difference. In , for example, and satisfy the integer congruence , and . Likewise, assigning fractional parts to short intervals gives the Dirichlet approximation theorem; its existing article explains the approximation bound.
Pigeonhole proof of integer Siegel lemma Created 2026-10-14 Updated 2026-11-05
For homogeneous equations with integer coefficients of absolute value at most , map the box to its equation values. There are inputs and at most outputs. Taking makes the first count larger, since . The difference of two inputs with the same output is the required nonzero bounded integer solution. Clearing denominators also treats rational equations; expanding a number-field basis replaces each field equation by finitely many rational equations.
Plotter 2026-11-05
A plotter is a computer-controlled drawing device that produces physical marks by moving a pen or another marking tool relative to a surface. Geometric commands become motions and pen-up or pen-down actions. In a digital stepping plotter, available moves impose a coordinate mesh, so a mathematical line must be approximated by legal steps.
Jack Elton Bresenham's 1965 paper describes a plotter with eight possible neighbor moves, typically on a mesh spaced one hundredth of an inch apart.[ref] For a segment from to , the controller must distribute two upward increments among five rightward increments. Bresenham's line algorithm updates an integer decision value to choose successive moves. This connects computational geometry to an apparatus whose resolution and permitted motions determine the drawing.
Pointwise convergence Created 2026-09-24 Updated 2026-10-14
For a sequence of functions , pointwise convergence to a function means
It is the ordinary limit of a sequence at each fixed input. The threshold may depend on the input. Uniform convergence instead requires one threshold for the entire domain of a function.[ref]
Consider the polynomial functions , for positive integers , on the interval . For the geometric sequence tends to zero, while . Thus
Each is a continuous function, but its pointwise limit is discontinuous at one. Holding an input still hides what happens near that endpoint. The analogous even-power example on appears in the source.[ref]
For and , taking the logarithm of and dividing by the negative real number reverses the inequality:
The floor function followed by adding one handles the strict inequality even when the ratio is an integer. For tolerance , the first successful indices at , , and are respectively , , and . At , fails and succeeds. At and , the error from this pointwise limit is already zero, so works. Nevertheless, grows without bound as from below. A finite list of accurate test inputs cannot establish uniform convergence.
Figure 1.
Pointwise convergence of powers changes character when the domain of a function stops before one
. On the pointwise limit is zero except for its value one at the endpoint: the open circle and filled circle distinguish these values. On the pointwise limit is zero everywhere, and the largest error is . All curves are original evaluations of . Details.
An even sharper warning concerns integration. On , define the continuous functions
Their supports are , with height at and value zero at both ends. Every fixed eventually lies beyond the support, and always, so pointwise convergence gives the zero function. Nevertheless, each integral is the area of a triangle: . Shrinking width compensates increasing height. Hence the limit of a sequence of these integrals differs from the integral of the pointwise limit; interchanging them requires additional conditions, such as uniform convergence preserves integrals on a compact interval.
Poisson process Created 2026-09-24 Updated 2026-10-14
A Homogeneous Poisson process models arrivals at a constant rate . Its counting process counts arrivals in , with . Its paths are right-continuous nondecreasing functions, take nonnegative integer values, and have unit jumps almost surely. The defining Poisson distribution of each increment is
It has stationary increments: the probability distribution above depends on the duration , not the starting time . It also has independent increments: counts in any finite collection of disjoint time intervals are independent random variables. Together these conditions specify the joint count laws, not merely the Poisson distribution at a single time.[ref]
The rate has units of arrivals per unit time; is dimensionless. The Poisson distribution gives
For a toy rate per minute and a duration of minutes, the expected value and variance of the count are both . The probability of no arrival is , and the probability of exactly three is . In two consecutive one-minute intervals, the probability of exactly two arrivals in the first and exactly one in the second is , using independent increments. These are exact model calculations with rounded decimals, not measured frequencies.
Figure 1.
Synthetic arrival times and their right-continuous counting path, compared with the exact mean at two arrivals per minute
. Details.
The diagram's nine hand-chosen arrivals illustrate a path; the line is an expected value, not a prescribed trajectory. Constant rate does not imply evenly spaced arrivals. Poisson interarrival times connect the count description to waiting, while Poisson thinning explains how independently routing arrivals produces separate streams. This makes the Poisson process useful as a simple arrival model for a queue, provided constant rate and independent increments are plausible. For a deterministic changing rate, use an Inhomogeneous Poisson process; bunching or history-dependent arrivals need additional assumptions. Conditional on , the arrival times are the order statistics of independent uniform distributions on , as developed in Poisson process conditional arrival times.
Poisson summation formula Created 2026-09-24 Updated 2026-10-14
The Poisson summation formula equates sample sums of a function and its Fourier transform. Exchanging broad and narrow sums can save work. Use the convention
For every Schwartz function ,
Both series have absolute convergence. A sufficient hypothesis is that is smooth and for all nonnegative integers ; its Fourier transform is then also a Schwartz function.[ref] This assumption controls both decay and regularity; mere membership of an L1 space does not control values at individual sampling points, as periodization of an integrable function illustrates.
Here counts cycles per unit length. In the angular convention used elsewhere in Fourier analysis, , so and the right-hand side becomes . Keeping the Fourier transform convention explicit prevents stray factors. Changing the sample spacing leads to the Poisson summation formula for a Euclidean lattice.
Polar form of a complex number Created 2026-10-06 Updated 2026-10-20
A nonzero complex number has polar form
where is its modulus and is an argument. The equality uses Euler's formula; sine and cosine recover the imaginary part and real part from polar coordinates. For , take and radians, so and .
If , then
Thus multiplication multiplies moduli and adds arguments modulo ; division divides moduli and subtracts arguments modulo . Since , multiplying by gives , of modulus and argument radians. One formula simultaneously describes its new size and direction.
Figure 1.
Complex multiplication rotates every direction and scales every length equally
. Details.
Repeated multiplication now becomes especially simple: for a positive integer . This explains the evenly spaced arguments of the roots of a complex number. For example, has modulus and principal argument radians. The Cartesian calculation and the polar form provide independent checks on both its location and its size. Choose polar form when the task concerns multiplication, division, or repeated turns; use real parts and imaginary parts for addition.
Pollard's p-1 algorithm Created 2026-10-31 Updated 2026-11-05
For an integer to be factored, John Pollard's method chooses an integer coprime to and an exponent divisible by many small prime powers. Compute by modular exponentiation and the Euclidean algorithm. If , it is a proper divisor. If a prime divisor of has , Fermat's little theorem ensures ; success requires some other prime divisor not to divide . Common choices are and . The method exploits a smooth , rather than a small divisor itself.
Polygonal number Created 2026-10-20 Updated 2026-11-05
For integers and , the th -gonal number is
These figurate numbers begin at one, and their successive increments form an arithmetic progression:
Summing these increments proves the formula. For , it gives triangular numbers, square numbers, pentagonal numbers and hexagonal numbers. For example, the first three pentagonal numbers are , whose successive increments are four and seven. Increasing the number of polygon sides changes the step between increments while keeping this common quadratic structure.
Polynomial division Created 2026-09-24 Updated 2026-10-18
Polynomial division separates a polynomial into a multiple of a chosen divisor and a smaller polynomial remainder. Given over a field , with , there are unique polynomials satisfying
Here is the polynomial quotient. The bound concerns polynomial degree, rather than the sizes of the coefficients.[ref]
For an original example over the rational numbers, take
Polynomial long division first cancels by subtracting :
Subtracting one more copy of cancels :
Thus
The final polynomial remainder has polynomial degree one, below the divisor's polynomial degree two. Multiplying out the last identity checks every coefficient, including the constant term .
Figure 1.
Polynomial long division cancels the cubic and quadratic terms in two steps, recording and
. Details.
The polynomial degree bound makes this decomposition useful: it replaces a potentially long polynomial with a short polynomial remainder whenever multiples of can be discarded. At any root of a polynomial of , those multiples vanish under polynomial evaluation. Repeated polynomial division also drives the Euclidean algorithm for finding a greatest common divisor of polynomials.
The coefficient setting matters. Over a commutative ring, the same existence and uniqueness hold when the divisor's leading coefficient is a unit in a ring. A monic polynomial therefore works over the integers, even though they do not form a field; monic polynomial division over a ring explains why zero divisors cause no difficulty in that case.[ref]
A nonzero divisor alone is insufficient over the integers. Dividing by with an integer polynomial quotient and a constant polynomial remainder would require for an integer , which is impossible. Over the rational numbers the division instead gives
The obstruction is the nonunit leading coefficient . This example separates existence from uniqueness: over an integral domain, the polynomial degree argument still makes any admissible pair unique, if it exists.
Polynomial identity testing Created 2026-09-24 Updated 2026-10-18
Polynomial identity testing asks whether a polynomial represented implicitly, such as by an arithmetic circuit or a remainder computation, is the zero polynomial.
Here zero means that every coefficient vanishes after collecting equal monomials in the polynomial ring. Testing equality of two polynomials amounts to testing for zero. An arithmetic circuit can permit cheap polynomial evaluation even when expanding all monomials is expensive. The random evaluation test for a polynomial identity exploits this: one nonzero value disproves the polynomial identity, while a known total degree limits how often a nonzero polynomial can evade detection.[ref]
For example, for an integer , has distinct monomials, one for each subset of the variables. Its factored expression needs only additions and multiplications for one polynomial evaluation. Evaluating the compact expression avoids creating its expanded list of coefficients. The saving is especially attractive in many variables; it does not make a zero result into a proof of identity.
Polynomial root density in a sieve Created 2026-09-28 Updated 2026-11-05
For an integer polynomial and squarefree , let count the roots of modulo . The Chinese remainder theorem makes multiplicative, and
Thus and define a sieve distribution.
Positional notation Created 2026-09-29 Updated 2026-10-14
In positional notation, a numeral digit contributes its value multiplied by a weight determined by its position. Fix an integer radix . A finite string of numeral digits , with , represents the nonnegative integer
The rightmost position has weight ; each move left multiplies the weight by . This weight is the place value. For a nonzero integer, the canonical string has . Zero is written with the single numeral digit . Leading zeros are permitted in a fixed-width display but omitted in the canonical form: . A negative integer is written with a separate minus sign and the positional notation for its absolute value; the minus sign is not a numeral digit.[ref]
For example,
The zero is essential inside this string: , not . It records that the tens position contributes nothing while keeping the hundreds and units in their proper positions. The same integer has binary representation
Figure 1.
One integer, two encodings:
. Each numeral digit is multiplied by its place value. Decimal uses the weights ; binary uses . Zero digits preserve positions without contributing to the total. Both rows sum to . Details.
Repeated Euclidean division constructs the representation exactly. Set . At each step write
Keep the remainder and continue with the integer quotient . A positive quotient strictly decreases, so eventually it is zero. Substituting the successive equations back into the first gives : the numeral digits are obtained from right to left. The remainder modulo uniquely fixes , and then the quotient uniquely fixes the remaining string by the same reasoning. This proves existence and uniqueness once leading zeros are excluded. The needed unique quotient and remainder are precisely the conclusion of the Euclidean division theorem.[ref]
This finite expansion concerns nonnegative integers. Extending positional notation to fractional positions uses weights to the right of a point; an arbitrary real number need not have a finite digit string. In particular, the decimal representation represents , while the base-two string represents . The radix is part of the interpretation.
The benefit is compact arithmetic: positions can encode every nonnegative integer below . To see the upper endpoint, fill all positions with ; the finite geometric series gives . Carrying in addition exchanges units of one place value for one unit of the next. Thus a short string stores a large count and also supplies an algorithm for computing with it.
Positive definite Tits form indecomposable classification Created 2026-10-06 Updated 2026-11-05
The Ringel lemma on bricks makes every indecomposable a brick module; positive definiteness and the Ringel form then force and rigidity. Conversely, a maximal-orbit representation at a positive root cannot split: nonzero cross extensions increase orbit dimension, while vanishing cross extensions make the quadratic form of a split sum at least two. Open dense orbits give uniqueness. A compact bound on the integer roots gives finite representation type.