Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

Double counting: ∑x∈X∣Rx∣=∣R∣=∑y∈Y∣Ry∣ for a relation between finite sets

Statement

Let X and Y be finite sets and let R⊆X×Y, with row fibres Rx and column fibres Ry as in A relation R⊆X×Y between finite sets, its row fibres Rx and its column fibres Ry. Then, in N,

∑x∈X∣Rx∣  =  ∣R∣  =  ∑y∈Y∣Ry∣,

the sums being those of The sum ∑i∈Sai over a finite index set, and its product form.

Both index sets may be empty. If X=∅ then R=∅, every column fibre is empty, and all three quantities are 0; the same holds with the roles of X and Y exchanged.

Facts & Assumptions

Given: Finite sets X and Y, a relation R⊆X×Y, and its fibres.

[L1]

R, every Rx and every Ry are finite, so all the cardinalities written below are defined (A relation R⊆X×Y between finite sets, its row fibres Rx and its column fibres Ry, clause (a), The cardinality ∣A∣ of a finite set).

[L2]

The row slices {x}×Rx and column slices Ry×{y} are pairwise disjoint within their respective families and each family has union R by clause (c); they are finite because clause (b) bijects them with the finite fibres from [L1] (A relation R⊆X×Y between finite sets, its row fibres Rx and its column fibres Ry, clauses (b) and (c), The cardinality ∣A∣ of a finite set, clause (c)).

[L3]

∣{x}×Rx∣=∣Rx∣ and ∣Ry×{y}∣=∣Ry∣, by the slice bijections of clause (b) of A relation R⊆X×Y between finite sets, its row fibres Rx and its column fibres Ry and the transport clause (c) of The cardinality ∣A∣ of a finite set (Injection, surjection, bijection).

[L4]

The sum rule for a finite partition: if (Ci)i∈I is a family of pairwise disjoint finite sets indexed by a finite set I, then ⋃i∈ICi is finite with ∣⋃i∈ICi∣=∑i∈I∣Ci∣ (The sum rule: a finite disjoint union is finite with ∣A∪B∣=∣A∣+∣B∣ and ∣⋃i∈IAi∣=∑i∈I∣Ai∣, and a sum over a finite index set splits along a partition, clause 2, The sum ∑i∈Sai over a finite index set, and its product form).

Proof

technique · direct
1.1

The row slices form a family of pairwise disjoint finite sets indexed by the finite set X, and their union is R, so [L4] gives ∣R∣=∑x∈X∣{x}×Rx∣.

L1L2L4
1.2

The column slices form a family of pairwise disjoint finite sets indexed by the finite set Y, and their union is R, so [L4] gives ∣R∣=∑y∈Y∣Ry×{y}∣.

L1L2L4
2.1

Replacing each summand of step 1.1 by ∣Rx∣ and each summand of step 1.2 by ∣Ry∣, which is legitimate by [L3] since the two lists have the same values at every index, gives ∑x∈X∣Rx∣=∣R∣=∑y∈Y∣Ry∣.

step 1.1step 1.2L3∎

Remarks

  • Where the hypotheses are spent. Finiteness of X and of Y is what makes the two index sets legitimate index sets for a sum, and finiteness of R is what makes ∣R∣ defined. Disjointness of the slices is automatic, since a slice is determined by one coordinate of its points, which is why no hypothesis of that kind appears in the statement.

  • The count stays in N. Every quantity here is a cardinality, and the sums are the N-valued ones. Nothing is embedded into R until an identity with a subtraction or a division has to be written.

Depends on

Used by

Dependency tree · two levels

26 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