Proof of `Homomorphism counts into a looped graph`

groundedproofs/Lax871432Proofs/Results.lean · lax-871432

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.

Read the Lean proof on GitHub

Description

lem:loopinglem:looping. A homomorphism FG°F → G° is the same thing as a pair consisting of the set LL of edges of FF whose endpoints it identifies and a homomorphism FLGF ⊘ L → G: the quotient by LL is exactly what remains once the collapsed edges are contracted, and an edge outside LL is sent to a genuine edge of GG. Summing over LL gives the identity.