Proof of `Homomorphism counts into a looped graph`
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
. A homomorphism is the same thing as a pair consisting of the set of edges of whose endpoints it identifies and a homomorphism : the quotient by is exactly what remains once the collapsed edges are contracted, and an edge outside is sent to a genuine edge of . Summing over gives the identity.