Can you express this easy theorem in fancy categorical terms?












6












$begingroup$


Here is a theorem (of homological algebra):




Given $A rightarrow B rightarrow C$ in an abelian category
$mathcal{A}$.



If for all $D in mathcal{A}$ we have that $Hom(D,A) rightarrow
Hom(D,B) rightarrow Hom(D,C)$
is an exact sequence, then $A
rightarrow B rightarrow C$
is an exact sequence.




This is a nice enough theorem that it feels like this can be expressed by saying that some certain representable functor is exact, or faithful, or a generator.



I tried using that an additive functor is faithful iff it sends nonexact sequences to nonexact sequences, but still haven't come up with anything.










share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    "$mathsf{Hom}(D,-)$ reflects exact sequences of length 3"? ;-)
    $endgroup$
    – Musa Al-hassy
    Jan 23 at 16:32






  • 1




    $begingroup$
    You mean for a fixed choice of $D$? That can't be it, right? To say that for some fixed $D$, $Hom(D,-)$ reflects exacts sequences of length 3 would be the following statement: "Given $D$ and $A rightarrow B rightarrow C$ in an abelian category $mathcal{A}$, if $Hom(D,A) rightarrow Hom(D,B) rightarrow Hom(D,C)$ is an exact sequence, then $A rightarrow B rightarrow C$ is an exact sequence." And that's surely not a true statement. Whereas the theorem I gave is really a true statement, because it asks for the premise to hold over all $D$.
    $endgroup$
    – SSF
    Jan 23 at 18:50








  • 2




    $begingroup$
    "Representables jointly reflect exact sequences"? Something in that neighborhood?
    $endgroup$
    – Malice Vidrine
    Jan 24 at 0:37
















6












$begingroup$


Here is a theorem (of homological algebra):




Given $A rightarrow B rightarrow C$ in an abelian category
$mathcal{A}$.



If for all $D in mathcal{A}$ we have that $Hom(D,A) rightarrow
Hom(D,B) rightarrow Hom(D,C)$
is an exact sequence, then $A
rightarrow B rightarrow C$
is an exact sequence.




This is a nice enough theorem that it feels like this can be expressed by saying that some certain representable functor is exact, or faithful, or a generator.



I tried using that an additive functor is faithful iff it sends nonexact sequences to nonexact sequences, but still haven't come up with anything.










share|cite|improve this question









$endgroup$








  • 2




    $begingroup$
    "$mathsf{Hom}(D,-)$ reflects exact sequences of length 3"? ;-)
    $endgroup$
    – Musa Al-hassy
    Jan 23 at 16:32






  • 1




    $begingroup$
    You mean for a fixed choice of $D$? That can't be it, right? To say that for some fixed $D$, $Hom(D,-)$ reflects exacts sequences of length 3 would be the following statement: "Given $D$ and $A rightarrow B rightarrow C$ in an abelian category $mathcal{A}$, if $Hom(D,A) rightarrow Hom(D,B) rightarrow Hom(D,C)$ is an exact sequence, then $A rightarrow B rightarrow C$ is an exact sequence." And that's surely not a true statement. Whereas the theorem I gave is really a true statement, because it asks for the premise to hold over all $D$.
    $endgroup$
    – SSF
    Jan 23 at 18:50








  • 2




    $begingroup$
    "Representables jointly reflect exact sequences"? Something in that neighborhood?
    $endgroup$
    – Malice Vidrine
    Jan 24 at 0:37














6












6








6





$begingroup$


Here is a theorem (of homological algebra):




Given $A rightarrow B rightarrow C$ in an abelian category
$mathcal{A}$.



If for all $D in mathcal{A}$ we have that $Hom(D,A) rightarrow
Hom(D,B) rightarrow Hom(D,C)$
is an exact sequence, then $A
rightarrow B rightarrow C$
is an exact sequence.




