• Nie Znaleziono Wyników

Free objects

N/A
N/A
Protected

Academic year: 2021

Share "Free objects"

Copied!
243
0
0

Pełen tekst

(1)

Adjunctions

(2)

Recall:

Term algebras

Theorem: For any S-sorted set X of variables, Σ-algebra A and valuation

v : X → |A|, there is a unique Σ-homomorphism v# : TΣ(X) → A that extends v, so that

idX ,→|TΣ(X )|;v# = v

X |TΣ(X)|

|A|

TΣ(X)

A -

HH

HH

HH

HH H

j ? ?

idX ,→|TΣ(X )|

v |v#| ∃! v#

SetS Alg(Σ)

(3)

Free objects

Consider any functor G : K0 → K

Definition: Given an object A ∈ |K|, a free object over A w.r.t. G is a K0-object A0 ∈ |K0| together with a K-morphism ηA: A → G(A0) (called unit morphism) such that given any K0-object B0 ∈ |K0| with K-morphism f : A → G(B0), for a unique K0-morphism f#: A0 → B0 we have

ηA;G(f#) = f

Paradigmatic example:

Term algebra TΣ(X) with unit idX ,→|TΣ(X )|: X → |TΣ(X)| is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS

 G

K K0

A ηA - G(A0) A0

B0 G(B0)

H

HH

HH

HH

HHj f

? ?

∃! f# G(f#)

(4)

Free objects

Consider any functor G : K0 → K

Definition: Given an object A ∈ |K|, a free object over A w.r.t. G is a K0-object A0 ∈ |K0| together with a K-morphism ηA: A → G(A0) (called unit morphism) such that given any K0-object B0 ∈ |K0| with K-morphism f : A → G(B0), for a unique K0-morphism f#: A0 → B0 we have

ηA;G(f#) = f

Paradigmatic example:

Term algebra TΣ(X) with unit idX ,→|TΣ(X )|: X → |TΣ(X)| is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS

 G

K K0

A ηA - G(A0) A0

B0 G(B0)

H

HH

HH

HH

HHj f

? ?

∃! f# G(f#)

(5)

Free objects

Consider any functor G : K0 → K

Definition: Given an object A ∈ |K|, a free object over A w.r.t. G is a K0-object A0 ∈ |K0| together with a K-morphism ηA: A → G(A0) (called unit morphism) such that given any K0-object B0 ∈ |K0| with K-morphism f : A → G(B0), for a unique K0-morphism f#: A0 → B0 we have

ηA;G(f#) = f

Paradigmatic example:

Term algebra TΣ(X) with unit idX ,→|TΣ(X )|: X → |TΣ(X)| is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS

 G

K K0

A ηA - G(A0) A0

B0 G(B0)

H

HH

HH

HH

HHj f

? ?

∃! f# G(f#)

(6)

Free objects

Consider any functor G : K0 → K

Definition: Given an object A ∈ |K|, a free object over A w.r.t. G is a K0-object A0 ∈ |K0| together with a K-morphism ηA: A → G(A0) (called unit morphism) such that given any K0-object B0 ∈ |K0| with K-morphism f : A → G(B0), for a unique K0-morphism f#: A0 → B0 we have

ηA;G(f#) = f

Paradigmatic example:

Term algebra TΣ(X) with unit idX ,→|TΣ(X )|: X → |TΣ(X)| is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS

 G

K K0

A ηA - G(A0) A0

B0 G(B0)

H

HH

HH

HH

HHj f

? ?

∃! f# G(f#)

(7)

Free objects

Consider any functor G : K0 → K

Definition: Given an object A ∈ |K|, a free object over A w.r.t. G is a K0-object A0 ∈ |K0| together with a K-morphism ηA: A → G(A0) (called unit morphism) such that given any K0-object B0 ∈ |K0| with K-morphism f : A → G(B0), for a unique K0-morphism f#: A0 → B0 we have

ηA;G(f#) = f

Paradigmatic example:

Term algebra TΣ(X) with unit idX ,→|TΣ(X )|: X → |TΣ(X)| is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS

 G

K K0

A ηA - G(A0) A0

B0 G(B0)

H

HH

HH

HH

HHj f

? ?

∃! f# G(f#)

(8)

Free objects

Consider any functor G : K0 → K

Definition: Given an object A ∈ |K|, a free object over A w.r.t. G is a K0-object A0 ∈ |K0| together with a K-morphism ηA: A → G(A0) (called unit morphism) such that given any K0-object B0 ∈ |K0| with K-morphism f : A → G(B0), for a unique K0-morphism f#: A0 → B0 we have

ηA;G(f#) = f

Paradigmatic example:

Term algebra TΣ(X) with unit idX ,→|TΣ(X )|: X → |TΣ(X)| is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS

 G

K K0

A ηA - G(A0) A0

B0 G(B0)

H

HH

HH

HH

HHj f

? ?

∃! f# G(f#)

(9)

Free objects

Consider any functor G : K0 → K

Definition: Given an object A ∈ |K|, a free object over A w.r.t. G is a K0-object A0 ∈ |K0| together with a K-morphism ηA: A → G(A0) (called unit morphism) such that given any K0-object B0 ∈ |K0| with K-morphism f : A → G(B0), for a unique K0-morphism f#: A0 → B0 we have

ηA;G(f#) = f

Paradigmatic example:

Term algebra TΣ(X) with unit idX ,→|TΣ(X )|: X → |TΣ(X)| is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS

 G

K K0

A ηA - G(A0) A0

B0 G(B0)

H

HH

HH

HH

HHj f

? ?

∃! f# G(f#)

(10)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

(11)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

 i

Real Int

r ≤ - dre dre

k k

H

HH

HH

HH

HHHj

? ?

(12)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

 i

Real Int

r ≤ - dre dre

k k

H

HH

HH

HH

HHHj

? ?

(13)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

 i

Real Int

r ≤ - dre dre

k k

H

HH

HH

HH

HHHj

? ?

(14)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

 i

Real Int

r ≤ - dre dre

k k

H

HH

HH

HH

HHHj

? ?

(15)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

(16)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.



Set | | Monoid

X - X∗ hX∗, b , i

singX

hM, ;, ei M

H

HH

HH

HH

HHHj f

? ?

f# f#

(17)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.



Set | | Monoid

X - X∗ hX∗, b, i

singX

hM, ;, ei M

H

HH

HH

HH

HHHj f

? ?

f# f#

(18)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.



Set | | Monoid

X - X∗ hX∗, b, i

singX

hM, ;, ei M

H

HH

HH

HH

HHHj f

? ?

f# f#

(19)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.



Set | | Monoid

X - X∗ hX∗, b, i

singX

hM, ;, ei M

H

HH

HH

HH

HHHj f

? ?

f# f#

(20)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.

• For any graph G ∈ |Graph|, the category of its paths, Path(G) ∈ |Cat|, is free over G w.r.t. the graph functor G : Cat → Graph.

(21)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.

• For any graph G ∈ |Graph|, the category of its paths, Path(G) ∈ |Cat|, is free over G w.r.t. the graph functor G : Cat → Graph.

 G

Graph Cat

G - G(Path(G)) Path(G)

G(K) K HH

HH

HH

HH H j h

? ?

h# h#

(22)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.

• For any graph G ∈ |Graph|, the category of its paths, Path(G) ∈ |Cat|, is free over G w.r.t. the graph functor G : Cat → Graph.

 G

Graph Cat

G - G(Path(G)) Path(G)

G(K) K HH

HH

HH

HH H j h

? ?

h# h#

(23)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.

• For any graph G ∈ |Graph|, the category of its paths, Path(G) ∈ |Cat|, is free over G w.r.t. the graph functor G : Cat → Graph.

 G

Graph Cat

G - G(Path(G)) Path(G)

G(K) K HH

HH

HH

HH H j h

? ?

h# h#

(24)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.

• For any graph G ∈ |Graph|, the category of its paths, Path(G) ∈ |Cat|, is free over G w.r.t. the graph functor G : Cat → Graph.

 G

Graph Cat

G - G(Path(G)) Path(G)

G(K) K HH

HH

HH

HH H j h

? ?

h# h#

(25)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.

• For any graph G ∈ |Graph|, the category of its paths, Path(G) ∈ |Cat|, is free over G w.r.t. the graph functor G : Cat → Graph.

• Discrete topologies, completion of metric spaces, free groups, ideal completion of partial orders, ideal completion of free partial algebras, . . .

Makes precise these and other similar examples Indicate unit morphisms!

(26)

Examples

• Consider inclusion i : Int ,→ Real, viewing Int and Real as (thin) categories, and i as a functor between them. For any real r ∈ Real, the ceiling of r,

dre ∈ Int is free over r w.r.t. i.

What about free objects w.r.t. the inclusion of rationals into reals?

• For any set X ∈ |Set|, the “free monoid” List(X) = hX∗, b, i is free over X w.r.t. | | : Monoid → Set.

• For any graph G ∈ |Graph|, the category of its paths, Path(G) ∈ |Cat|, is free over G w.r.t. the graph functor G : Cat → Graph.

• Discrete topologies, completion of metric spaces, free groups, ideal completion of partial orders, ideal completion of free partial algebras, . . .

Makes precise these and other similar examples Indicate unit morphisms!

(27)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.

(28)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.

(29)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.



| |

SetS Alg(Σ)

X - |TΣ(X)| TΣ(X)

idX ,→|TΣ(X )|

|B| B H

HH

HH

HH

HHj f

? ?

f# f#

(30)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.

• For any set of Σ-equations Φ, for any set X ∈ |SetS|, there exist a model FΦ(X) ∈ Mod (Φ) that is free over X w.r.t. the carrier functor

| | : Mod(hΣ, Φi) → SetS, where Mod(hΣ, Φi) is the full subcategory of Alg(Σ) given by the models of Φ.

(31)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.

• For any set of Σ-equations Φ, for any set X ∈ |SetS|, there exist a model FΦ(X) ∈ Mod (Φ) that is free over X w.r.t. the carrier functor

| | : Mod(hΣ, Φi) → SetS, where Mod(hΣ, Φi) is the full subcategory of

Alg(Σ) given by the models of Φ. Recall: FΦ(X) is TΣ(X)/≡, where ≡ is the congruence on TΣ(X) such that t1 ≡ t2 iff Φ |= ∀X.t1 = t2.



| |

SetS Mod(hΣ, Φi)

X - |FΦ(X)| FΦ(X)

[ ]

|B| B H

HH

HH

HH

HHj f

? ?

f# f#

(32)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.

• For any set of Σ-equations Φ, for any set X ∈ |SetS|, there exist a model FΦ(X) ∈ Mod (Φ) that is free over X w.r.t. the carrier functor

| | : Mod(hΣ, Φi) → SetS, where Mod(hΣ, Φi) is the full subcategory of

Alg(Σ) given by the models of Φ. Recall: FΦ(X) is TΣ(X)/≡, where ≡ is the congruence on TΣ(X) such that t1 ≡ t2 iff Φ |= ∀X.t1 = t2.



| |

SetS Mod(hΣ, Φi)

X - |FΦ(X)| FΦ(X)

[ ]

|B| B H

HH

HH

HH

HHj f

? ?

f# f#

(33)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.

• For any set of Σ-equations Φ, for any set X ∈ |SetS|, there exist a model FΦ(X) ∈ Mod (Φ) that is free over X w.r.t. the carrier functor

| | : Mod(hΣ, Φi) → SetS, where Mod(hΣ, Φi) is the full subcategory of Alg(Σ) given by the models of Φ.

• For any algebraic signature morphism σ : Σ → Σ0, for any Σ-algebra

A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

• For any equational specification morphism σ : hΣ, Φi → hΣ0, Φ0i, for any model A ∈ Mod (Φ), there exist a model FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t.

the reduct functor σ : Mod(hΣ0, Φ0i) → Mod(hΣ, Φi).

Prove the above.

(34)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]













( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(35)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]













( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(36)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]













( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(37)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)

• [ ]: A → (TΣ0(|A|)/≡) σ is indeed a Σ-homomorphism, since [fA(a1, . . . , an)] = [f (a1, . . . , an)] = fT

Σ0(|A|)/≡([a1], . . . , [an])



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]













( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(38)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)

• for B0 ∈ |Alg(Σ0)| and h : A → B0 σ, consider ( )B0[h] : TΣ0(|A|) → B0. Then ≡ ⊆ K(( )B0[h]),



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]













( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(39)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)

• for B0 ∈ |Alg(Σ0)| and h : A → B0 σ, consider ( )B0[h] : TΣ0(|A|) → B0. Then ≡ ⊆ K(( )B0[h]),



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]













( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(40)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)

• for B0 ∈ |Alg(Σ0)| and h : A → B0 σ, consider ( )B0[h] : TΣ0(|A|) → B0. Then ≡ ⊆ K(( )B0[h]),



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]













( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(41)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)

• for B0 ∈ |Alg(Σ0)| and h : A → B0 σ, consider ( )B0[h] : TΣ0(|A|) → B0. Then ≡ ⊆ K(( )B0[h]), since:

hs(fA(a1, . . . , an)) = fB0(hs1(a1), . . . , hsn(an)) = (f (a1, . . . , an))B0[h]



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]















( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(42)

Fact: For any algebraic signature inclusion σ : Σ ,→ Σ , for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

Proof (idea): Define Fσ(A) to be TΣ0(|A|)/≡ with unit [ ]: A → (TΣ0(|A|)/≡) σ, where ≡ is the least congruence on TΣ0(|A|) such that for f : s1 × . . . ×n → s in Σ and a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ f (a1, . . . , an)

• for B0 ∈ |Alg(Σ0)| and h : A → B0 σ, consider ( )B0[h] : TΣ0(|A|) → B0. Then ≡ ⊆ K(( )B0[h]), and so there is unique Σ0-homomorphism

h#: (TΣ0(|A|)/≡) → B0 such that [ ];h# = ( )B0[h].



Alg(Σ) σ Alg(Σ0)

A  TΣ0(|A|)

[ ] TΣ0(|A|)/≡

(TΣ0(|A|)/≡) σ -

[ ]















( )B0[h]

B0 B0 σ

H

HH

HH

HH

HHj h

? ?

h# h# σ

(43)

Free equational models

• Recall: for any algebraic signature Σ = hS, Ωi, term algebra TΣ(X) is free over X ∈ |SetS| w.r.t. the carrier functor | | : Alg(Σ) → SetS.

• For any set of Σ-equations Φ, for any set X ∈ |SetS|, there exist a model FΦ(X) ∈ Mod (Φ) that is free over X w.r.t. the carrier functor

| | : Mod(hΣ, Φi) → SetS, where Mod(hΣ, Φi) is the full subcategory of Alg(Σ) given by the models of Φ.

• For any algebraic signature morphism σ : Σ → Σ0, for any Σ-algebra

A ∈ |Alg(Σ)|, there exist a Σ0-algebra Fσ(A) ∈ |Alg(Σ0)| that is free over A w.r.t. the reduct functor σ : Alg(Σ0) → Alg(Σ).

• For any equational specification morphism σ : hΣ, Φi → hΣ0, Φ0i, for any model A ∈ Mod (Φ), there exist a model FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t.

the reduct functor σ : Mod(hΣ0, Φ0i) → Mod(hΣ, Φi).

Prove the above.

(44)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ]

TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]















