Constructing incomplete actions Christopher Hollings University of York, UK

Tartu, 29th June 2007

Christopher Hollings Constructing incomplete actions

University of York, UK

Partial actions of groups ‘∃x · g ’: ‘the action of g ∈ G on x ∈ X is defined’. Definition (KL 2004) A group G acts partially on a set X (on the right) if there is a partial mapping X × G → X , written (x, g ) 7→ x · g , and such that (1) ∃x · 1 and x · 1 = x, for all x ∈ X ; (2) ∃x · g and ∃(x · g ) · h ⇒ ∃x · gh, in which case, (x · g ) · h = x · gh; (3) ∃x · g ⇒ ∃(x · g ) · g −1 and (x · g ) · g −1 = x.

Christopher Hollings Constructing incomplete actions

University of York, UK

Group premorphisms

Proposition (KL 2004) The partial action of a group G on a set X is equivalent to a group premorphism: a function θ : G → IX such that (1) 1θ = 1; (2) (g θ)(hθ) ≤ (gh)θ; (3) g −1 θ = (g θ)−1 , with ∃x · g ⇐⇒ x ∈ dom g θ,

Christopher Hollings Constructing incomplete actions

and x(g θ) = x · g .

University of York, UK

Globalisation of partial group actions Definition (KL 2004) Let G be a group and let θ : G → IX be a group premorphism. A globalisation of θ is a pair (ι, ϕ) consisting of: an injection ι : X → Y , for some Y ⊇ X , and a morphism ϕ : G → SY such that g θ = ι(g ϕ)ι−1 , for each g ∈ G. The partial action of G on X , as defined by θ, is said to be a restriction of the action of G on Y , as defined by ϕ. Christopher Hollings Constructing incomplete actions

University of York, UK

Partial actions of monoids

Definition (MS 2004) A monoid M acts partially on a set X (on the right) if there is a partial mapping X × M → X , given by (x, s) 7→ x · s, and such that (1) ∃x · 1 and x · 1 = x, for all x ∈ X ; (2) ∃x · s ⇒ [∃(x · s) · t ⇔ ∃x · st], in which case, x · st = (x · s) · t.

Christopher Hollings Constructing incomplete actions

University of York, UK

Monoid premorphisms Proposition (H 2007) The partial action of a monoid M on a set X is equivalent to a monoid premorphism: a function θ : M → PT X such that (1) 1θ = 1; (2) (sθ)(tθ) = (sθ)+ (st)θ, where PT X is the partial transformation monoid on X and (sθ)+ = Idom sθ .

Christopher Hollings Constructing incomplete actions

University of York, UK

Globalisation of partial monoid actions Definition (MS 2004) Let M be a monoid and let θ : M → PT X be a monoid premorphism. A globalisation of θ is a pair (ι, ϕ) consisting of: an injection ι : X → Y , for some Y ⊇ X , and a morphism ϕ : M → TY such that sθ = ι(sϕ)ι−1 , for each s ∈ M. The partial action of M on X , as defined by θ, is said to be a restriction of the action of M on Y , as defined by ϕ. Christopher Hollings Constructing incomplete actions

University of York, UK

Weakly left E -ample semigroups Definition Let S be a semigroup with subsemilattice E ⊆ E (S). We define the following (equivalence) relation on S: e E b ⇐⇒ ∀e ∈ E [ea = a ⇔ eb = b]. aR We call S weakly left E -ample if e E -related to a (necessarily unique) (1) every element a is R idempotent, denoted a+ ; e E is a left congruence; (2) R (3) ae = (ae)+ a, for all a ∈ S and all e ∈ E .

Christopher Hollings Constructing incomplete actions

University of York, UK

Partial actions of weakly left E -ample semigroups

Definition (GH) A weakly left E -ample semigroup S acts partially on a set X (on the right) if there is a partial mapping X × S → X , given by (x, s) 7→ x · s, and such that (1) ∃x · s ⇒ [∃(x · s) · t ⇔ ∃x · st], in which case, x · st = (x · s) · t; (2) ∃x · s ⇒ ∃x · s + and x · s + = x.

Christopher Hollings Constructing incomplete actions

University of York, UK

Incomplete actions of weakly left E -ample semigroups Definition (GH) The incomplete action of a weakly left E -ample semigroup S on a set X (on the right) is a partial mapping X × S → X , given by (x, s) 7→ x · s, and such that (1) ∃x · s and ∃(x · s) · t ⇔ ∃x · st, in which case, x · st = (x · s) · t; (2) ∃x · s ⇔ ∃x · s + and x · s + = x. Such an action is equivalent to a (2,1)-morphism ϕ : S → PT X . Christopher Hollings Constructing incomplete actions

University of York, UK

Premorphisms between weakly left E -ample semigroups

Proposition (GH) The partial action of a weakly left E -ample semigroup S on a set X is equivalent to a premorphism: a function θ : S → PT X such that (1) (sθ)(tθ) = (sθ)+ (st)θ; (2) (sθ)+ ≤ s + θ.

Christopher Hollings Constructing incomplete actions

University of York, UK

