Binomial-market probability density 2026-10-14
With independent up moves of physical probability and risk-neutral probability , the Radon-Nikodym derivative on the first periods is the displayed likelihood ratio, where counts up moves. Its conditional one-step multiplier has physical expectation one, so is a positive mean-one martingale. The terminal state-price density is for deterministic bank-account value .
Enumerate all intervals with rational endpoints, using the countability of the rational numbers and listing pairs of enumeration indices by increasing sum. If every point of is an isolated point, some such interval contains and no other point of . Assign to the least index of such an interval. Distinct points cannot have the same index, so this gives an injective function into and proves that is a countable set. The argument uses isolation in the subspace topology, not closedness: the discrete subset illustrates that an accumulation point outside is allowed.
Closed discrete subset Created 2026-10-14 Updated 2026-10-31
A closed discrete subset of a topological space is a closed set whose subspace topology is the discrete topology. Every point of therefore has a neighbourhood meeting at that point alone. Closedness excludes all accumulation points outside as well.
In a plane domain, a closed discrete subset is exactly a set meeting every compact subset in finitely many points. This local finiteness is necessary for a nonzero holomorphic function to have the subset as its entire zero set. A merely isolated-point subset can have an accumulation point outside the subset but inside the domain, as does.
// Destination: analysis.bigb
Kleinian group 2026-10-14
A discrete subgroup of , acting by Möbius transformations on the Riemann sphere or orientation-preserving isometries of hyperbolic space . A group may be Kleinian even when some elements fix points; freeness and absence of torsion are additional conditions.
Planar discrete-subgroup basis 2026-10-14
A nonzero discrete additive subgroup of has a basis of one or two real-linearly independent vectors. Choose a shortest nonzero vector . If the subgroup is not contained in its line, reduce parallel components modulo and choose a vector of least positive perpendicular height. Such a height exists: heights tending to zero would give infinitely many reduced points in a bounded region, contrary to discreteness. Reducing any group vector modulo leaves height smaller than this minimum, hence height zero, and reducing along then gives an integer multiple of .
A discrete additive subgroup of is generated by real-linearly independent vectors. Indeed, isolation of zero gives uniform separation, so compact sets meet the subgroup finitely. Choose a real basis from the subgroup for its real span. Its integer span has finite index, since reduction into a compact fundamental parallelepiped gives finitely many coset representatives. The structure theorem for finitely generated abelian groups then gives a free integer basis, whose size is the dimension of the real span. Thus the subgroup is a Euclidean lattice in its span, although it need not have full rank in the ambient space.
Adjacency-matrix bound for a discrete SIR epidemic Created 2026-10-14 Updated 2026-11-05
The conditional union bound gives in a discrete SIR epidemic on a graph. Iteration bounds the infection vector at step by . Each vertex is infected at most once, so summing the probabilities in time gives the displayed bound. Powers of the adjacency matrix of a graph count walks, which can overcount impossible reinfections without invalidating the upper bound. Initially removed individuals must be counted separately when bounding all eventual removals.
Discrete sine transform Poisson solver 2026-10-14
For on a square with homogeneous Dirichlet boundary conditions, the five-point finite difference operator on a mesh is diagonalized by . Its eigenvalues are . A two-dimensional discrete sine transform, division by these nonzero eigenvalues and the inverse transform give the solution. Odd extension realizes each one-dimensional transform by a Fast Fourier transform of length , making the total cost and storage . These finite-difference eigenvalues should not be confused with the continuous spectral eigenvalues .
Poisson binomial distribution 2026-10-14
The sum of independent Bernoulli random variables with possibly unequal success probabilities has a Poisson binomial distribution. Its probability generating function is : expand the product to read off the probability mass function. Linearity of expectation and additivity of variance for independent random variables give and . Equal recover the binomial distribution.
For three trials with success probabilities , expanding gives masses at . Their expected value is and variance is . Replacing all three success probabilities by their average preserves the expected value but gives binomial distribution variance , so it does not preserve the law.
Finite-field paraboloid fourth-moment extension estimate Created 2026-10-14 Updated 2026-11-05
For the three-dimensional discrete paraboloid over an odd prime field, the surface transform away from zero has magnitude at most , by completing squares and evaluating quadratic Gauss sums. The adjoint-composition convolution kernel is the transform of the surface measure. Subtract its unit mass at the origin. Convolution by the remainder has norm at most and norm at most . The Riesz-Thorin interpolation theorem gives norm at most one; adding the identity kernel gives at most two. The adjoint-composition identity and duality therefore give the displayed extension constant for normalized surface measure and ambient counting measure. This argument works for either quadratic character of minus one.
If in the prime field, the line lies in the three-dimensional discrete paraboloid. Its indicator has normalized surface norm . Its extension is on the two-dimensional annihilator plane and zero elsewhere. Thus its ambient norm is , proving the displayed lower bound, which diverges for .
Zero padding 2026-10-14
Zero padding extends a finite sequence by zero entries to a specified length. For input lengths , their full discrete convolution has length at most . Padding both inputs to allows circular convolution to represent this full result without folded entries.
Circular convolution Created 2026-10-14 Updated 2026-10-20
Circular convolution of two length- sequences uses modular arithmetic for their indices. Extending both inputs periodically gives the displayed formula. Equivalently, fold a finite discrete convolution into residue classes modulo by adding entries whose indices are congruent. The discrete Fourier transform of the circular convolution is the product of the two discrete Fourier transforms, with the usual unnormalized forward transform and inverse convention.
Page writeback 2026-10-14
Preserving the modified contents of a dirty memory page in its backing storage. The reference model waits for successful page writeback before reusing the victim's page frame; failure cannot authorize losing its modifications. A reference bit records recent access, while the dirty flag records a write obligation: reading can set the first without setting the second. Buffer cache writeback concerns the analogous obligation for a buffered device block.
Fractional Dirichlet domain scale 2026-10-14
For the positive Dirichlet Laplacian on a bounded smooth domain, with normalized eigenfunctions and positive eigenvalues , define on the vectors for which . The resulting Hilbert space embeds in the Sobolev space , with the boundary conditions appropriate to the exponent. In particular embeds in whenever . High powers impose further boundary compatibility; ordinary smoothness alone does not imply membership in every fractional domain.
Dirichlet resonance in an equilateral triangle Created 2026-10-14 Updated 2026-10-18
If are the affine barycentric coordinates of an equilateral triangle of side , then vanishes on the boundary and satisfies . Thus the problem with zero Dirichlet boundary data has distinct solutions zero and at the displayed negative parameter. Their normal traces differ, demonstrating failure of a uniquely determined Dirichlet-to-Neumann map at resonance.
For a primitive nonprincipal Dirichlet character of conductor and parity , the completed Dirichlet L-function is entire of order one. Its genus-one Hadamard factorization gives the displayed logarithmic derivative, with the logarithmic derivative of the completion at zero and zeros counted with multiplicity. Combined summands converge locally normally away from zeros. For an imprimitive character induced by , add for the removed Euler factors. The primitive principal case is the global partial-fraction expansion of the zeta logarithmic derivative.
// Target: algebraic-number-theory.bigb
Product over all Dirichlet characters 2026-10-14
For real , Orthogonality of Dirichlet characters gives . Thus . Only the principal Dirichlet character contributes a pole at one, and that pole is simple. A zero of a nonreal Dirichlet L-function at one brings a zero of its conjugate too; their two zeros overpower that pole and would make the product tend to zero. This proves nonvanishing for nonreal Dirichlet characters and is a useful complement to arguments for real Dirichlet characters.
Dirichlet kernel harmonic lower bound 2026-10-14
For , define . Evenness and on give . The first complete sine periods of length have absolute sine integral two, and on the th such interval . This proves the displayed unbounded lower bound. The real functional on continuous functions has norm exactly : the upper bound is its kernel integral, and the continuous functions approach that bound as by dominated convergence.
There are unlisted articles, also show them or only show them.