mp — Mathlib · SciLib

English

Define the M-type for P as M α := P.mp α, i.e., a data-like tree with a valid path structure.

Русский

Определение M‑типа для P как M α := P.mp α, т.е. дерево без содержимого с допустимой структурой путей.

LaTeX

$$$\\text{M} (\\alpha) := P.\\text{mp} \\ α$$$

Lean4

/-- Polynomial functor of the M-type of `P`. `A` is a data-less
possibly infinite tree whereas, for a given `a : A`, `B a` is a valid
path in tree `a` so that `mp α` is made of a tree and a function
from its valid paths to the values it contains -/
def mp : MvPFunctor n where
  A := P.last.M
  B := M.Path P

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