Sounds interesting. Could someone elaborate on that?
Sounds interesting. Could someone elaborate on that?
An easy example is a function on a set. If you have function defined on the whole set, you can shrink it to give you a function defined on a subset. If you have functions defined on several subsets, and those functions agree on the overlaps of the subsets, then you can use that to define a function on the union of the subsets. More interesting examples arise in topology and related fields.
You take this property of a function that’s only defined in an arbitrarily small neighborhood of a point, and from it you can determine the function’s value anywhere else. That is, you take infinitesimally small changes (e.g. velocity) and add them up in the right way and get finite changes (e.g. distance).
It’s more interesting than it sounds because you aren’t computing a sum or something with numbers when you add up infinitesimal change. Local/infinitesimal change is in some ways a different beast than finite/global change.
It consists of a grid of overlapping slots and for each slot there is a clue.
The question that sheaf theory addresses is what constraints do you have to put on the clues to ensure that the overall puzzle has a single solution.