Internal and external generalization in category theory?
up vote
1
down vote
favorite
I've heard the words "internal" and "external" generalization of concepts in category theory.
Specifically, i heard the idea that the concept of 'power set' has an internal and an external generalization in category theory.
What is the difference between these two?
category-theory
add a comment |
up vote
1
down vote
favorite
I've heard the words "internal" and "external" generalization of concepts in category theory.
Specifically, i heard the idea that the concept of 'power set' has an internal and an external generalization in category theory.
What is the difference between these two?
category-theory
1
Could you provide the reference where you have read such stuff?
– Giorgio Mossa
Nov 21 at 10:38
1
@GiorgioMossa, Unfortunately, no. I looked for it before asking this question. I only recall that the internal generalization of power set of $A$ was, the exponential object $(1+1)^A$, or something like that.
– user56834
Nov 21 at 11:12
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I've heard the words "internal" and "external" generalization of concepts in category theory.
Specifically, i heard the idea that the concept of 'power set' has an internal and an external generalization in category theory.
What is the difference between these two?
category-theory
I've heard the words "internal" and "external" generalization of concepts in category theory.
Specifically, i heard the idea that the concept of 'power set' has an internal and an external generalization in category theory.
What is the difference between these two?
category-theory
category-theory
asked Nov 21 at 8:46
user56834
3,14321149
3,14321149
1
Could you provide the reference where you have read such stuff?
– Giorgio Mossa
Nov 21 at 10:38
1
@GiorgioMossa, Unfortunately, no. I looked for it before asking this question. I only recall that the internal generalization of power set of $A$ was, the exponential object $(1+1)^A$, or something like that.
– user56834
Nov 21 at 11:12
add a comment |
1
Could you provide the reference where you have read such stuff?
– Giorgio Mossa
Nov 21 at 10:38
1
@GiorgioMossa, Unfortunately, no. I looked for it before asking this question. I only recall that the internal generalization of power set of $A$ was, the exponential object $(1+1)^A$, or something like that.
– user56834
Nov 21 at 11:12
1
1
Could you provide the reference where you have read such stuff?
– Giorgio Mossa
Nov 21 at 10:38
Could you provide the reference where you have read such stuff?
– Giorgio Mossa
Nov 21 at 10:38
1
1
@GiorgioMossa, Unfortunately, no. I looked for it before asking this question. I only recall that the internal generalization of power set of $A$ was, the exponential object $(1+1)^A$, or something like that.
– user56834
Nov 21 at 11:12
@GiorgioMossa, Unfortunately, no. I looked for it before asking this question. I only recall that the internal generalization of power set of $A$ was, the exponential object $(1+1)^A$, or something like that.
– user56834
Nov 21 at 11:12
add a comment |
2 Answers
2
active
oldest
votes
up vote
2
down vote
First of all one need to understand the concept of internalization.
Generally many classical constructions which can be given inside some specific category (usually $mathbf{Set}$) can be expressed in the language of category theory in terms of objects, arrows and more generally diagrams.
Once one has a such diagrammatic definition of the construction it is possible to use the same definition to other categories, providing a new version of the construction internal to the new category.
So internalization is about defining concepts in terms of diagrams in a (possibly structured) category, in such a way that once one interprets these concepts in some specific categories (usually $mathbf{Set}$) they get the classical notions that have been internalized.
As an example you can consider an internal monoid in a monidal category, which is a diagram made of morphisms of the form $X otimes X to X$ and $I to X$ that make commute certain diagrams.
Externalization is about turing the internalized data in $mathbf{Set}$-theoretic data.
More technically externalization is the process of mapping the internal data via the yoneda embedding.
So the externalization of an internal data (which amounts to a diagram satisfying certain properties) in a category $mathbf C$ is basically the corresponding diagram internal to $[mathbf C^text{op},mathbf{Set}]$.
Continuing with the example of a monoidal category $mathbf C$, the externalization turns the data of an internal monoid $(X,X otimes X to X,I to X)$ are in a monoid object $$(hom(-,X),hom(-,X)timeshom(-,X) to hom(-,X),hom(-,I) to hom(-,X))$$ in $[mathbf C^text{op},mathbf{Set}]$.
So far it should be clear why internalization is basically a generalization of classical notions: because classical notion are special version (i.e. usually internal to $mathbf{Set}$) of the internal concept.
Externalization provides a different way to generalize, or if you like internalize, concepts.
Neverless this would be difficult to explain in the general case, so I prefer to stop here.
Anyway if you feel the need for additional details feel free to ask.
I hope this helps.
add a comment |
up vote
0
down vote
Categorial internalisation is about taking a statement
that involves “points”, which is the usual Set theoretic rendition,
and turning it “point free” so that it is soley rendered in the
language of category theory.
For example, an adjoint between preorders is a pair $f, g$ such that
$$∀ x, y • quad f,x ≤ y ;;≡;; x ≤′ g, y$$
Notice the “points” $x$ and $y$ from each preorder being utilised.
However, if we move from the category Set to the category Rel, for example,
to consider relations. Then a preorder is reflexive and transitive relation;
let us use $E$ in-place of $≤$. Then the above can be rephrased with no points
$$ f˘;E ;=; E′;g˘$$
Where $-;-$ is relational composition and $-˘$ is relational converse.
This is another form of internalisation; it is about rephrasing statements that use,
e.g., logical connectives $forall, Rightarrow$, into forms that do not use them.
For example, see this presentation of Cartesian Closed Categories in the case of preorders
where properties are shown using, e.g., ∀, then later obtained without it; e.g., having
internal homs $[X, Y]$ the fact
$$text{there is a unique map from $X$ to the initial object 𝑰}$$
Can be internalised, i.e., rendered without using the logical notion of existence as
$$ [X, 𝑰] ;≅; 𝑰$$
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
First of all one need to understand the concept of internalization.
Generally many classical constructions which can be given inside some specific category (usually $mathbf{Set}$) can be expressed in the language of category theory in terms of objects, arrows and more generally diagrams.
Once one has a such diagrammatic definition of the construction it is possible to use the same definition to other categories, providing a new version of the construction internal to the new category.
So internalization is about defining concepts in terms of diagrams in a (possibly structured) category, in such a way that once one interprets these concepts in some specific categories (usually $mathbf{Set}$) they get the classical notions that have been internalized.
As an example you can consider an internal monoid in a monidal category, which is a diagram made of morphisms of the form $X otimes X to X$ and $I to X$ that make commute certain diagrams.
Externalization is about turing the internalized data in $mathbf{Set}$-theoretic data.
More technically externalization is the process of mapping the internal data via the yoneda embedding.
So the externalization of an internal data (which amounts to a diagram satisfying certain properties) in a category $mathbf C$ is basically the corresponding diagram internal to $[mathbf C^text{op},mathbf{Set}]$.
Continuing with the example of a monoidal category $mathbf C$, the externalization turns the data of an internal monoid $(X,X otimes X to X,I to X)$ are in a monoid object $$(hom(-,X),hom(-,X)timeshom(-,X) to hom(-,X),hom(-,I) to hom(-,X))$$ in $[mathbf C^text{op},mathbf{Set}]$.
So far it should be clear why internalization is basically a generalization of classical notions: because classical notion are special version (i.e. usually internal to $mathbf{Set}$) of the internal concept.
Externalization provides a different way to generalize, or if you like internalize, concepts.
Neverless this would be difficult to explain in the general case, so I prefer to stop here.
Anyway if you feel the need for additional details feel free to ask.
I hope this helps.
add a comment |
up vote
2
down vote
First of all one need to understand the concept of internalization.
Generally many classical constructions which can be given inside some specific category (usually $mathbf{Set}$) can be expressed in the language of category theory in terms of objects, arrows and more generally diagrams.
Once one has a such diagrammatic definition of the construction it is possible to use the same definition to other categories, providing a new version of the construction internal to the new category.
So internalization is about defining concepts in terms of diagrams in a (possibly structured) category, in such a way that once one interprets these concepts in some specific categories (usually $mathbf{Set}$) they get the classical notions that have been internalized.
As an example you can consider an internal monoid in a monidal category, which is a diagram made of morphisms of the form $X otimes X to X$ and $I to X$ that make commute certain diagrams.
Externalization is about turing the internalized data in $mathbf{Set}$-theoretic data.
More technically externalization is the process of mapping the internal data via the yoneda embedding.
So the externalization of an internal data (which amounts to a diagram satisfying certain properties) in a category $mathbf C$ is basically the corresponding diagram internal to $[mathbf C^text{op},mathbf{Set}]$.
Continuing with the example of a monoidal category $mathbf C$, the externalization turns the data of an internal monoid $(X,X otimes X to X,I to X)$ are in a monoid object $$(hom(-,X),hom(-,X)timeshom(-,X) to hom(-,X),hom(-,I) to hom(-,X))$$ in $[mathbf C^text{op},mathbf{Set}]$.
So far it should be clear why internalization is basically a generalization of classical notions: because classical notion are special version (i.e. usually internal to $mathbf{Set}$) of the internal concept.
Externalization provides a different way to generalize, or if you like internalize, concepts.
Neverless this would be difficult to explain in the general case, so I prefer to stop here.
Anyway if you feel the need for additional details feel free to ask.
I hope this helps.
add a comment |
up vote
2
down vote
up vote
2
down vote
First of all one need to understand the concept of internalization.
Generally many classical constructions which can be given inside some specific category (usually $mathbf{Set}$) can be expressed in the language of category theory in terms of objects, arrows and more generally diagrams.
Once one has a such diagrammatic definition of the construction it is possible to use the same definition to other categories, providing a new version of the construction internal to the new category.
So internalization is about defining concepts in terms of diagrams in a (possibly structured) category, in such a way that once one interprets these concepts in some specific categories (usually $mathbf{Set}$) they get the classical notions that have been internalized.
As an example you can consider an internal monoid in a monidal category, which is a diagram made of morphisms of the form $X otimes X to X$ and $I to X$ that make commute certain diagrams.
Externalization is about turing the internalized data in $mathbf{Set}$-theoretic data.
More technically externalization is the process of mapping the internal data via the yoneda embedding.
So the externalization of an internal data (which amounts to a diagram satisfying certain properties) in a category $mathbf C$ is basically the corresponding diagram internal to $[mathbf C^text{op},mathbf{Set}]$.
Continuing with the example of a monoidal category $mathbf C$, the externalization turns the data of an internal monoid $(X,X otimes X to X,I to X)$ are in a monoid object $$(hom(-,X),hom(-,X)timeshom(-,X) to hom(-,X),hom(-,I) to hom(-,X))$$ in $[mathbf C^text{op},mathbf{Set}]$.
So far it should be clear why internalization is basically a generalization of classical notions: because classical notion are special version (i.e. usually internal to $mathbf{Set}$) of the internal concept.
Externalization provides a different way to generalize, or if you like internalize, concepts.
Neverless this would be difficult to explain in the general case, so I prefer to stop here.
Anyway if you feel the need for additional details feel free to ask.
I hope this helps.
First of all one need to understand the concept of internalization.
Generally many classical constructions which can be given inside some specific category (usually $mathbf{Set}$) can be expressed in the language of category theory in terms of objects, arrows and more generally diagrams.
Once one has a such diagrammatic definition of the construction it is possible to use the same definition to other categories, providing a new version of the construction internal to the new category.
So internalization is about defining concepts in terms of diagrams in a (possibly structured) category, in such a way that once one interprets these concepts in some specific categories (usually $mathbf{Set}$) they get the classical notions that have been internalized.
As an example you can consider an internal monoid in a monidal category, which is a diagram made of morphisms of the form $X otimes X to X$ and $I to X$ that make commute certain diagrams.
Externalization is about turing the internalized data in $mathbf{Set}$-theoretic data.
More technically externalization is the process of mapping the internal data via the yoneda embedding.
So the externalization of an internal data (which amounts to a diagram satisfying certain properties) in a category $mathbf C$ is basically the corresponding diagram internal to $[mathbf C^text{op},mathbf{Set}]$.
Continuing with the example of a monoidal category $mathbf C$, the externalization turns the data of an internal monoid $(X,X otimes X to X,I to X)$ are in a monoid object $$(hom(-,X),hom(-,X)timeshom(-,X) to hom(-,X),hom(-,I) to hom(-,X))$$ in $[mathbf C^text{op},mathbf{Set}]$.
So far it should be clear why internalization is basically a generalization of classical notions: because classical notion are special version (i.e. usually internal to $mathbf{Set}$) of the internal concept.
Externalization provides a different way to generalize, or if you like internalize, concepts.
Neverless this would be difficult to explain in the general case, so I prefer to stop here.
Anyway if you feel the need for additional details feel free to ask.
I hope this helps.
edited Nov 22 at 12:44
answered Nov 21 at 16:15
Giorgio Mossa
13.7k11748
13.7k11748
add a comment |
add a comment |
up vote
0
down vote
Categorial internalisation is about taking a statement
that involves “points”, which is the usual Set theoretic rendition,
and turning it “point free” so that it is soley rendered in the
language of category theory.
For example, an adjoint between preorders is a pair $f, g$ such that
$$∀ x, y • quad f,x ≤ y ;;≡;; x ≤′ g, y$$
Notice the “points” $x$ and $y$ from each preorder being utilised.
However, if we move from the category Set to the category Rel, for example,
to consider relations. Then a preorder is reflexive and transitive relation;
let us use $E$ in-place of $≤$. Then the above can be rephrased with no points
$$ f˘;E ;=; E′;g˘$$
Where $-;-$ is relational composition and $-˘$ is relational converse.
This is another form of internalisation; it is about rephrasing statements that use,
e.g., logical connectives $forall, Rightarrow$, into forms that do not use them.
For example, see this presentation of Cartesian Closed Categories in the case of preorders
where properties are shown using, e.g., ∀, then later obtained without it; e.g., having
internal homs $[X, Y]$ the fact
$$text{there is a unique map from $X$ to the initial object 𝑰}$$
Can be internalised, i.e., rendered without using the logical notion of existence as
$$ [X, 𝑰] ;≅; 𝑰$$
add a comment |
up vote
0
down vote
Categorial internalisation is about taking a statement
that involves “points”, which is the usual Set theoretic rendition,
and turning it “point free” so that it is soley rendered in the
language of category theory.
For example, an adjoint between preorders is a pair $f, g$ such that
$$∀ x, y • quad f,x ≤ y ;;≡;; x ≤′ g, y$$
Notice the “points” $x$ and $y$ from each preorder being utilised.
However, if we move from the category Set to the category Rel, for example,
to consider relations. Then a preorder is reflexive and transitive relation;
let us use $E$ in-place of $≤$. Then the above can be rephrased with no points
$$ f˘;E ;=; E′;g˘$$
Where $-;-$ is relational composition and $-˘$ is relational converse.
This is another form of internalisation; it is about rephrasing statements that use,
e.g., logical connectives $forall, Rightarrow$, into forms that do not use them.
For example, see this presentation of Cartesian Closed Categories in the case of preorders
where properties are shown using, e.g., ∀, then later obtained without it; e.g., having
internal homs $[X, Y]$ the fact
$$text{there is a unique map from $X$ to the initial object 𝑰}$$
Can be internalised, i.e., rendered without using the logical notion of existence as
$$ [X, 𝑰] ;≅; 𝑰$$
add a comment |
up vote
0
down vote
up vote
0
down vote
Categorial internalisation is about taking a statement
that involves “points”, which is the usual Set theoretic rendition,
and turning it “point free” so that it is soley rendered in the
language of category theory.
For example, an adjoint between preorders is a pair $f, g$ such that
$$∀ x, y • quad f,x ≤ y ;;≡;; x ≤′ g, y$$
Notice the “points” $x$ and $y$ from each preorder being utilised.
However, if we move from the category Set to the category Rel, for example,
to consider relations. Then a preorder is reflexive and transitive relation;
let us use $E$ in-place of $≤$. Then the above can be rephrased with no points
$$ f˘;E ;=; E′;g˘$$
Where $-;-$ is relational composition and $-˘$ is relational converse.
This is another form of internalisation; it is about rephrasing statements that use,
e.g., logical connectives $forall, Rightarrow$, into forms that do not use them.
For example, see this presentation of Cartesian Closed Categories in the case of preorders
where properties are shown using, e.g., ∀, then later obtained without it; e.g., having
internal homs $[X, Y]$ the fact
$$text{there is a unique map from $X$ to the initial object 𝑰}$$
Can be internalised, i.e., rendered without using the logical notion of existence as
$$ [X, 𝑰] ;≅; 𝑰$$
Categorial internalisation is about taking a statement
that involves “points”, which is the usual Set theoretic rendition,
and turning it “point free” so that it is soley rendered in the
language of category theory.
For example, an adjoint between preorders is a pair $f, g$ such that
$$∀ x, y • quad f,x ≤ y ;;≡;; x ≤′ g, y$$
Notice the “points” $x$ and $y$ from each preorder being utilised.
However, if we move from the category Set to the category Rel, for example,
to consider relations. Then a preorder is reflexive and transitive relation;
let us use $E$ in-place of $≤$. Then the above can be rephrased with no points
$$ f˘;E ;=; E′;g˘$$
Where $-;-$ is relational composition and $-˘$ is relational converse.
This is another form of internalisation; it is about rephrasing statements that use,
e.g., logical connectives $forall, Rightarrow$, into forms that do not use them.
For example, see this presentation of Cartesian Closed Categories in the case of preorders
where properties are shown using, e.g., ∀, then later obtained without it; e.g., having
internal homs $[X, Y]$ the fact
$$text{there is a unique map from $X$ to the initial object 𝑰}$$
Can be internalised, i.e., rendered without using the logical notion of existence as
$$ [X, 𝑰] ;≅; 𝑰$$
answered Nov 22 at 10:57
Musa Al-hassy
1,2971711
1,2971711
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007443%2finternal-and-external-generalization-in-category-theory%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
Could you provide the reference where you have read such stuff?
– Giorgio Mossa
Nov 21 at 10:38
1
@GiorgioMossa, Unfortunately, no. I looked for it before asking this question. I only recall that the internal generalization of power set of $A$ was, the exponential object $(1+1)^A$, or something like that.
– user56834
Nov 21 at 11:12