Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

In a locally small category, separating and coseparating sets are equivalently jointly faithful families of representables

Statement

Let C be locally small and let G be a set of objects. Then G is separating if and only if the family of covariant representables C(G,−):C→Set(G∈G) is jointly faithful. Dually, a set H is coseparating if and only if the family C(−,H):Cop→Set is jointly faithful.

Here a family of functors (Fi)i∈I with common domain is jointly faithful when, for every parallel pair f,g:X→Y in that domain, Fi(f)=Fi(g) for all i∈I implies f=g. For a one-member family this is faithfulness in the sense of Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors.

Facts & Assumptions

Given: A locally small category C and supplied sets of objects G and H.

[L1]

Local smallness makes every hom-collection C(X,Y) a set (Small, locally small, and large categories).

[L2]

In a locally small category the hom-assignments C(G,−) and C(−,H) are functors to Set (The assignments C(a,−) and C(−,a) are functors to Set).

[L3]

A functor F is faithful when every induced FA,B:C(A,B)→D(FA,FB) is injective (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors). Joint faithfulness of a family is the condition stated in this item's own Statement, and is not taken from the cited definition.

[L4]

A separating set detects distinct maps by precomposition, while a coseparating set detects them by postcomposition (Separating and coseparating sets of objects).

Proof

technique · direct
1.1L1L2L3L4

If G is separating and f,g:X→Y have equal images under every C(G,−), then f∘h=g∘h for every G∈G and h:G→X; [L4] forces f=g. Conversely, joint faithfulness says that distinct f,g have unequal images under some C(G,−), which means some h:G→X satisfies fh≠gh. Thus the separating and joint-faithfulness conditions are equivalent.

2.1step 1.1L2L3L4∎

Applying the same argument in the opposite category exchanges precomposition with postcomposition and proves that H is coseparating exactly when the contravariant representables C(−,H) are jointly faithful.

Depends on

Used by

Dependency tree · two levels

10 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