Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

Algebras for the covariant power-set monad are posets with all small suprema and their morphisms preserve every small supremum

Statement

The Eilenberg–Moore category of the covariant power-set monad is isomorphic to the category of posets admitting every small supremum and maps preserving every small supremum.

Facts & Assumptions

Given: The covariant power-set monad with singleton unit and union multiplication.

[L1]

The covariant power-set monad has singleton unit and union multiplication (Singleton and union define the covariant power-set monad), while an algebra map a:TX→X satisfies aηX=1X and aT(a)=aμX, and a homomorphism f satisfies fa=bT(f) (Algebra and algebra homomorphism for a monad).

[L2]

A poset has all small suprema exactly when every set of its elements has a least upper bound (A poset category is complete exactly when every small family has an infimum, and cocomplete exactly when every small family has a supremum).

[L3]

Antisymmetry is the condition that x≤y and y≤x imply x=y (Partial order and partially ordered set).

Proof

technique · direct
1.1L1L3

Given an algebra a, define x≤y when a({x,y})=y. The singleton law gives reflexivity; symmetry of the set {x,y} gives antisymmetry; and the flattening law makes the induced binary join associative, from which transitivity follows. Thus this is a partial order.

2.1L1L2step 1.1

For every A⊆X, put sup⁡A=a(A). Applying the flattening law to families formed from A, its singleton subsets, and an arbitrary common upper bound proves respectively that every member of A lies below a(A) and that a(A) lies below every upper bound; this includes A=∅. The algebra-homomorphism equation fa=bP(f) says exactly that f(sup⁡A)=sup⁡f[A].

3.1L1L2step 2.1∎

Conversely, on a poset with all small suprema define a(A)=sup⁡A. Singleton suprema give the unit law, and sup⁡(⋃A)=sup⁡{sup⁡A:A∈A} gives the multiplication law. A map satisfies the algebra-homomorphism equation exactly when it preserves these suprema.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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