Proof of `Homomorphism counts into a disjoint union`

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

In the paper

  • page 3 of this submission's paper

Description

eq:disjointeq:disjoint. The image of a connected graph under a homomorphism is connected, so it lies entirely in G1G₁ or entirely in G2G₂; hence the homomorphisms into G1gG2G₁ ⊕g G₂ are the disjoint union of those into G1G₁ and those into G2G₂.