Результаты поиска
Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску
- ...'' ≠ 0 and ''c'' has no nontrivial common predecessor with ''a''. That is, in the latter case, the only ''x'' with ''x'' ≤ ''a'' and ''x'' ≤ ''c'' is ...of a [[topological space]] could be defined in terms of its [[distributive lattice]] of [[closed set]]s. He observed that the inclusion order on the closed se ...2 Кб (196 слов) - 19:33, 27 февраля 2024
- {{Short description|Law in algebra}} In [[algebra]], the '''absorption law''' or '''absorption identity''' is an [[ ...3 Кб (374 слова) - 03:49, 28 декабря 2023
- {{for|duals of order-theoretic lattices|Duality (order theory) }} {{Group theory sidebar |Discrete}} ...13 Кб (2016 слов) - 14:13, 29 февраля 2024
- {{Short description|1990 book on mathematical order theory}} ...of the [[Mathematical Association of America]] has suggested its inclusion in undergraduate mathematics libraries.{{r|maa}} ...7 Кб (985 слов) - 17:07, 26 марта 2024
- In [[group theory]], the '''correspondence theorem'''<ref name="Robinson2003"> |title=A Course in Group Theory ...6 Кб (948 слов) - 19:18, 21 февраля 2024
- ...he [[Riesz space#Projection properties|principal projection property]] can in a sense be approximated uniformly by [[simple function]]s. ...e [[Poisson kernel|Poisson formula]] and the [[spectral theorem]] from the theory of [[normal operator]]s can all be shown to follow as special cases of the ...4 Кб (527 слов) - 06:31, 10 марта 2024
- ...on|Correlation-type inequality for four functions on a finite distributive lattice}} ...r functions on a finite [[distributive lattice]]. It is a fundamental tool in [[statistical mechanics]] and [[Combinatorics#Probabilistic_combinatorics|p ...3 Кб (396 слов) - 00:54, 2 января 2024
- ...]. The theorem was proved by the Hungarian mathematician [[György Hajós]] in 1941 using [[group ring]]s. [[László Rédei|Rédei]] later proved the sta [[File:Shifted square tiling.svg|thumb|160px|In this lattice tiling of the plane by congruent squares, the green and violet squares meet ...4 Кб (449 слов) - 17:06, 18 марта 2024
- .... [[Duality (category theory)|Dually]], a '''cocomplete category''' is one in which all small [[colimit]]s exist. A '''bicomplete category''' is a catego ==Theorems== ...6 Кб (776 слов) - 22:45, 20 февраля 2024
- {{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. ...16 Кб (2429 слов) - 22:12, 10 февраля 2024
- ...ice is—up to [[order isomorphism|isomorphism]]—given as such a lattice of sets. ...rrespondence are discussed in the article on [[lattice (order)|lattices]]. In the present situation, the algebraic description appears to be more conveni ...17 Кб (2443 слова) - 21:27, 27 февраля 2024
- {{short description|Result in the mathematics of string theory on a functor that quantizes bosonic strings}} ...athematics]], and in particular in the mathematical background of [[string theory]], the '''Goddard–Thorn theorem''' (also called the '''no-ghost theorem'' ...9 Кб (1309 слов) - 14:59, 15 марта 2024
- ...ge = [[File: Goetze friedrich.jpg|frameless|{{center|Friedrich Götze in 2010}}]] ...izing in [[probability theory]], [[mathematical statistics]], and [[number theory]]. ...8 Кб (1001 слово) - 07:26, 10 марта 2024
- ...h ''F''(''x'') = ''x''), under some conditions on ''F'' that can be stated in general terms.<ref>{{cite book | title = Fixed Point Theory and Its Applications ...11 Кб (1479 слов) - 02:57, 8 марта 2024
- ...omenon can be reformulated entirely in terms of gauge invariant quantities in what is known as the Fröhlich–Morchio–Strocchi mechanism.<ref>{{cite j ==Theory== ...12 Кб (1630 слов) - 02:30, 3 марта 2024
- {{Short description|Group of mathematical theorems}} ...other [[algebraic structure]]s. In [[universal algebra]], the isomorphism theorems can be generalized to the context of algebras and [[congruence relation|con ...25 Кб (3958 слов) - 08:34, 27 марта 2024
- .../bfm%3A978-3-540-38933-0%2F1.pdf|chapter=Front matter|series=Lecture Notes in Computer Science |isbn=3-540-13378-X |s2cid=7488558 }}</ref> ...point <math>\mu (x, y).(f, g)(x, y)</math>, a pair <math>(x_0, y_0)</math> in <math>P \times Q</math> such that <math>f (x_0, y_0) = x_0</math> and <math ...7 Кб (1095 слов) - 16:24, 7 февраля 2024
- :''This is about [[lattice theory]]. For other similarly named results, see [[Birkhoff's theorem (disambiguat ...s way. It is named after [[Garrett Birkhoff]], who published a proof of it in 1937.<ref name="birkhoff">{{harvtxt|Birkhoff|1937}}.</ref> ...22 Кб (3242 слова) - 16:41, 9 февраля 2024
- ...to color some of the white points black so that the number of black points in the rows and columns match the blue numbers.]]'''Discrete tomography'''<ref Herman, G. T. and Kuba, A., Advances in Discrete Tomography and Its Applications, Birkhäuser Boston, 2007 ...13 Кб (1771 слово) - 19:10, 27 февраля 2024
- ...eals are of great importance for many constructions in order and [[lattice theory]]. ...{mvar|I}} and ''y'' in ''P'', {{math|''y'' ≤ ''x''}} implies that ''y'' is in {{mvar|I}} ({{mvar|I}} is a [[lower set]]), ...13 Кб (2013 слов) - 02:34, 25 марта 2024