翻訳と辞書 Words near each other ・ Ultramontanism ・ Ultramort ・ Ultranet ・ Ultranet (company) ・ Ultranet (product) ・ UltraNoir ・ ULTRAnumb ・ Ultrapar ・ Ultraparallel theorem ・ Ultrapato ・ Ultraperformance Nanophotonic Intrachip Communications ・ Ultraphobic ・ UltraPin ・ UltraPlayer ・ Ultrapotassic igneous rocks ・ Ultraproduct ・ Ultrapure water ・ Ultrarelativistic limit ・ Ultras ・ Ultras (comics) ・ Ultras (disambiguation) ・ Ultras Ahlawy ・ Ultras Junoon ・ Ultras Suryoye Göteborg ・ Ultras White Knights (UWK) ・ ULTRASAT ・ Ultrasauripus ・ Ultrasaurus ・ Ultrasensitivity ・ Ultraseven X Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Ultraproduct ： ウィキペディア英語版 Ultraproduct The ultraproduct is a mathematical construction that appears mainly in abstract algebra and in model theory, a branch of mathematical logic. An ultraproduct is a quotient of the direct product of a family of structures. All factors need to have the same signature. The ultrapower is the special case of this construction in which all factors are equal. For example, ultrapowers can be used to construct new fields from given ones. The hyperreal numbers, an ultrapower of the real numbers, are a special case of this. Some striking applications of ultraproducts include very elegant proofs of the compactness theorem and the completeness theorem, Keisler's ultrapower theorem, which gives an algebraic characterization of the semantic notion of elementary equivalence, and the Robinson-Zakon presentation of the use of superstructures and their monomorphisms to construct nonstandard models of analysis, leading to the growth of the area of non-standard analysis, which was pioneered (as an application of the compactness theorem) by Abraham Robinson. ==Definition== The general method for getting ultraproducts uses an index set ''I'', a structure ''M''''i'' for each element ''i'' of ''I'' (all of the same signature), and an ultrafilter ''U'' on ''I''. The usual choice is for ''I'' to be infinite and ''U'' to contain all cofinite subsets of ''I''. Otherwise the ultrafilter is principal, and the ultraproduct is isomorphic to one of the factors. Algebraic operations on the Cartesian product :$\backslash prod\_\; M\_i$ are defined in the usual way (for example, for a binary function +, (''a'' + ''b'') ''i'' = ''a''''i'' + ''b''''i'' ), and an equivalence relation is defined by ''a'' ~ ''b'' if :$\backslash left\backslash \backslash in\; U,$ and the ultraproduct is the quotient set with respect to ~. The ultraproduct is therefore sometimes denoted by :$\backslash prod\_M\_i\; /\; U\; .$ One may define a finitely additive measure ''m'' on the index set ''I'' by saying ''m''(''A'') = 1 if ''A'' ∈ ''U'' and = 0 otherwise. Then two members of the Cartesian product are equivalent precisely if they are equal almost everywhere on the index set. The ultraproduct is the set of equivalence classes thus generated. Other relations can be extended the same way: :$R((),\backslash dots,())\; \backslash iff\; \backslash left\backslash \backslash in\; U,$ where () denotes the equivalence class of ''a'' with respect to ~. In particular, if every ''M''''i'' is an ordered field, then so is the ultraproduct. An ultrapower is an ultraproduct for which all the factors ''M''''i'' are equal: : $M^\backslash kappa/U=\backslash prod\_M/U.\backslash ,$ More generally, the construction above can be carried out whenever ''U'' is a filter on ''I''; the resulting model $\backslash prod\_M\_i\; /\; U$ is then called a reduced product. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ultraproduct」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.