Refinement (category theory)

In category theory and related fields of mathematics, a refinement is a construction that generalizes the operations of "interior enrichment", like bornologification or saturation of a locally convex space. A dual construction is called envelope.

Definition

Suppose is a category, an object in , and and two classes of morphisms in . The definition[1] of a refinement of in the class by means of the class consists of two steps.

Enrichment
  • A morphism in is called an enrichment of the object in the class of morphisms by means of the class of morphisms , if , and for any morphism from the class there exists a unique morphism in such that .
Refinement
  • An enrichment of the object in the class of morphisms by means of the class of morphisms is called a refinement of in by means of , if for any other enrichment (of in by means of ) there is a unique morphism in such that . The object is also called a refinement of in by means of .

Notations:

In a special case when is a class of all morphisms whose ranges belong to a given class of objects in it is convenient to replace with in the notations (and in the terms):

Similarly, if is a class of all morphisms whose ranges belong to a given class of objects in it is convenient to replace with in the notations (and in the terms):

For example, one can speak about a refinement of in the class of objects by means of the class of objects :

Examples

  1. The bornologification[2][3] of a locally convex space is a refinement of in the category of locally convex spaces by means of the subcategory of normed spaces:
  2. The saturation[4][3] of a pseudocomplete[5] locally convex space is a refinement in the category of locally convex spaces by means of the subcategory of the Smith spaces:
gollark: This is why AMD was basically irrelevant for many years until Zen back in 2017 or so.
gollark: Each pair of "cores" shares a bunch of resources, so it isn't really as fast as an actual "core" in other designs, and I think their IPC was quite bad too, so the moderately high clocks didn't do very much except burn power.
gollark: See, while the FX-4100 is allegedly a fairly high-clocked quad-core, this is misleading. AMD's Bulldozer architecture used "clustered multithreading", instead of the "simultaneous multithreading" on modern architectures and also Intel's ones at the time.
gollark: (as this is based on a tower server and not a rack one, you might not even have ridiculously noisy fans in it!)
gollark: Anyway, I don't think this computer is worth £300, inasmuch as you could buy an old server with a Sandy Bridge era CPU for let's say £120, buy and install an equivalent GPU (if compatible, you might admittedly have some issues with power supply pinout) for £100 or so, possibly upgrade the RAM and disks for £50, and outperform that computer with £30 left over.

See also

Notes

  1. Akbarov 2016, p. 52.
  2. Kriegl & Michor 1997, p. 35.
  3. Akbarov 2016, p. 57.
  4. Akbarov 2003, p. 194.
  5. A topological vector space is said to be pseudocomplete if each totally bounded Cauchy net in converges.

References

  • Kriegl, A.; Michor, P.W. (1997). The convenient setting of global analysis. Providence, Rhode Island: American Mathematical Society. ISBN 0-8218-0780-3.CS1 maint: ref=harv (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.