This is a nice enough theorem that it feels like this can be expressed by saying that some certain representable functor is exact, or faithful, or a generator.



I tried using that an additive functor is faithful iff it sends nonexact sequences to nonexact sequences, but still haven't come up with anything.










share|cite|improve this question









$endgroup$




Here is a theorem (of homological algebra):




Given $A rightarrow B rightarrow C$ in an abelian category
$mathcal{A}$.



If for all $D in mathcal{A}$ we have that $Hom(D,A) rightarrow
Hom(D,B) rightarrow Hom(D,C)$
is an exact sequence, then $A
rightarrow B rightarrow C$
is an exact sequence.




This is a nice enough theorem that it feels like this can be expressed by saying that some certain representable functor is exact, or faithful, or a generator.



I tried using that an additive functor is faithful iff it sends nonexact sequences to nonexact sequences, but still haven't come up with anything.







category-theory homology-cohomology






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 23 at 13:26









SSFSSF

423111




423111








  • 2




    $begingroup$
    "$mathsf{Hom}(D,-)$ reflects exact sequences of length 3"? ;-)
    $endgroup$
    – Musa Al-hassy
    Jan 23 at 16:32






  • 1




    $begingroup$
    You mean for a fixed choice of $D$? That can't be it, right? To say that for some fixed $D$, $Hom(D,-)$ reflects exacts sequences of length 3 would be the following statement: "Given $D$ and $A rightarrow B rightarrow C$ in an abelian category $mathcal{A}$, if $Hom(D,A) rightarrow Hom(D,B) rightarrow Hom(D,C)$ is an exact sequence, then $A rightarrow B rightarrow C$ is an exact sequence." And that's surely not a true statement. Whereas the theorem I gave is really a true statement, because it asks for the premise to hold over all $D$.
    $endgroup$
    – SSF
    Jan 23 at 18:50








  • 2




    $begingroup$
    "Representables jointly reflect exact sequences"? Something in that neighborhood?
    $endgroup$
    – Malice Vidrine
    Jan 24 at 0:37














  • 2




    $begingroup$
    "$mathsf{Hom}(D,-)$ reflects exact sequences of length 3"? ;-)
    $endgroup$
    – Musa Al-hassy
    Jan 23 at 16:32






  • 1




    $begingroup$
    You mean for a fixed choice of $D$? That can't be it, right? To say that for some fixed $D$, $Hom(D,-)$ reflects exacts sequences of length 3 would be the following statement: "Given $D$ and $A rightarrow B rightarrow C$ in an abelian category $mathcal{A}$, if $Hom(D,A) rightarrow Hom(D,B) rightarrow Hom(D,C)$ is an exact sequence, then $A rightarrow B rightarrow C$ is an exact sequence." And that's surely not a true statement. Whereas the theorem I gave is really a true statement, because it asks for the premise to hold over all $D$.
    $endgroup$
    – SSF
    Jan 23 at 18:50








  • 2




    $begingroup$
    "Representables jointly reflect exact sequences"? Something in that neighborhood?
    $endgroup$
    – Malice Vidrine
    Jan 24 at 0:37








2




2




$begingroup$
"$mathsf{Hom}(D,-)$ reflects exact sequences of length 3"? ;-)
$endgroup$
– Musa Al-hassy
Jan 23 at 16:32




$begingroup$
"$mathsf{Hom}(D,-)$ reflects exact sequences of length 3"? ;-)
$endgroup$
– Musa Al-hassy
Jan 23 at 16:32




1




1




$begingroup$
You mean for a fixed choice of $D$? That can't be it, right? To say that for some fixed $D$, $Hom(D,-)$ reflects exacts sequences of length 3 would be the following statement: "Given $D$ and $A rightarrow B rightarrow C$ in an abelian category $mathcal{A}$, if $Hom(D,A) rightarrow Hom(D,B) rightarrow Hom(D,C)$ is an exact sequence, then $A rightarrow B rightarrow C$ is an exact sequence." And that's surely not a true statement. Whereas the theorem I gave is really a true statement, because it asks for the premise to hold over all $D$.
$endgroup$
– SSF
Jan 23 at 18:50






$begingroup$
You mean for a fixed choice of $D$? That can't be it, right? To say that for some fixed $D$, $Hom(D,-)$ reflects exacts sequences of length 3 would be the following statement: "Given $D$ and $A rightarrow B rightarrow C$ in an abelian category $mathcal{A}$, if $Hom(D,A) rightarrow Hom(D,B) rightarrow Hom(D,C)$ is an exact sequence, then $A rightarrow B rightarrow C$ is an exact sequence." And that's surely not a true statement. Whereas the theorem I gave is really a true statement, because it asks for the premise to hold over all $D$.
$endgroup$
– SSF
Jan 23 at 18:50






2




2




$begingroup$
"Representables jointly reflect exact sequences"? Something in that neighborhood?
$endgroup$
– Malice Vidrine
Jan 24 at 0:37




$begingroup$
"Representables jointly reflect exact sequences"? Something in that neighborhood?
$endgroup$
– Malice Vidrine
Jan 24 at 0:37










1 Answer
1






active

oldest

votes


















1












$begingroup$

I'm gonna have to go with @Malice on this one.




  • Recall that a functor $F$ is “representable”
    precisely when $F ≅ mathsf{Hom}(D,-)$ for some object $D$.



  • Recall that a functor $F$ “reflects a property $P$
    precisely when $P(X) ;⇐; P(F, X)$ for all $X$.



    ( This’ the converse of property preservation. )



  • Recall that a family of functors consists of a functor $Fᵢ$
    for each $i$ in some index set $I$.


  • Recall that a family $Fᵢ$jointly reflects property $P$
    precisely when $P(X) ;⇐; (∀ i.; P(Fᵢ , x))$ for all $X$.



Now your phrase can be stated compactly,




“Representables jointly reflect exact ternary sequences”




Neato!






share|cite|improve this answer









$endgroup$













  • $begingroup$
    That's nice, I accept it. Have you seen "jointly reflects" defined anywhere in the literature before?
    $endgroup$
    – SSF
    Jan 24 at 21:31






  • 1




    $begingroup$
    I'm just extrapolating, but consider comparing with legitimate phrases such as "jointly monic" in which each member of the family must satisfy the monic premise in order for the monic conclusion to hold..
    $endgroup$
    – Musa Al-hassy
    Jan 24 at 23:20






  • 1




    $begingroup$
    I actually googled this because I was sure I had just made it up on the spot, but "jointly reflects" has been used is basically this sense in the literature before. It looks like our sense of reasonable terminology is vindicated.
    $endgroup$
    – Malice Vidrine
    Jan 24 at 23:39












  • $begingroup$
    sweet! way to go MV!
    $endgroup$
    – Musa Al-hassy
    Jan 25 at 15:36











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084466%2fcan-you-express-this-easy-theorem-in-fancy-categorical-terms%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

I'm gonna have to go with @Malice on this one.




  • Recall that a functor $F$ is “representable”
    precisely when $F ≅ mathsf{Hom}(D,-)$ for some object $D$.



  • Recall that a functor $F$ “reflects a property $P$
    precisely when $P(X) ;⇐; P(F, X)$ for all $X$.



    ( This’ the converse of property preservation. )



  • Recall that a family of functors consists of a functor $Fᵢ$
    for each $i$ in some index set $I$.


  • Recall that a family $Fᵢ$jointly reflects property $P$
    precisely when $P(X) ;⇐; (∀ i.; P(Fᵢ , x))$ for all $X$.



Now your phrase can be stated compactly,




“Representables jointly reflect exact ternary sequences”




Neato!






share|cite|improve this answer









