简体版 繁體版 English 한국어
登録 ログイン

- morphismの例文

例文モバイル版携帯版

  • That is what makes it Morita - morphism.
  • This is done by a variety of techniques, including graph iso - morphism algorithms.
  • The map is a bounded morphism ( also known as p - morphism ) if for each and, if, then there exists such that and " y " } }.
  • Another generalization states that a faithfully flat morphism of schemes f : Y \ to X locally of finite type with " X " quasi-compact has a " quasi-section ", i . e . there exists X'affine and faithfully flat and quasi-finite over " X " together with an " X " - morphism X'\ to Y
  • One may expect to deal also with relations which aren't necessarily functions, because : literally, the very concept of " homomorphism "-is simply : " homo - morphism ", i . e . it's supposed to express the idea of preserving the " same morphological " structure, while this requirement can be met also by a relation which isn't a function, i . e . a relation R such that for every a, b, c, d : if aRb and cRd then ( a + c ) R ( b * d ), the signs : +, * being the group operations.