Search results

{{short description|Characterizes sets of lattices that are bounded in a certain sense}} ...nvention used in naming compactness theorems, because they were formulated in terms of [[sequential compactness]] (the possibility of selecting a converg ...

...[[Union (set theory)|union]] ([[infix operator]]: ∪), [[intersection (set theory)|intersection]] (infix operator: ∩), and [[set complement]] ([[postfix (lin ...algebra of sets is an [[interpretation (logic)|interpretation]] or [[model theory|model]] of [[Boolean algebra (structure)|Boolean algebra]], with union, int ...

{{Short description|Law in algebra}} In [[algebra]], the '''absorption law''' or '''absorption identity''' is an [[ ...

{{for|duals of order-theoretic lattices|Duality (order theory) }} {{Group theory sidebar |Discrete}} ...

{{Short description|Theorem in order theory and lattice theory}} ...d-point theorem in lattice theory|the fixed-point theorem in computability theory|Kleene's recursion theorem}} ...

...Dardashti|title=No-go theorems: What are they good for? |journal=[[Studies in History and Philosophy of Science]] |volume=4 |issue=1 |pages=47–55 |date=2 ==Instances of no-go theorems== ...

{{Short description|Theorem in mathematical economics}} ...hen <math>x^*(\theta)=\arg\max_{x\in D}f(x,\theta)</math> is nondecreasing in ''θ''. The result is especially helpful for establishing comparative stati ...

{{Short description|Theorem in group theory}} In [[group theory]], the '''correspondence theorem'''<ref name="Robinson2003"> ...

In [[mathematics]], a '''representation theorem''' is a [[theorem]] that state * [[Representation theory]] studies properties of abstract groups via their [[group representation|re ...

{{short description|Technical lemma in group theory}} ...of a [[module (mathematics)|module]], or more generally for any [[modular lattice]].<ref>{{cite book |title=Associative algebras |first=R.S. |last=Pierce |pu ...

* [[Skew lattice#Skew Boolean algebras|Skew Boolean algebra]] [[Talk:Skew lattice| ]] == Theorems and specific laws == ...

In [[mathematics]], a '''relatively compact subspace''' (or '''relatively comp ...atively compact (since a closed subset of a compact space is compact). And in an arbitrary topological space every subset of a relatively compact set is ...

.... [[Duality (category theory)|Dually]], a '''cocomplete category''' is one in which all small [[colimit]]s exist. A '''bicomplete category''' is a catego ==Theorems== ...

{{short description|Ideals in a Boolean algebra can be extended to prime ideals}} ...[[order theory]]). This article focuses on prime ideal theorems from order theory. ...

In [[mathematics]], the '''Bourbaki–Witt theorem''' in [[order theory]], named after [[Nicolas Bourbaki]] and [[Ernst Witt]], is a basic [[fixed- Pick some <math>y \in X</math>. Define a function ''K'' recursively on the ordinals as follows: ...

{{Short description|Theorem in string theory}} ...athematics]], and in particular in the mathematical background of [[string theory]], the '''Goddard–Thorn theorem''' (also called the '''no-ghost theorem''') ...

...th [[supremum]] in ''P'', its [[image (mathematics)|image]] has a supremum in ''Q'', and that supremum is the image of the supremum of ''D'', i.e. <math> ...ected sets ''D'' with supremum in ''O'' have non-empty [[intersection (set theory)|intersection]] with ''O''. The Scott-open subsets of a partially ordered s ...

{{Short description|Special type of lattice}} ...ice is&mdash;up to [[order isomorphism|isomorphism]]&mdash;given as such a lattice of sets. ...

{{Short description|Theorem in analysis}} ...ge" of ''A'', the set of points in ''A'' whose "neighborhood" is partially in ''A'' and partially outside of ''A'', is [[null set|negligible]]. ...

...1 of a [[real analytic Eisenstein series]] (or [[Epstein zeta function]]) in terms of the [[Dedekind eta function]]. There are many generalizations of i ...is formula has been used in [[string theory]] for the one-loop computation in [[Alexander Markovich Polyakov|Polyakov]]'s perturbative approach. ...