finite inclusion
Смотреть что такое "finite inclusion" в других словарях:
Inclusion-exclusion principle — In combinatorial mathematics, the inclusion exclusion principle (also known as the sieve principle) states that if A 1, ..., A n are finite sets, then:egin{align}iggl|igcup {i=1}^n A iiggr| {} =sum {i=1}^nleft|A i ight sum {i,j,:,1 le i < j… … Wikipedia
Finite morphism — In algebraic geometry, a branch of mathematics, a morphism of schemes is a finite morphism, if Y has an open cover by affine schemes Vi = SpecBi such that for each i, f − 1(Vi) = Ui is an open affine subscheme SpecAi, and the restriction of … Wikipedia
Finite set — In mathematics, a set is called finite if there is a bijection between the set and some set of the form {1, 2, ..., n} where n is a natural number. (The value n = 0 is allowed; that is, the empty set is finite.) An infinite set is a set which is… … Wikipedia
Quasi-finite morphism — In algebraic geometry, a branch of mathematics, a morphism f : X rarr; Y of schemes is quasi finite if it satisfies the following two conditions:* f is locally of finite type. * For every point y isin; Y , the scheme theoretic fiber X times; Y k… … Wikipedia
Differential inclusion — In mathematics, differential inclusions are a generalization of the concept of ordinary differential equation of the form where F(t, x) is a set rather than a single point in . Differential inclusions arise in many situations including… … Wikipedia
Alexandrov topology — In topology, an Alexandrov space (or Alexandrov discrete space) is a topological space in which the intersection of any family of open sets is open. It is an axiom of topology that the intersection of any finite family of open sets is open. In an … Wikipedia
Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 … Wikipedia
Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… … Wikipedia
List of forcing notions — In mathematics, forcing is a method of constructing new models M[G] of set theory by adding a generic subset G of a poset P to a model M. The poset P used will determine what statements hold in the new universe (the extension ); to force a… … Wikipedia
Incidence algebra — In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for any locally finite partially ordered set and commutative ring with unity. Contents 1 Definition 1.1 Related concepts 2 Special elements … Wikipedia
Sheaf (mathematics) — This article is about sheaves on topological spaces. For sheaves on a site see Grothendieck topology and Topos. In mathematics, a sheaf is a tool for systematically tracking locally defined data attached to the open sets of a topological space.… … Wikipedia
