Javascript must be enabled to continue!
Extensions of Unbounded Representations
View through CrossRef
AbstractInduced extensions of unbounded (non *‐preserving, in general) representations of a *‐algebra are studied and some elementary facts are shown. For further study of *‐representation of non‐commutative *‐algebra, we introduce twisted extensions of *‐representations as a generalization of induced extensions. And we show that the SCHRÖDINGER representation of a WEYL‐algebra can be realized as a twisted extensions for any its *‐subrepresentation.
Title: Extensions of Unbounded Representations
Description:
AbstractInduced extensions of unbounded (non *‐preserving, in general) representations of a *‐algebra are studied and some elementary facts are shown.
For further study of *‐representation of non‐commutative *‐algebra, we introduce twisted extensions of *‐representations as a generalization of induced extensions.
And we show that the SCHRÖDINGER representation of a WEYL‐algebra can be realized as a twisted extensions for any its *‐subrepresentation.
Related Results
Unbounded Star Convergence in Lattices
Unbounded Star Convergence in Lattices
Let L be a vector lattice, "(" x_α ") " be a L-valued net, and x∈L . If |x_α-x|∧u→┴o 0 for every u ∈〖 L〗_+ then it is said that the net "(" x_α ")" unbounded order converges ...
Meta-Representations as Representations of Processes
Meta-Representations as Representations of Processes
In this study, we explore how the notion of meta-representations in Higher-Order Theories (HOT) of consciousness can be implemented in computational models. HOT suggests that consc...
KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS
KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS
AbstractWe continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinal...
An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem
An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem
<p>We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decryp...
An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem
An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem
<p>We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decryp...
Metaphoric and Metonymic Operations for the Iron Expressions
Metaphoric and Metonymic Operations for the Iron Expressions
This study uses the word iron as an example to analyze the phenomena of meaning extensions and function shifts from a cognitive semantic perspective. The analysis shows that the me...
Reclaiming the Wasteland: Samson and Delilah and the Historical Perception and Construction of Indigenous Knowledges in Australian Cinema
Reclaiming the Wasteland: Samson and Delilah and the Historical Perception and Construction of Indigenous Knowledges in Australian Cinema
It was always based on a teenage love story between the two kids. One is a sniffer and one is not. It was designed for Central Australia because we do write these kids off there. N...
Exploring the Representational Competence of Eleventh-Grade Students on the Rates of Chemical Reactions
Exploring the Representational Competence of Eleventh-Grade Students on the Rates of Chemical Reactions
Representational competence is a key component in learning chemistry, allowing students to interpret and apply multiple forms of representations to explain scientific phenomena. Th...

