States on Subtraction Algebras 1 Introduction
States on Subtraction Algebras 1 Introduction
States on Subtraction Algebras 1 Introduction
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
1160 Sang Mo<strong>on</strong> Lee and Kyung Ho Kim<br />
let x, y ∈ X. Then<br />
t(x)+t(y − x) =(s ◦ f)(x)+(s ◦ f)(y − x)<br />
= s(f(x)) + s(f(y) − f(x))<br />
= s(f(y)) + s(f(x) − f(y))<br />
= s(f(y)) + s(f(x − y))<br />
=(s ◦ f)(y)+(s ◦ f)(x − y)<br />
= t(y)+t(x − y).<br />
Hence t is a Bosbach state. Finally, we prove that t is unique. Suppose that<br />
there exists an another Bosbach state r : X → [0, 1] such that r = s ◦ f. Then<br />
r(x) =(s ◦ f)(x) =t(x) for all x ∈ X. Hence we have r = t.<br />
Theorem 3.9. Let f : X → Y be a bijecti<strong>on</strong> homomorphism and s : X →<br />
[0, 1] be a Bosbach state <strong>on</strong> X. Then there exists an unique Bosbach state<br />
t : Y → [0, 1] such that s = t ◦ f.<br />
X f Y<br />
s<br />
<br />
∃t<br />
[0, 1]<br />
Proof. Let y ∈ Y. Since f is <strong>on</strong>to, there exists x ∈ X such that f(x) =y. Put<br />
t(y) =s(x). Then t(y) =t(f(x)) = (t◦f)(x) =s(x), and so t◦f = s. Since f is<br />
<strong>on</strong>e to <strong>on</strong>e, then Ker(f) =0, and so t(0) = t(f(0)) = (t◦f)(0) = s(0) = 0. Let<br />
y 1 ,y 2 ∈ Y. Then there exists x 1 ,x 2 ∈ X such that f(x 1 )=y 1 and f(x 2 )=y 2 .<br />
Then we have<br />
t(y 1 )+t(y 2 − y 1 )=t(f(x 1 )+t(f(x 2 ) − f(x 1 ))<br />
= t(f(x 1 )+t(f(x 2 − x 1 ))<br />
=(t ◦ f)(x 1 )+(t ◦ f)(x 2 − x 1 )<br />
= s(x 1 )+s(x 2 − x 1 )<br />
= s(x 2 )+s(x 1 − x 2 )<br />
=(t ◦ f)(x 2 )+(t ◦ f)(x 1 − x 2 )<br />
=(t(f(x 2 )+t(f(x 1 − x 2 ))<br />
= t(f(x 2 )) + t(f(x 1 ) − f(x 2 ))<br />
= t(y 2 )+t(y 1 − y 2 ).<br />
Hence t is a Bosbach state. Suppose that there exists an another Bosbach<br />
state r : X → [0, 1] such that s = r ◦ f. Let y ∈ Y. Then there exists x ∈ X