Is every set a filtered colimit of finite sets?
$begingroup$
Is the following statement correct in the category of sets?
Let $X$ be any set. Then there exists a filtered small category $I$ and a functor $F:Ito mathrm{Set}$ such that for all $iin I$ the set $F(i)$ is finite, and such that
$$
X ; = ; mathrm{colim}_{iin I} F(i) .
$$
Are there references on results of this type in the literature?
reference-request category-theory limits-colimits
$endgroup$
add a comment |
$begingroup$
Is the following statement correct in the category of sets?
Let $X$ be any set. Then there exists a filtered small category $I$ and a functor $F:Ito mathrm{Set}$ such that for all $iin I$ the set $F(i)$ is finite, and such that
$$
X ; = ; mathrm{colim}_{iin I} F(i) .
$$
Are there references on results of this type in the literature?
reference-request category-theory limits-colimits
$endgroup$
1
$begingroup$
One way to generalize this is the notion of a locally finitely presentable category.
$endgroup$
– Derek Elkins
2 days ago
add a comment |
$begingroup$
Is the following statement correct in the category of sets?
Let $X$ be any set. Then there exists a filtered small category $I$ and a functor $F:Ito mathrm{Set}$ such that for all $iin I$ the set $F(i)$ is finite, and such that
$$
X ; = ; mathrm{colim}_{iin I} F(i) .
$$
Are there references on results of this type in the literature?
reference-request category-theory limits-colimits
$endgroup$
Is the following statement correct in the category of sets?
Let $X$ be any set. Then there exists a filtered small category $I$ and a functor $F:Ito mathrm{Set}$ such that for all $iin I$ the set $F(i)$ is finite, and such that
$$
X ; = ; mathrm{colim}_{iin I} F(i) .
$$
Are there references on results of this type in the literature?
reference-request category-theory limits-colimits
reference-request category-theory limits-colimits
edited 2 days ago
Andrés E. Caicedo
65.9k8160252
65.9k8160252
asked 2 days ago
geodudegeodude
4,1911344
4,1911344
1
$begingroup$
One way to generalize this is the notion of a locally finitely presentable category.
$endgroup$
– Derek Elkins
2 days ago
add a comment |
1
$begingroup$
One way to generalize this is the notion of a locally finitely presentable category.
$endgroup$
– Derek Elkins
2 days ago
1
1
$begingroup$
One way to generalize this is the notion of a locally finitely presentable category.
$endgroup$
– Derek Elkins
2 days ago
$begingroup$
One way to generalize this is the notion of a locally finitely presentable category.
$endgroup$
– Derek Elkins
2 days ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
The answer is yes: every set is the union of its finite subsets.
So take $I = P_{text{finite}}(X)$ with as morphisms the inclusion maps, and $F : I to text{Set}$ the inclusion.
$endgroup$
add a comment |
$begingroup$
One answer already mentions the diagram of finite subsets of $X$. You would have to check that taking the union of this system actually is the colimit (which is an easy exercise).
Since you asked for a reference, Locally Presentable and Accessible Categories by J. Adámek and J. Rosický is a great book on this kind of stuff. In particular example 1.2(1) already mentions the diagram of finite subsets.
New contributor
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f3179574%2fis-every-set-a-filtered-colimit-of-finite-sets%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The answer is yes: every set is the union of its finite subsets.
So take $I = P_{text{finite}}(X)$ with as morphisms the inclusion maps, and $F : I to text{Set}$ the inclusion.
$endgroup$
add a comment |
$begingroup$
The answer is yes: every set is the union of its finite subsets.
So take $I = P_{text{finite}}(X)$ with as morphisms the inclusion maps, and $F : I to text{Set}$ the inclusion.
$endgroup$
add a comment |
$begingroup$
The answer is yes: every set is the union of its finite subsets.
So take $I = P_{text{finite}}(X)$ with as morphisms the inclusion maps, and $F : I to text{Set}$ the inclusion.
$endgroup$
The answer is yes: every set is the union of its finite subsets.
So take $I = P_{text{finite}}(X)$ with as morphisms the inclusion maps, and $F : I to text{Set}$ the inclusion.
answered 2 days ago
rabotarabota
14.6k32885
14.6k32885
add a comment |
add a comment |
$begingroup$
One answer already mentions the diagram of finite subsets of $X$. You would have to check that taking the union of this system actually is the colimit (which is an easy exercise).
Since you asked for a reference, Locally Presentable and Accessible Categories by J. Adámek and J. Rosický is a great book on this kind of stuff. In particular example 1.2(1) already mentions the diagram of finite subsets.
New contributor
$endgroup$
add a comment |
$begingroup$
One answer already mentions the diagram of finite subsets of $X$. You would have to check that taking the union of this system actually is the colimit (which is an easy exercise).
Since you asked for a reference, Locally Presentable and Accessible Categories by J. Adámek and J. Rosický is a great book on this kind of stuff. In particular example 1.2(1) already mentions the diagram of finite subsets.
New contributor
$endgroup$
add a comment |
$begingroup$
One answer already mentions the diagram of finite subsets of $X$. You would have to check that taking the union of this system actually is the colimit (which is an easy exercise).
Since you asked for a reference, Locally Presentable and Accessible Categories by J. Adámek and J. Rosický is a great book on this kind of stuff. In particular example 1.2(1) already mentions the diagram of finite subsets.
New contributor
$endgroup$
One answer already mentions the diagram of finite subsets of $X$. You would have to check that taking the union of this system actually is the colimit (which is an easy exercise).
Since you asked for a reference, Locally Presentable and Accessible Categories by J. Adámek and J. Rosický is a great book on this kind of stuff. In particular example 1.2(1) already mentions the diagram of finite subsets.
New contributor
New contributor
answered 2 days ago
Mark KamsmaMark Kamsma
3065
3065
New contributor
New contributor
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.
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%2f3179574%2fis-every-set-a-filtered-colimit-of-finite-sets%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
$begingroup$
One way to generalize this is the notion of a locally finitely presentable category.
$endgroup$
– Derek Elkins
2 days ago