( )B0[h0] B0

B0 σ HH

HH

HH

HH H j h

? ?

h# h# σ

(45)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ]

TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]















( )B0[h0] B0

B0 σ HH

HH

HH

HH H j h

? ?

h# h# σ

(46)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ]

TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]















( )B0[h0] B0

B0 σ HH

HH

HH

HH H j h

? ?

h# h# σ

(47)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ]

TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]















( )B0[h0] B0

B0 σ HH

HH

HH

HH H j h

? ?

h# h# σ

(48)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ]

TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]















( )B0[h0] B0

B0 σ HH

HH

HH

HH H j h

? ?

h# h# σ

(49)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)

• TΣ0(|A|)/≡ |= Φ0, i.e. indeed TΣ0(|A|)/≡ ∈ Mod (Φ0)



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ]

TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]















( )B0[h0] B0

B0 σ HH

HH

HH

HH H j h

? ?

h# h# σ

(50)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)

• [ ]: A → (TΣ0(|A|)/≡) σ is indeed a Σ-homomorphism, since [fA(a1, . . . , an)] = [σ(f )(a1, . . . , an)] = f(T

Σ0(X0)/≡) σ([a1], . . . , [an])



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ] TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]













( )B0[h0] B0

B0 σ H

HH

HH

HH

HHj h

? ?