$endgroup$













  • $begingroup$
    That's nice, I accept it. Have you seen "jointly reflects" defined anywhere in the literature before?
    $endgroup$
    – SSF
    Jan 24 at 21:31






  • 1




    $begingroup$
    I'm just extrapolating, but consider comparing with legitimate phrases such as "jointly monic" in which each member of the family must satisfy the monic premise in order for the monic conclusion to hold..
    $endgroup$
    – Musa Al-hassy
    Jan 24 at 23:20






  • 1




    $begingroup$
    I actually googled this because I was sure I had just made it up on the spot, but "jointly reflects" has been used is basically this sense in the literature before. It looks like our sense of reasonable terminology is vindicated.
    $endgroup$
    – Malice Vidrine
    Jan 24 at 23:39












  • $begingroup$
    sweet! way to go MV!
    $endgroup$
    – Musa Al-hassy
    Jan 25 at 15:36
















1












$begingroup$

I'm gonna have to go with @Malice on this one.




  • Recall that a functor $F$ is “representable”
    precisely when $F ≅ mathsf{Hom}(D,-)$ for some object $D$.



  • Recall that a functor $F$ “reflects a property $P$
    precisely when $P(X) ;⇐; P(F, X)$ for all $X$.



    ( This’ the converse of property preservation. )



  • Recall that a family of functors consists of a functor $Fᵢ$
    for each $i$ in some index set $I$.


  • Recall that a family $Fᵢ$jointly reflects property $P$
    precisely when $P(X) ;⇐; (∀ i.; P(Fᵢ , x))$ for all $X$.



Now your phrase can be stated compactly,




“Representables jointly reflect exact ternary sequences”




Neato!






share|cite|improve this answer









$endgroup$













  • $begingroup$
    That's nice, I accept it. Have you seen "jointly reflects" defined anywhere in the literature before?
    $endgroup$
    – SSF
    Jan 24 at 21:31






  • 1




    $begingroup$
    I'm just extrapolating, but consider comparing with legitimate phrases such as "jointly monic" in which each member of the family must satisfy the monic premise in order for the monic conclusion to hold..
    $endgroup$
    – Musa Al-hassy
    Jan 24 at 23:20






  • 1




    $begingroup$
    I actually googled this because I was sure I had just made it up on the spot, but "jointly reflects" has been used is basically this sense in the literature before. It looks like our sense of reasonable terminology is vindicated.
    $endgroup$
    – Malice Vidrine
    Jan 24 at 23:39












  • $begingroup$
    sweet! way to go MV!
    $endgroup$
    – Musa Al-hassy
    Jan 25 at 15:36














1












1








1





$begingroup$

I'm gonna have to go with @Malice on this one.




  • Recall that a functor $F$ is “representable”
    precisely when $F ≅ mathsf{Hom}(D,-)$ for some object $D$.



  • Recall that a functor $F$ “reflects a property $P$
    precisely when $P(X) ;⇐; P(F, X)$ for all $X$.



    ( This’ the converse of property preservation. )



  • Recall that a family of functors consists of a functor $Fᵢ$
    for each $i$ in some index set $I$.


  • Recall that a family $Fᵢ$jointly reflects property $P$
    precisely when $P(X) ;⇐; (∀ i.; P(Fᵢ , x))$ for all $X$.



Now your phrase can be stated compactly,




“Representables jointly reflect exact ternary sequences”




Neato!






share|cite|improve this answer









$endgroup$



I'm gonna have to go with @Malice on this one.




  • Recall that a functor $F$ is “representable”
    precisely when $F ≅ mathsf{Hom}(D,-)$ for some object $D$.



  • Recall that a functor $F$ “reflects a property $P$
    precisely when $P(X) ;⇐; P(F, X)$ for all $X$.



    ( This’ the converse of property preservation. )



  • Recall that a family of functors consists of a functor $Fᵢ$
    for each $i$ in some index set $I$.


  • Recall that a family $Fᵢ$jointly reflects property $P$
    precisely when $P(X) ;⇐; (∀ i.; P(Fᵢ , x))$ for all $X$.



