Hostname: page-component-797576ffbb-vjhkx Total loading time: 0 Render date: 2023-12-11T16:00:17.141Z Has data issue: false Feature Flags: { "corePageComponentGetUserInfoFromSharedSession": true, "coreDisableEcommerce": false, "useRatesEcommerce": true } hasContentIssue false

# The geometry of finite dimensional pseudomodules

Published online by Cambridge University Press:  05 May 2010

Edited by
Foreword by

## Summary

AbstractA semimodule M over an idempotent semiring P is also idempotent. When P is linearly ordered and conditionally complete, we call it a pseudoring, and we say that M is a pseudomodule over P. The classification problem of the isomorphism classes of pseudomodules is a combinatorial problem which, in part, is related to the classification of isomorphism classes of semilattices. We define the structural semilattice of a pseudomodule, which is then used to introduce the concept of torsion. Then we show that every finitely generated pseudomodule may be canonically decomposed into the “sum” of a torsion free sub-pseudomodule, and another one which contains all the elements responsible for the torsion of M. This decomposition is similar to the classical decomposition of a module over an integral domain into a free part and a torsion part. It allows a great simplification of the classification problem, since each part can be studied separately. For subpseudomodules of the free pseudomodule over m generators, we conjecture that the torsion free part, also called semiboolean, is completely characterized by a weighted oriented graph whose set of vertices is the structural semilattice of M. Partial results on the classification of the isomorphism class of a torsion sub-pseudomodule of Pm with m generators will also be presented.

Pseudorings and Pseudomodules

A pseudoring (P, +, ·) is an idempotent, commutative, completely ordered, and conditionally complete semiring with minimal element 0, such that (P\ {0}, ·) is an integrally closed commutative group. For simplicity, the reader may think of P as R∪ {–∞} (or R∪ {∞}) with + the max (resp. the min) operator, and o the usual addition.

Type
Chapter
Information
Idempotency , pp. 392 - 405
Publisher: Cambridge University Press
Print publication year: 1998

## Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

# Save book to Kindle

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

# Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

# Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×