h# h# σ

(51)

Fact: For any algebraic signature morphism σ : Σ → Σ and set Φ of Σ -equations, for any Σ-algebra A ∈ |Alg(Σ)|, there exist a Σ0-algebra FΦσ0(A) ∈ Mod (Φ0) that is free over A w.r.t. the reduct functor σ : Mod(hΣ0, Φ0i) → Alg(Σ).

Proof (idea): Define FΦσ0(A) to be TΣ0(X0)/≡ with unit [ ]: A → (TΣ0(X0)/≡) σ, where Xs00 = U

σ(s)=s0 |A|s and ≡ is the least congruence on TΣ0(X0) such that t1 ≡ t2 when Φ0 |= ∀X0.t1 = t2 as well as for f : s1 × . . . ×n → s in Σ and

a1 ∈ |A|s1,. . . ,an ∈ |A|s1, fA(a1, . . . , an) ≡ σ(f )(a1, . . . , an)

• for B0 ∈ |Mod(hΣ0, Φ0i)| and h : A → B0 σ, ≡ ⊆ K(( )B0[h0]) (h0: X0 → |B0| is as h),



Alg(Σ) σ Mod(hΣ0, Φ0i) ⊆ Alg(Σ0)

A  TΣ0(X0)

[ ] TΣ0(X0)/≡