Now your phrase can be stated compactly,




“Representables jointly reflect exact ternary sequences”




Neato!







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 24 at 15:49









Musa Al-hassyMusa Al-hassy

1,3331711




1,3331711












  • $begingroup$
    That's nice, I accept it. Have you seen "jointly reflects" defined anywhere in the literature before?
    $endgroup$
    – SSF
    Jan 24 at 21:31






  • 1




    $begingroup$
    I'm just extrapolating, but consider comparing with legitimate phrases such as "jointly monic" in which each member of the family must satisfy the monic premise in order for the monic conclusion to hold..
    $endgroup$
    – Musa Al-hassy
    Jan 24 at 23:20






  • 1




    $begingroup$
    I actually googled this because I was sure I had just made it up on the spot, but "jointly reflects" has been used is basically this sense in the literature before. It looks like our sense of reasonable terminology is vindicated.
    $endgroup$
    – Malice Vidrine
    Jan 24 at 23:39












  • $begingroup$
    sweet! way to go MV!
    $endgroup$
    – Musa Al-hassy
    Jan 25 at 15:36


















  • $begingroup$
    That's nice, I accept it. Have you seen "jointly reflects" defined anywhere in the literature before?
    $endgroup$
    – SSF
    Jan 24 at 21:31






  • 1




    $begingroup$
    I'm just extrapolating, but consider comparing with legitimate phrases such as "jointly monic" in which each member of the family must satisfy the monic premise in order for the monic conclusion to hold..
    $endgroup$
    – Musa Al-hassy
    Jan 24 at 23:20






  • 1




    $begingroup$
    I actually googled this because I was sure I had just made it up on the spot, but "jointly reflects" has been used is basically this sense in the literature before. It looks like our sense of reasonable terminology is vindicated.
    $endgroup$
    – Malice Vidrine
    Jan 24 at 23:39












  • $begingroup$
    sweet! way to go MV!
    $endgroup$
    – Musa Al-hassy
    Jan 25 at 15:36
















$begingroup$
That's nice, I accept it. Have you seen "jointly reflects" defined anywhere in the literature before?
$endgroup$
– SSF
Jan 24 at 21:31




$begingroup$
That's nice, I accept it. Have you seen "jointly reflects" defined anywhere in the literature before?
$endgroup$
– SSF
Jan 24 at 21:31




1




1




$begingroup$
I'm just extrapolating, but consider comparing with legitimate phrases such as "jointly monic" in which each member of the family must satisfy the monic premise in order for the monic conclusion to hold..
$endgroup$
– Musa Al-hassy
Jan 24 at 23:20




$begingroup$
I'm just extrapolating, but consider comparing with legitimate phrases such as "jointly monic" in which each member of the family must satisfy the monic premise in order for the monic conclusion to hold..
$endgroup$
– Musa Al-hassy
Jan 24 at 23:20




1




1




$begingroup$
I actually googled this because I was sure I had just made it up on the spot, but "jointly reflects" has been used is basically this sense in the literature before. It looks like our sense of reasonable terminology is vindicated.
$endgroup$
– Malice Vidrine
Jan 24 at 23:39






$begingroup$
I actually googled this because I was sure I had just made it up on the spot, but "jointly reflects" has been used is basically this sense in the literature before. It looks like our sense of reasonable terminology is vindicated.
$endgroup$
– Malice Vidrine
Jan 24 at 23:39














$begingroup$
sweet! way to go MV!
$endgroup$
– Musa Al-hassy
Jan 25 at 15:36




$begingroup$
sweet! way to go MV!
$endgroup$
– Musa Al-hassy
Jan 25 at 15:36


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084466%2fcan-you-express-this-easy-theorem-in-fancy-categorical-terms%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

'app-layout' is not a known element: how to share Component with different Modules

android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

WPF add header to Image with URL pettitions [duplicate]