factoring morphisms into composites #709
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
update for HomSearch split
kris-brown
force-pushed
the
factor_morphisms
branch
from
c4dd483 to
f150aa8
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The general problem solved is that we have an
f: A -> Cand want to factor it intog;horh;g(wheregis known andhis being solved for). This is tantamount to homomorphism search in a (co)-slice category.This is implemented in C-Set as well as slice cats. The hope is that the main code can be written agnostic to what category we are working in, and whether or not one's particular types implement
homomorphismsandfactorize_constraintsdictates howfactorizebehaves on a (co)span of morphisms in a given category.