Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The contravariant power-set functor is monadic

Statement

The contravariant power-set functor

P:Setop→Set,X↦P(X),fop↦f−1,

is monadic.

Facts & Assumptions

Given: The contravariant power-set functor between Setop and Set.

[L1]

An adjunction may be specified by a natural family of hom-set bijections (The unit-counit, hom-set, unit-universal, and counit-universal encodings of an adjunction are equivalent).

[L2]

A conservative functor reflects isomorphisms (Conservative functor).

[L3]

Direct and inverse image satisfy Beck–Chevalley for pullback squares of sets (Direct and inverse image satisfy Beck–Chevalley for pullback squares of sets).

[L4]

A right adjoint equipped with a specified coequalizer for every reflexive pair is monadic when it preserves those coequalizers and reflects isomorphisms (Data-supplied crude monadicity theorem for reflexive coequalizers).

Proof

technique · direct
1.1L1construct

A function X→P(Y) is the same as a relation R⊆X×Y. Transposing R gives a function Y→P(X), and transposition is natural and involutive. By [L1] this makes the power-set functor on the opposite side its own left adjoint.

1.2L2algebra

If f−1:P(Y)→P(X) is bijective, then f is surjective because otherwise ∅ and a singleton outside f[X] have the same preimage. It is injective because surjectivity of f−1 realizes each singleton of X as a preimage, which separates points with different singleton membership. Thus f is bijective and the functor is conservative by [L2], including when X is empty.

1.3L5construct

A reflexive pair in Setop corresponds to maps f,g:A⇉B in Set with a common retraction r:B→A, so rf=rg=1A. Define E={a∈A:f(a)=g(a)} and let e:E↪A be inclusion. This formula supplies an equalizer for every such pair uniformly, so the opposite maps form the required specified family of reflexive coequalizers in Setop.

2.1step 1.3L3algebra

The square with both left and top maps e:E→A, and with bottom and right maps f,g:A⇉B, is a pullback: if f(a)=g(a′), applying r gives a=a′∈E. Hence [L3] gives e[e−1[S]]=g−1[f[S]]=S∩e[E] for every S⊆A; the last equality also follows directly, while f−1[f[S]]=S because rf=1A.

3.1step 2.1construct

Let H:P(A)→Z satisfy Hf−1=Hg−1. Applying this equality to f[S] and using step 2.1 gives H(S)=H(S∩e[E]). Define Hˉ:P(E)→Z by Hˉ(R)=H(e[R]). Then Hˉe−1=H, and this factorization is unique because e−1:P(A)→P(E) is surjective. Thus e−1 is the coequalizer of f−1,g−1, so the power-set functor preserves every reflexive coequalizer in Setop.

4.1step 1.1step 1.2step 1.3step 3.1L4∎

Step 1.3 supplies the required coequalizer family, while steps 1.1, 1.2, and 3.1 give the left adjoint, conservativity, and preservation hypotheses of [L4]. The crude monadicity theorem therefore proves that P:Setop→Set is monadic.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources