Beta
Powerset monad (Part 1)
Description:
Prove that the (contravariant) double powerset functor PP
is a monad.
Preloaded contains the following:
import category_theory.functor
import category_theory.types
import tactic
universe u
@[simps]
def PP : Type u ⥤ Type u :=
{ obj := λ X, set (set X),
map := λ X Y f, set.preimage (set.preimage f) }
Monads
Fundamentals
Similar Kata:
Stats:
Created | May 14, 2020 |
Published | May 14, 2020 |
Warriors Trained | 22 |
Total Skips | 6 |
Total Code Submissions | 2 |
Total Times Completed | 3 |
Lean Completions | 3 |
Total Stars | 2 |
% of votes with a positive feedback rating | 100% of 2 |
Total "Very Satisfied" Votes | 2 |
Total "Somewhat Satisfied" Votes | 0 |
Total "Not Satisfied" Votes | 0 |
Total Rank Assessments | 2 |
Average Assessed Rank | 5 kyu |
Highest Assessed Rank | 4 kyu |
Lowest Assessed Rank | 6 kyu |