Modular latticeIn the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition, Modular lawa ≤ b implies a ∨ (x ∧ b) = (a ∨ x) ∧ b where x, a, b are arbitrary elements in the lattice, ≤ is the partial order, and ∨ and ∧ (called join and meet respectively) are the operations of the lattice. This phrasing emphasizes an interpretation in terms of projection onto the sublattice [a, b], a fact known as the diamond isomorphism theorem.
Complemented latticeIn the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0. Complements need not be unique. A relatively complemented lattice is a lattice such that every interval [c, d], viewed as a bounded lattice in its own right, is a complemented lattice. An orthocomplementation on a complemented lattice is an involution that is order-reversing and maps each element to a complement.
Unimodular latticeIn geometry and mathematical group theory, a unimodular lattice is an integral lattice of determinant 1 or −1. For a lattice in n-dimensional Euclidean space, this is equivalent to requiring that the volume of any fundamental domain for the lattice be 1. The E8 lattice and the Leech lattice are two famous examples. A lattice is a free abelian group of finite rank with a symmetric bilinear form (·, ·). The lattice is integral if (·,·) takes integer values. The dimension of a lattice is the same as its rank (as a Z-module).
Integer latticeIn mathematics, the n-dimensional integer lattice (or cubic lattice), denoted \mathbb{Z}^n, is the lattice in the Euclidean space \mathbb{R}^n whose lattice points are n-tuples of integers. The two-dimensional integer lattice is also called the square lattice, or grid lattice. \mathbb{Z}^n is the simplest example of a root lattice. The integer lattice is an odd unimodular lattice. The automorphism group (or group of congruences) of the integer lattice consists of all permutations and sign changes of the coordinates, and is of order 2n n!.
Hairy ball theoremThe hairy ball theorem of algebraic topology (sometimes called the hedgehog theorem in Europe) states that there is no nonvanishing continuous tangent vector field on even-dimensional n-spheres. For the ordinary sphere, or 2‐sphere, if f is a continuous function that assigns a vector in R3 to every point p on a sphere such that f(p) is always tangent to the sphere at p, then there is at least one pole, a point where the field vanishes (a p such that f(p) = 0).
Fundamental theorem on homomorphismsIn abstract algebra, the fundamental theorem on homomorphisms, also known as the fundamental homomorphism theorem, or the first isomorphism theorem, relates the structure of two objects between which a homomorphism is given, and of the kernel and of the homomorphism. The homomorphism theorem is used to prove the isomorphism theorems. Given two groups G and H and a group homomorphism f : G → H, let N be a normal subgroup in G and φ the natural surjective homomorphism G → G/N (where G/N is the quotient group of G by N).
Height functionA height function is a function that quantifies the complexity of mathematical objects. In Diophantine geometry, height functions quantify the size of solutions to Diophantine equations and are typically functions from a set of points on algebraic varieties (or a set of algebraic varieties) to the real numbers. For instance, the classical or naive height over the rational numbers is typically defined to be the maximum of the numerators and denominators of the coordinates (e.g.
Blackboard boldBlackboard bold is a style of writing bold symbols on a blackboard by doubling certain strokes, commonly used in mathematical lectures, and the derived style of typeface used in printed mathematical texts. The style is most commonly used to represent the number sets (natural numbers), (integers), (rational numbers), (real numbers), and (complex numbers). To imitate a bold typeface on a typewriter, a character can be typed over itself (called double-striking); symbols thus produced are called double-struck, and this name is sometimes adopted for blackboard bold symbols, for instance in Unicode glyph names.
Duality theory for distributive latticesIn mathematics, duality theory for distributive lattices provides three different (but closely related) representations of bounded distributive lattices via Priestley spaces, spectral spaces, and pairwise Stone spaces. This duality, which is originally also due to Marshall H. Stone, generalizes the well-known Stone duality between Stone spaces and Boolean algebras. Let L be a bounded distributive lattice, and let X denote the set of prime filters of L. For each a ∈ L, let φ+(a) = {x∈ X : a ∈ x.
Bornivorous setIn functional analysis, a subset of a real or complex vector space that has an associated vector bornology is called bornivorous and a bornivore if it absorbs every element of If is a topological vector space (TVS) then a subset of is bornivorous if it is bornivorous with respect to the von-Neumann bornology of . Bornivorous sets play an important role in the definitions of many classes of topological vector spaces, particularly bornological spaces.
