LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

For a function $f : A \to B$ the relation $\ker f : = {(a, a^{'}) \in A \times A : f (a) = f (a^{'})}$ is an equivalence relation on $A$

Statement

Let $f : A \to B$ be a function. Then

$\ker f : = {(a, a^{'}) \in A \times A : f (a) = f (a^{'})}$

is a set, is a relation on $A$ , and is an equivalence relation on $A$ .

Facts & Assumptions

Given: a function $f : A \to B$ .

[L1]

We write $f : A \to B$ , and say $f$ is a function from $A$ to $B$ , when $f$ is a function with $dom f = A$ and $ran f \subseteq B$ (A function is a relation $f$ with $(a, b) \in f$ and $(a, c) \in f$ implying $b = c$ ; $f : A \to B$ , the value $f (a)$ , domain and codomain).

[L2]

For any parameters $\overset{ˉ}{p}$ and any set $x$ , there is a set $y$ whose elements are exactly the elements $z$ of $x$ for which $φ (z, \overset{ˉ}{p})$ holds (The Axiom Schema of Separation: for each formula $φ$ , $\forall \overset{ˉ}{p} \forall x \exists y \forall z (z \in y \leftrightarrow (z \in x \land φ (z, \overset{ˉ}{p})))$ ).

[L3]

$z \in A \times B$ holds if and only if $z = (a, b)$ for some $a \in A$ and some $b \in B$ (The Cartesian product $A \times B : = {z \in P (P (A \cup B)) : \exists a \in A \exists b \in B z = (a, b)}$ ).

[L4]

$R$ is a relation on $A$ when $R \subseteq A \times A$ (Relation, $dom R$ , $ran R$ , $fld R$ , and the specialisations "relation from $A$ to $B$ " and "relation on $A$ ").

[L5]

reflexive: $a \sim a$ for every $a \in A$ (Equivalence relation, equivalence class, and the quotient set $A / \sim$ ).

[L6]

symmetric: $a \sim b$ implies $b \sim a$ , for all $a, b \in A$ (Equivalence relation, equivalence class, and the quotient set $A / \sim$ ).

[L7]

transitive: $a \sim b$ and $b \sim c$ imply $a \sim c$ , for all $a, b, c \in A$ (Equivalence relation, equivalence class, and the quotient set $A / \sim$ ).

[L8]

$R$ is transitive when $(a, b) \in R$ and $(b, c) \in R$ imply $(a, c) \in R$ , for all $a, b, c \in A$ (Reflexive, irreflexive, symmetric, asymmetric, antisymmetric, transitive, and connex relations on a set).

Proof

technique · direct

1.1

$\ker f$ is a set and a relation on $A$ : it is obtained by separating inside $A \times A$ with the formula $\exists a \exists a^{'} (z = (a, a^{'}) \land f (a) = f (a^{'}))$ and the parameters $A$ and $f$ , so it is a subset of $A \times A$ and each of its elements is an ordered pair.

L1L2L3L4

2.1

It is reflexive on $A$ : for $a \in A$ the value $f (a)$ is a single set, so $f (a) = f (a)$ and $(a, a) \in \ker f$ .

L1L5step 1.1

2.2

It is symmetric: if $(a, a^{'}) \in \ker f$ then $f (a) = f (a^{'})$ , hence $f (a^{'}) = f (a)$ and $(a^{'}, a) \in \ker f$ .

L6step 1.1

2.3

It is transitive: if $(a, a^{'}) \in \ker f$ and $(a^{'}, a^{''}) \in \ker f$ then $f (a) = f (a^{'})$ and $f (a^{'}) = f (a^{''})$ , hence $f (a) = f (a^{''})$ and $(a, a^{''}) \in \ker f$ .

L7L8step 1.1

3.1

$\ker f$ is a relation on $A$ that is reflexive on $A$ , symmetric and transitive, which is what it means to be an equivalence relation on $A$ .

step 1.1step 2.1step 2.2step 2.3∎

Depends on

Used by

Dependency tree · two levels

16 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

Equivalence relation (Wikipedia) (standard reference, not scraped)
B. Kaya, MATH 320 Set Theory (METU), §3.2 (standard reference, not scraped)
Kernel (set theory) (Wikipedia) (standard reference, not scraped)

For a function f:A→Bf:A→B the relation ker⁡f:={ (a,a′)∈A×A:f(a)=f(a′) }kerf:={(a,a′)∈A×A:f(a)=f(a′)} is an equivalence relation on AA