Reduction to Fin #
If we have a bijection X → Fin n, then the number of distinct colorings of X with colors in Y under the group action of G on X
is equal to the number of distinct colorings of Fin n with colors in Y under the induced group action of G on Fin n. This allows
us to use Fin n instead of more complex types when working with numbers of distinct colorings.
Given a bijection enum.equiv : X → Fin enum.card and a group action of G on X, construct a group action of G on Fin enum.card
with g • i ↦ enum.equiv (g • (enum.equiv⁻¹ i)).
Equations
- ReductionToFin.MulActionFin X G = MulAction.mk ⋯ ⋯
A bijection between the distinct colorings of X with colors in Y under the group action of G on X and the distinct colorings of
Fin enum.card with colors in Y under the induced group action of G on Fin enum.card.
Equations
- One or more equations did not get rendered due to their size.
Instances For
An instance of Fintype for the distinct colorings of Fin enum.card with colors in Y under the induced group action of G on
Fin enum.card. Required by numDistinctColorings_eq_numDistinctColorings_of_Fin.
Equations
- One or more equations did not get rendered due to their size.
The number of distinct colorings of X with colors in Y under the group action of G on X is equal to the number of distinct
colorings of Fin enum.card with colors in Y under the induced group action of G on Fin enum.card.