Abelian lattice-ordered group 2026-10-14
A commutative lattice-ordered group, usually written additively. Examples include real-valued function groups with pointwise addition, maximum and minimum. Such a group need not have a total order.
Linearly ordered group 2026-10-14
A group with a two-sided invariant total order. Thus it is a lattice-ordered group whose join and meet choose the larger and smaller element. An order on only one side is not sufficient here. Every linearly ordered group is torsion-free: a positive element has strictly increasing positive powers, and a negative element has a positive inverse.
Normal-valued lattice-ordered group 2026-10-14
A lattice-ordered group is normal-valued when every value in a lattice-ordered group is a normal subgroup of its cover. Normality in the cover is weaker than normality in the entire group. Every linearly ordered group is normal-valued.
Convex lattice subgroup Created 2026-10-14 Updated 2026-11-05
A convex subgroup of an ordered group that is also closed under join and meet. A normal convex lattice subgroup is the kernel of the quotient lattice-ordered group homomorphism.
Absolute value in a lattice-ordered group 2026-10-14
The displayed join is nonnegative in a lattice-ordered group. In an additive Abelian group it becomes . This order-theoretic absolute value need not be a real scalar.
Lattice-ordered group homomorphism Created 2026-10-14 Updated 2026-11-05
A group homomorphism preserving both join and meet. A bijective such map is an isomorphism of lattice-ordered groups; an injective one is an embedding.
Equal sums give equal Klein j-invariants, hence the complex lattices are homothetic. If both sums are nonzero, the scaling factor obeys and is . If only vanishes, the lattice is homothetic to the square lattice and the possible fourth roots of unity already preserve it. If only vanishes, it is homothetic to the hexagonal lattice and the possible sixth roots of unity preserve it. The two sums cannot vanish together because the elliptic discriminant is nonzero.
Homomorphism of lattices 2026-10-14
A homomorphism between lattices preserves binary joins and meets: and . It is order preserving, since implies and hence . For a map into the two-element lattice, the inverse image of zero is a lattice ideal, and meet preservation says this ideal is prime: if a meet belongs to it, at least one factor does. Conversely the indicator of the complement of a prime lattice ideal preserves both operations. Preservation of distinguished top and bottom elements is an additional requirement for homomorphisms of bounded lattices.
Join and meet 2026-10-14
Mutually orthogonal Latin squares Created 2026-10-14 Updated 2026-11-05
Latin squares on the same array are mutually orthogonal when every ordered pair of symbols from any two squares occurs exactly once on superposition. Pairwise balance makes the centered symbol-indicator spaces orthogonal in an additive linear regression model.
Analysis of variance for a Latin square Created 2026-10-14 Updated 2026-10-25
For one response per cell in an order- Latin square, fit an intercept and additive row, column and treatment effects with sum-to-zero constraints. Each factor contributes statistical degrees of freedom; the residual has . The centered factor spaces are mutually orthogonal, so sequential sums of squares do not depend on fitting order. With an additional orthogonal symbol factor from a Graeco-Latin square, residual statistical degrees of freedom become . Exact F-tests require independent equal-variance normal errors; unmodeled interactions can invalidate the error term.
If a triangular-lattice subdivision mask has the displayed residue-sum equality, refining data gives , independent of . If affine coordinates reproduce their parameter positions, a geometrically straight extrusion is preserved. Rotationally symmetric masks give the corresponding property in all three lattice-edge directions. A boundary curve compatible with this extrusion uses the collapsed mask , not just the central row of the two-dimensional mask.
Large deviations of a fixed sum of geometric random variables Created 2026-10-14 Updated 2026-11-05
For fixed finitely many independent geometric random variables, the product large-deviation principle gives rate on the nonnegative orthant for their scaled vector, where . The contraction principle for large deviations under addition minimizes this over . The answer is , achieved by assigning all scaled excess to a coordinate with the slowest geometric tail. The rate is infinite for negative . Deterministic coordinates with contribute zero on this scale; if all coordinates are deterministic, only zero has finite rate.
Hurstiness Created 2026-10-14 Updated 2026-11-05
A sequence has Hurstiness H when it satisfies a large deviation principle at the displayed speed with a good rate function having a unique zero and at least one strictly positive finite value. This definition concerns a sequence's exponential Probability scale; it does not assert a sample-path Hurst exponent or self-similarity. Larger H means slower rare-event decay. The positive finite value excludes the slower-speed degeneration of a large deviation principle.
Cramér-Lundberg workload exponent 2026-10-14
For nondegenerate independent and identically distributed arrivals with mean below , suppose the positive root is interior to the moment-generating function domain. Then . The Fenchel–Young inequality gives for every , and equality occurs at . The exponential workload bound from cumulative arrival moments gives the upper logarithmic tail bound for every . A horizon of the indicated length times buffer size gives the matching lower bound by Cramér's theorem. A positive interior root is an assumption; if arrivals never exceed capacity, positive workload cannot arise.
Laplace principle for probability measures 2026-10-14
A family satisfies this principle with speed and rate function when the displayed variational identity holds for every bounded continuous real function . A large deviation principle implies it by the Varadhan lemma. The lower bound restricts the expectation to a neighborhood of a chosen point; the upper bound partitions the bounded range of into small intervals and applies the closed-set probability bounds.
For nonnegative , the identity also givesFor , truncate below at . The resulting bounded-function identity applies, while the difference of the two exponential expectations is at most . Choosing sufficiently large makes this error negligible on the claimed exponential scale. The case is immediate. This extension identifies moment-decay rates of a passive scalar from fluctuations of its logarithmic stretching.
Let be a Poisson random measure of intensity , let , and let be measurable. Apply the Laplace functional of a Poisson random measure to and differentiate from the right at . On the random side, differentiation is dominated by the integrable random variable ; on the intensity side, by . This proves the displayed identity when is finite. When this integral is infinite, almost surely, and the same identity holds with both sides zero.
Fix the exceptional-zero threshold , with less than one third of the constant in Landau theorem for two real Dirichlet characters. If distinct primitive conductors satisfy , then ; both exceptional zeros lie in the forbidden two-zero interval. Thus the conductors grow at least quadratically. The same argument with equal conductors proves at most one exceptional real primitive character for each modulus. Existence is not asserted, and a consistently sufficiently small threshold is essential.
// Target: number-theory.bigb
For a smooth function , its differential defines a Lagrangian submanifold of the cotangent bundle: pullback of the canonical one-form on a cotangent bundle is , so pullback of the symplectic form is zero. The graph has half the ambient dimension. With and momentum coordinates , the first law of thermodynamics identifies the equilibrium graph with . This geometric statement does not require extensivity or thermodynamic stability.
There are unlisted articles, also show them or only show them.