hallMatchingsFunctor — Mathlib

English

For finite ι' and α, the set hallMatchingsOn t ι' is finite; i.e., there are finitely many matchings.

Русский

Для конечных ι' и α множество hallMatchingsOn t ι' имеет конечную мощность; т.е. матчингoв конечное число.

LaTeX

$$$\\\\text{Finite}(\\\\mathrm{hallMatchingsOn}(t,\\\\iota')).$$$

Lean4

/-- This is the `hallMatchingsOn` sets assembled into a directed system.
-/
def hallMatchingsFunctor {ι : Type u} {α : Type v} (t : ι → Finset α) : (Finset ι)ᵒᵖ ⥤ Type max u v
    where
  obj ι' := hallMatchingsOn t ι'.unop
  map {_ _} g f := hallMatchingsOn.restrict t (CategoryTheory.leOfHom g.unop) f

Похожие утверждения