ultrastable ideal - ορισμός. Τι είναι το ultrastable ideal
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

Τι (ποιος) είναι ultrastable ideal - ορισμός

FAMILY CLOSED UNDER SUBSETS AND COUNTABLE UNIONS
Σ-ideal; S-ideal; Sigma ideal

ideal         
WIKIMEDIA DISAMBIGUATION PAGE
Ideal (mathematics); Ideals; Ideal (disambiguation)
<theory> In domain theory, a non-empty, downward closed subset which is also closed under binary least upper bounds. I.e. anything less than an element is also an element and the least upper bound of any two elements is also an element. (1997-09-26)
ideal         
WIKIMEDIA DISAMBIGUATION PAGE
Ideal (mathematics); Ideals; Ideal (disambiguation)
I. a.
1.
Intellectual, mental.
2.
Imaginary, unreal, fanciful, fantastic, fancied, illusory, chimerical, visionary, shadowy.
3.
Complete, perfect, consummate, filling our utmost conceptions.
II. n.
Imaginary standard, ideal model of perfection.
IDEAL         
WIKIMEDIA DISAMBIGUATION PAGE
Ideal (mathematics); Ideals; Ideal (disambiguation)
1. Ideal DEductive Applicative Language. A language by Pier Bosco and Elio Giovannetti combining Miranda and Prolog. Function definitions can have a guard condition (introduced by ":-") which is a conjunction of equalities between arbitrary terms, including functions. These guards are solved by normal Prolog resolution and unification. It was originally compiled into C-Prolog but was eventually to be compiled to K-leaf. 2. A numerical constraint language written by Van Wyk of Stanford in 1980 for typesetting graphics in documents. It was inspired partly by Metafont and is distributed as part of Troff. ["A High-Level Language for Specifying Pictures", C.J. Van Wyk, ACM Trans Graphics 1(2):163-182 (Apr 1982)]. (1994-12-15)

Βικιπαίδεια

Sigma-ideal

In mathematics, particularly measure theory, a 𝜎-ideal, or sigma ideal, of a sigma-algebra (𝜎, read "sigma," means countable in this context) is a subset with certain desirable closure properties. It is a special type of ideal. Its most frequent application is in probability theory.

Let ( X , Σ ) {\displaystyle (X,\Sigma )} be a measurable space (meaning Σ {\displaystyle \Sigma } is a 𝜎-algebra of subsets of X {\displaystyle X} ). A subset N {\displaystyle N} of Σ {\displaystyle \Sigma } is a 𝜎-ideal if the following properties are satisfied:

  1. N {\displaystyle \varnothing \in N} ;
  2. When A N {\displaystyle A\in N} and B Σ {\displaystyle B\in \Sigma } then B A {\displaystyle B\subseteq A} implies B N {\displaystyle B\in N} ;
  3. If { A n } n N N {\displaystyle \left\{A_{n}\right\}_{n\in \mathbb {N} }\subseteq N} then n N A n N . {\textstyle \bigcup _{n\in \mathbb {N} }A_{n}\in N.}

Briefly, a sigma-ideal must contain the empty set and contain subsets and countable unions of its elements. The concept of 𝜎-ideal is dual to that of a countably complete (𝜎-) filter.

If a measure μ {\displaystyle \mu } is given on ( X , Σ ) , {\displaystyle (X,\Sigma ),} the set of μ {\displaystyle \mu } -negligible sets ( S Σ {\displaystyle S\in \Sigma } such that μ ( S ) = 0 {\displaystyle \mu (S)=0} ) is a 𝜎-ideal.

The notion can be generalized to preorders ( P , , 0 ) {\displaystyle (P,\leq ,0)} with a bottom element 0 {\displaystyle 0} as follows: I {\displaystyle I} is a 𝜎-ideal of P {\displaystyle P} just when

(i') 0 I , {\displaystyle 0\in I,}

(ii') x y  and  y I {\displaystyle x\leq y{\text{ and }}y\in I} implies x I , {\displaystyle x\in I,} and

(iii') given a sequence x 1 , x 2 , I , {\displaystyle x_{1},x_{2},\ldots \in I,} there exists some y I {\displaystyle y\in I} such that x n y {\displaystyle x_{n}\leq y} for each y . {\displaystyle y.}

Thus I {\displaystyle I} contains the bottom element, is downward closed, and satisfies a countable analogue of the property of being upwards directed.

A 𝜎-ideal of a set X {\displaystyle X} is a 𝜎-ideal of the power set of X . {\displaystyle X.} That is, when no 𝜎-algebra is specified, then one simply takes the full power set of the underlying set. For example, the meager subsets of a topological space are those in the 𝜎-ideal generated by the collection of closed subsets with empty interior.