(TΣ0(X0)/≡) σ -

[ ]













( )B0[h0] B0

B0 σ HH

HH

HH

HH H j h

? ?

h# h# σ

Cytaty

Powiązane dokumenty

The paper was an important starting point for investigations of the problem of how an order between two matrices A and B from different sets of matrices can be preserved for the

An algebra B is said to be representable if it is isomorphic to a partitioner algebra for some mad (maximal almost disjoint) family M.. See [2] for

In this note we answer this question in the affirmative in the first non-trivial case when l = 3 and the group is abelian, proving the following

This is stated in this form in Alon and Spencer [1, Theorem 3.2] and is a corollary to either Fortuin, Kasteleyn and Ginibre’s inequality [4] (the usual approach), or to an

Now define the category Q-Mod of quantale modules or in other words the category of enriched complete lattices over the category JCPos..

Our aim here is to get a ZFC result (under reasonable cardinal arithmetic assumptions) which implies that our looking for (κ, notλ)-Knaster marked Boolean algebras near strong

If C is a HFG Fraïssé class with EPPA as well as symmetric AP and JEP, M is the Fraïssé limit of C, ¯σ is a generic n-tuple of automorphisms of M and ¯w is an m-tuple freely

• Discrete topologies, completion of metric spaces, free groups, ideal completion of partial orders, ideal completion of free partial algebras,.. Makes precise these and other