Augmented actions Definition (GH) Let S be a weakly left E -ample semigroup and let θ : S → PT X be a premorphism. An augmented action for θ is a pair (ι, ϕ) consisting of: an injection ι : X → Y , for some Y ⊇ X , and a morphism ϕ : S → PT Y such that sθ = ι(sϕ)ι−1 , for each s ∈ S. The partial action of S on X , as defined by θ, is said to be a restriction of the incomplete action of S on Y , as defined by ϕ. Christopher Hollings Constructing incomplete actions

University of York, UK

Partial actions of inverse semigroups Definition (LMS 2006) An inverse semigroup S acts partially on a set X if there is an order-preserving mapping θ : S → IX with (sθ)(tθ) ≤ (st)θ and (sθ)−1 = s −1 θ. Lemma (GH) Let θ : S → T be a function between inverse semigroups. Then θ is a premorphism if, and only if, θ is order-preserving, (sθ)(tθ) ≤ (st)θ and (sθ)−1 = s −1 θ. Lemma (GH) Let S be an inverse semigroup and let θ : S → PT X be a premorphism. Then im θ ⊆ IX . Christopher Hollings Constructing incomplete actions

University of York, UK

Partial actions of inverse semigroups

Theorem (GH) Let S be an inverse semigroup and let θ : S → IX be a premorphism. Then there exists a set Y ⊇ X and a morphism ϕ : S → IX such that sθ = ι(sϕ)ι−1 , for all s ∈ S.

L˜ opp

Christopher Hollings Constructing incomplete actions

University of York, UK

Constructing incomplete actions

The partial action of a group G on a set X is equivalent to a group premorphism: a function θ ... the following (equivalence) relation on S: a ˜RE b ⇐⇒ ∀e ∈ E [ea ...

89KB Sizes 1 Downloads 246 Views

Recommend Documents

Actions and Imagined Actions in Cognitive Robots - Springer Link
service of their actions are gifted with the profound opportunity to mentally ma .... a global workspace (Shanahan 2005), Internal Agent Model (IAM) theory of con ...

Actions and Imagined Actions in Cognitive Robots - Giorgio Metta
in which the robot seeks to achieve its goals consists of specially crafted “stick and ball” versions of real ... ity of pushing objects and further learning to push intelligently in order to avoid randomly placed traps in ... mentally compose a

Constructing Reliable Distributed Communication ... - CiteSeerX
bixTalk, and IBM's MQSeries. The OMG has recently stan- dardized an Event Channel service specification to be used in conjunction with CORBA applications.

constructing connections
CONSTRUCTING CONNECTIONS: MUSEOLOGICAL THEORY AND BLOGGING ... with Web 2.0 include: blogging, wikis, podcasts, tagging, videoblogs, online social .... school age children and increasingly for adults and exhibit making.

Incomplete Contract.pdf
Incomplete Contract.pdf. Incomplete Contract.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Incomplete Contract.pdf. Page 1 of 1.

Incomplete Contract.pdf
An Incomplete is appropri- ate when the instructor has a reasonable expectation that the student can complete the unfinished course. within a specified time ...

Incomplete Grade Procedure -
timeline for removal of the “IC” grade. This agreement ... The exact timeline is at the instructor's discretion however the ... Student's Name: (Last). (First). GSC ID:.

Stable Matching With Incomplete Information
Lastly, we define a notion of price-sustainable allocations and show that the ... KEYWORDS: Stable matching, incomplete information, incomplete information ... Our first order of business is to formulate an appropriate modification of ...... whether

dépliant actions FAD.pdf
Page 1 of 2. FRANCE ALZHEIMER DROME. 33 avenue de Verdun. 26000 VALENCE. 04 75 79 17 08 | [email protected]. www.francealzheimer-drome.org.

Constructing and Exploring Composite Items
an iPhone (i.e., the central item) with a price budget can be presented with ... laptop or a travel destination that must be within a certain distance ..... 6: until {no new item can be added} .... (which turns out to be the best summary in this exam

Epistemological Obstacles in Constructing ... -
in the School of Science and Mathematics Education in the Faculty of Education, University of the Western Cape. .... Words with dual or multiple meaning should also be discussed in mathematics classrooms so that .... EPISTEMOLOGICAL OBSTACLES IN UNDE

Constructing and Sustaining Competitive Knowledge ...
collaborate with business partners to achieve their goals and objectives ... to its supply chain management where respective 'home' dealers co-operate to ... decided to pool their resources together and create an Internet website – a co-opetition p

Constructing Public-key Homomorphic Encryption ...
Sep 13, 2012 - momorphic encryption scheme based on a private-key one that can ... provide solutions to practical security problems; however, they are not ... real world applications require large message spaces; ... systems, and cloud computing appl

Constructing coalescent processes from branching ...
Feb 24, 2017 - Λ-coalescents coalescents with multiple collisions introduced by Pitman(1999) λb,k be the transition rate of any k blocks (out of b blocks) merge in one block it is not possible that two such mergers happens at once. Pitman showed th

Constructing Reliable Distributed Communication Systems with ...
liable distributed object computing systems with CORBA. First, we examine the .... backed by Lotus, Apple, IBM, Borland, MCI, Oracle, Word-. Perfect, and Novell) ...