AFTD Auto-Formalizing Theoretical Domains

op869_predecessor_postdegree

def

The post-degree of a vertex in an ordered predecessor presentation is the number of later vertices that list it as a predecessor.

Statement

def op869_predecessor_postdegree {n : ℕ} (P : Fin n → Finset (Fin n)) (a : Fin n) : ℕ
Source
arXiv:2610.41516, Section 2.2, post-degree controlled adaptive t-fold coloring simulation.
Verified
11 Nov 2026
Axioms
none listed
Used by 4

Lean source view module on GitHub

def op869_predecessor_postdegree {n : ℕ} (P : Fin n → Finset (Fin n)) (a : Fin n) : ℕ :=
  (Finset.univ.filter (fun b : Fin n => a < b ∧ a ∈ P b)).card
See it in the graphDiscuss this resultChallenge it