Homomorphism counts into a categorical product
Lax871432.CategoricalProductCounts · concepts/Lax871432/CategoricalProductCounts.lean · lax-871432
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
For simple graphs , and ,
Concept map
In the paper
- page 3 of this submission's paper
Lean source view on GitHub
| 1 | import Lax871432.GraphProducts |
| 2 | import Lax871432.HomomorphismCounts |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Homomorphism counts into a categorical product |
| 7 | type: lemma |
| 8 | --- |
| 9 | For simple graphs , and , |
| 10 | |
| 11 | -/ |
| 12 | |
| 13 | open Lax871432.GraphProducts Lax871432.HomomorphismCounts |
| 14 | |
| 15 | open scoped Lax871432.GraphProducts |
| 16 | |
| 17 | namespace Lax871432.CategoricalProductCounts |
| 18 | |
| 19 | /-- A homomorphism into a categorical product is a pair of homomorphisms into its two |
| 20 | factors. -/ |
| 21 | axiom homCount_catProd_right {U V W : Type*} [Finite U] [Finite V] [Finite W] |
| 22 | (F : SimpleGraph U) (G₁ : SimpleGraph V) (G₂ : SimpleGraph W) : |
| 23 | homCount F (G₁ ×g G₂) = homCount F G₁ * homCount F G₂ |
| 24 | |
| 25 | end Lax871432.CategoricalProductCounts |
| 26 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments