OurBigBook About$ Donate
 Sign in Sign up

Bounded subfunctor solution set for precomposition (Q⟶GF factors through G′F,∣G′(d)∣≤κ)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Category theory Category Adjoint functors Left Kan extension
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For small categories C,D, a functor F:C→D and Q:C→Set, choose an infinite cardinal number κ bounding the number of morphisms of D and the total number of elements of Q. Given a natural transformation η:Q→GF, generate a subfunctor G′⊆G from all ηc​(x) by applying every outgoing D-morphism. Each G′(d) has at most κ elements. Label bounded values by subsets of κ; only a set of such functors and transformations exists. These factorizations give the solution-set condition for precomposition, whose left adjoint is the left Kan extension.

 Ancestors (8)

  1. Left Kan extension
  2. Adjoint functors
  3. Category
  4. Category theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 23 / 1 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook