Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The contravariant power-set functor is monadic

Statement

The contravariant power-set functor

P:SetopSet,XP(X),fopf1,

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.1

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

L1construct
1.2

If f1: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 f1 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.

L2algebra
1.3

A reflexive pair in Setop corresponds to maps f,g:AB in Set with a common retraction r:BA, so rf=rg=1A. Define E={aA:f(a)=g(a)} and let e:EA 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.

L5construct
2.1

The square with both left and top maps e:EA, and with bottom and right maps f,g:AB, is a pullback: if f(a)=g(a), applying r gives a=aE. Hence [L3] gives e[e1[S]]=g1[f[S]]=Se[E] for every SA; the last equality also follows directly, while f1[f[S]]=S because rf=1A.

step 1.3L3algebra
3.1

Let H:P(A)Z satisfy Hf1=Hg1. Applying this equality to f[S] and using step 2.1 gives H(S)=H(Se[E]). Define Hˉ:P(E)Z by Hˉ(R)=H(e[R]). Then Hˉe1=H, and this factorization is unique because e1:P(A)P(E) is surjective. Thus e1 is the coequalizer of f1,g1, so the power-set functor preserves every reflexive coequalizer in Setop.

step 2.1construct
4.1

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:SetopSet is monadic.

step 1.1step 1.2step 1.3step 3.1L4

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