Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-06 (claude-opus-5)
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.

Relations RR and SS on a two-element set with SRRSS \circ R \neq R \circ S

Statement refuted

Refuted claim: SR=RSS \circ R = R \circ S for all relations RR and SS. With u:=u := \varnothing, v:={}v := \{\varnothing\}, A:={u,v}A := \{u,v\} and

R:={(u,v)},S:={(v,u)},R := \{(u,v)\}, \qquad S := \{(v,u)\},

the two composites are SR={(u,u)}S \circ R = \{(u,u)\} and RS={(v,v)}R \circ S = \{(v,v)\}, which are different. Composition of relations is associative (T(SR)=(TS)RT \circ (S \circ R) = (T \circ S) \circ R, (SR)1=R1S1(S \circ R)^{-1} = R^{-1} \circ S^{-1}, (R1)1=R(R^{-1})^{-1} = R, dom(R1)=ranR\operatorname{dom}(R^{-1}) = \operatorname{ran} R, and ΔBR=R=RΔA\Delta_B \circ R = R = R \circ \Delta_A for a relation RR from AA to BB) but not commutative.

Facts & Assumptions

Given: u:=u := \varnothing, v:={}v := \{\varnothing\}, A:={u,v}A := \{u,v\}, R:={(u,v)}R := \{(u,v)\} and S:={(v,u)}S := \{(v,u)\}.

[L1]

(a,c)SR(a,c) \in S \circ R holds if and only if (a,b)R(a,b) \in R and (b,c)S(b,c) \in S for some bb (The inverse relation R1R^{-1}, the composite SRS \circ R, and the restriction RAR \restriction A).

[L3]

(a,b)=(c,d)(a,b) = (c,d) if and only if a=ca = c and b=db = d ((a,b)=(c,d)(a,b) = (c,d) if and only if a=ca = c and b=db = d).

[L4]

(a,b):={{a},{a,b}}(a,b) := \{\{a\},\{a,b\}\} (The Kuratowski ordered pair (a,b):={{a},{a,b}}(a,b) := \{\{a\},\{a,b\}\}).

[L5]

{x,y}\{x,y\} is the set whose elements are exactly xx and yy, and {x}:={x,x}\{x\} := \{x,x\} (The unordered pair {x,y}\{x,y\} and the singleton {x}={x,x}\{x\} = \{x,x\}).

[L6]

There is exactly one set with no elements, written \varnothing (There is exactly one set with no elements, written \varnothing).

Counterexample

technique · direct
1.1

uvu \neq v, because vv has an element and uu has none; and RR and SS are relations on AA, each with one pair, both of whose coordinates lie in AA.

L2L5L6L9
2.1

SRS \circ R: the only pair of RR is (u,v)(u,v), and the only pair of SS whose first coordinate is vv is (v,u)(v,u), so the only element of SRS \circ R is (u,u)(u,u).

L1L3L5L7step 1.1
2.2

RSR \circ S: the only pair of SS is (v,u)(v,u), and the only pair of RR whose first coordinate is uu is (u,v)(u,v), so the only element of RSR \circ S is (v,v)(v,v).

L1L3L5L7step 1.1
3.1

(u,u)(u,u) and (v,v)(v,v) are different, since equality of ordered pairs would force u=vu = v; so the two composites have different elements and SRRSS \circ R \neq R \circ S, while the associativity of composition is unaffected.

L3L4L7L8step 1.1step 2.1step 2.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 24 results over 12 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources