28.04.2014 Views

States on Subtraction Algebras 1 Introduction

States on Subtraction Algebras 1 Introduction

States on Subtraction Algebras 1 Introduction

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<str<strong>on</strong>g>States</str<strong>on</strong>g> <strong>on</strong> subtracti<strong>on</strong> algebras 1159<br />

Propositi<strong>on</strong> 3.5. Let s : X → [0, 1] be a Bosbach state <strong>on</strong> X. Then If x ≤ y,<br />

then s(x) ≤ s(y) and s(x)+s(y − x) =s(y).<br />

Proof. Let s be a Bosbach state <strong>on</strong> X and x ≤ y. Then x − y =0. Since<br />

s(x)+s(y−x) =s(y)+s(x−y), we have 0 ≤ s(y−x) =s(x−y)+s(y)−s(x)=<br />

0+s(y) − s(x) =s(y) − s(x), and so s(y) ≥ s(x).<br />

Propositi<strong>on</strong> 3.6. Let s : X → [0, 1] be a Bosbach state <strong>on</strong> X. Then Ker(s)<br />

is a subalgebra of X.<br />

Proof. Let x, y ∈ Ker(s). Then s(x) =s(y) =0. Since x − y ≤ x, we have<br />

s(x − y) ≤ s(x) by Propositi<strong>on</strong> 3.5, and so 0 ≤ s(x − y) ≤ s(x) =0. This<br />

implies s(x − y) =0, i.e., x − y ∈ Ker(s).<br />

Propositi<strong>on</strong> 3.7.<br />

is an ideal of X.<br />

Let s : X → [0, 1] be a Bosbach state <strong>on</strong> X. Then Ker(s)<br />

Proof. Since s(0) = 0, we have 0 ∈ Ker(s). Let x − y ∈ Ker(s) and y ∈<br />

Ker(s). So, s(x − y) =s(y) =0. Since y − x ≤ y, we have s(y − x) ≤ s(y) by<br />

Propositi<strong>on</strong> 3.5, which implies 0 ≤ s(x − y) ≤ s(y) =0. Hence s(y − x) =0.<br />

Now, since s(x)+s(y − x) =s(y)+s(x − y), we obtain s(x)+0=0+0. This<br />

implies s(x) =0, i.e., x ∈ Ker(s).<br />

Theorem 3.8. Let f : X → Y be a homomorphism and s : Y → [0, 1] be a<br />

Bosbach state <strong>on</strong> Y. Then there exists an unique Bosbach state t : X → [0, 1]<br />

such that the following diagram is commutative (i.e., t = s ◦ f).<br />

X f <br />

Y<br />

<br />

s<br />

∃t <br />

[0, 1]<br />

Proof. Let t := s ◦ f. It is clear that t is well-defined. Now we show that t is<br />

a Bosbach state. We know that t(0) = (s ◦ f)(0) = s(f(0)) = s(0) = 0. Now,

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!