PPA ⊆ TFNP Inclusion · folklore Statement Every problem in PPA has a solution on every input, guaranteed by the combinatorial principle defining the class, and solutions are verifiable in polynomial time, so PPA ⊆ TFNP — folklore.