ExampleConstruction: AI-generatedVerification: AI-generatedprecheck 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.

Adjoining one of two fixed points defines commuting closure-operator monads whose distributive law yields their composite

Example

On $P ({a, b, c})$ ordered by inclusion, define

$S (A) = A \cup {a}, T (A) = A \cup {b} .$

These closure-operator monads commute, and their equality $S T = T S$ gives a distributive law whose composite adjoins both $a$ and $b$ .

Facts & Assumptions

Given: The inclusion poset $P = P ({a, b, c})$ and the displayed maps $S, T : P \to P$ .

[L1]

A monotone, extensive, idempotent map on a poset defines a monad (On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators).

[L2]

A distributive law $S T \Rightarrow T S$ must satisfy the unit and multiplication compatibility diagrams (Distributive law between two monads).

[L3]

Such a distributive law gives a monad structure on $T S$ (A distributive law makes the composite endofunctor a monad).

Verification

technique · direct

1.1L1

Union with a fixed subset is monotone, extensive, and idempotent. Thus $S$ and $T$ are closure-operator monads by [L1].

2.1L2step 1.1

For every $A$ , $S (T (A)) = A \cup {a, b} = T (S (A))$ . This equality gives $λ : S T \Rightarrow T S$ ; all diagrams in [L2] commute because $P$ is thin and the parallel arrows have the displayed common endpoints.

3.1step 2.1

On $\emptyset, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}$ , both composites respectively give ${a, b}, {a, b}, {a, b}, {a, b, c}, {a, b}, {a, b, c}, {a, b, c}, {a, b, c}$ . This checks the formula at every object, including the empty set.

4.1L1L3step 2.1step 3.1∎

By [L3], the distributive law makes $T S$ a monad; its unit is the inclusion $A \subseteq A \cup {a, b}$ and its multiplication is the idempotence equality for the closure operator adjoining both fixed points.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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