Skip to main content
deleted 24 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73

Notice that the Kan extension problem recovers the Adjoint functor theorem one, because adjoints are computed via Kan extensions of identities of large categories, $$\mathsf{R} = \mathsf{lan}_\mathsf{L}(1) \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \mathsf{L} = \mathsf{ran}_\mathsf{R}(1) .$$$$\mathsf{R} = \mathsf{lan}_\mathsf{L}(1) \qquad \mathsf{L} = \mathsf{ran}_\mathsf{R}(1) .$$ Indeed, in that case, the solution set condition is precisely what is needed in order to cut down the size of some colimits that otherwise would be too large to compute, as can be synthesized by the sharp version of the Kan lemma.

Notice that the Kan extension problem recovers the Adjoint functor theorem one, because adjoints are computed via Kan extensions of identities of large categories, $$\mathsf{R} = \mathsf{lan}_\mathsf{L}(1) \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \mathsf{L} = \mathsf{ran}_\mathsf{R}(1) .$$ Indeed, in that case, the solution set condition is precisely what is needed in order to cut down the size of some colimits that otherwise would be too large to compute, as can be synthesized by the sharp version of the Kan lemma.

Notice that the Kan extension problem recovers the Adjoint functor theorem one, because adjoints are computed via Kan extensions of identities of large categories, $$\mathsf{R} = \mathsf{lan}_\mathsf{L}(1) \qquad \mathsf{L} = \mathsf{ran}_\mathsf{R}(1) .$$ Indeed, in that case, the solution set condition is precisely what is needed in order to cut down the size of some colimits that otherwise would be too large to compute, as can be synthesized by the sharp version of the Kan lemma.

added 118 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73

Notice that the Kan extension problem recovers the Adjoint functor theorem one, because adjoints are computed via Kan extensions of identities of large categories., $$\mathsf{R} = \mathsf{lan}_\mathsf{L}(1) \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \mathsf{L} = \mathsf{ran}_\mathsf{R}(1) .$$ Indeed, in that case, the solution set condition is precisely what is needed in order to cut down the size of some colimits that otherwise would be too large to compute, as can be synthesized by the sharp version of the Kan lemma.

Notice that the Kan extension problem recovers the Adjoint functor theorem one, because adjoints are computed via Kan extensions of identities of large categories. Indeed, in that case, the solution set condition is precisely what is needed in order to cut down the size of some colimits that otherwise would be too large to compute, as can be synthesized by the sharp version of the Kan lemma.

Notice that the Kan extension problem recovers the Adjoint functor theorem one, because adjoints are computed via Kan extensions of identities of large categories, $$\mathsf{R} = \mathsf{lan}_\mathsf{L}(1) \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \mathsf{L} = \mathsf{ran}_\mathsf{R}(1) .$$ Indeed, in that case, the solution set condition is precisely what is needed in order to cut down the size of some colimits that otherwise would be too large to compute, as can be synthesized by the sharp version of the Kan lemma.

added 217 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73

Warning. The proof of the previous lemma is based on the density (as opposed to codensity) of $\lambda$-presentable objects in an accessible category. Thus the lemma is not valid for the right Kan extension.

Warning. The proof of the previous lemma is based on the density (as opposed to codensity) of $\lambda$-presentable objects in an accessible category. Thus the lemma is not valid for the right Kan extension.

added 209 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 12 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
edited body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 113 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
edited body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 471 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
deleted 3 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 2 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 556 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
deleted 4 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 570 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 2 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 2 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 37 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 1 character in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
deleted 8 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 27 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
deleted 6 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
added 166 characters in body
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading
Source Link
Ivan Di Liberti
  • 9.9k
  • 1
  • 33
  • 73
Loading