Commutativity of unbounded representations
نویسندگان
چکیده
منابع مشابه
compactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولRepresentations of Hermitian Commutative ∗-algebras by Unbounded Operators
We give a spectral theorem for unital representions of Hermitian commutative unital ∗-algebras by possibly unbounded operators in a pre-Hilbert space. A more general result is known for the case in which the ∗-algebra is countably generated. 1. Statement of the Main Result Our main result is the following: Theorem 1. Let π be a unital representation of a Hermitian commutative unital ∗-algebra A...
متن کاملRobust transmission of unbounded strings using Fibonacci representations
Families of Fibonacci codes and Fibonacci representations are defined. Their main attributes are: (i) robustness, manifesting itself by the local containment of errors; (ii) simple encoding and and decoding. The main applica· tiOD explored is the transmission of binary strings whose length is in aD. unknown range, using robust Fibonacci representations instead of the conventional errorsensitive...
متن کاملMedial commutativity
It is shown that all the assumptions for symmetric monoidal categories flow out of a unifying principle involving natural isomorphisms of the type (A ∧B) ∧ (C ∧D) → (A ∧ C) ∧ (B ∧D), called medial commutativity. Medial commutativity in the presence of the unit object enables us to define associativity and commutativity natural isomorphisms. In particular, Mac Lane’s pentagonal and hexagonal coh...
متن کاملCommutativity of Reducers
In the Map-Reduce programming model for data parallel computation in a cloud environment, the reducer phase is responsible for computing an output key-value pair, given a sequence of input values associated with a particular key. Because of non-determinism in transmitting key-value pairs over the network, the inputs may not arrive at a reducer in a fixed order. This gives rise to the reducer co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1993
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1993-1145950-2