Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 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.

A finite family (Ai)i∈I of subsets of a finite set X, the intersections AJ for J⊆I, and the convention A∅=X

Definition

A sieve family consists of a finite set X, called the ambient set, a finite set I, called the index set, and a family (Ai)i∈I of subsets of X, that is a function I→P(X) (Finite, countably infinite, countable, uncountable, The cardinality ∣A∣ of a finite set). For J⊆I set

AJ  :=  {⋂i∈JAi,J≠∅,X,J=∅,

and write U:=⋃i∈IAi for the union of the family.

Why the ambient set has to be named, and why A∅:=X is a stipulation. For J≠∅ the intersection ⋂i∈JAi is the set of elements belonging to every Ai with i∈J, and it is determined by the family alone. For J=∅ that description is satisfied by every set whatsoever, so it determines nothing; an intersection of no subsets of X is X only relative to X. Naming X as part of the data and stipulating A∅=X is what makes the symbol AJ defined for all J⊆I, which is what the complementary form of the sieve identity requires.

(a) Every AJ is a finite subset of X. For J≠∅ pick i∈J; then AJ⊆Ai⊆X. For J=∅, AJ=X. In both cases AJ⊆X is finite by clause 1 of A subset of a finite set is finite, with ∣B∣≤∣A∣, and equality holds if and only if B=A, and so is U⊆X; hence ∣AJ∣ and ∣U∣ are natural numbers (The cardinality ∣A∣ of a finite set).

(b) The index sets of the sieve's sums are finite. P(I) is finite with ∣P(I)∣=2∣I∣ (∣P(A)∣=2∣A∣ for finite A); the set P(I)∖{∅} of nonempty subsets of I and the set [I]j of j-element subsets of I are subsets of P(I), hence finite (A subset of a finite set is finite, with ∣B∣≤∣A∣, and equality holds if and only if B=A), and ∣[I]j∣=(∣I∣j) (The set [A]k of k-element subsets and the binomial coefficient (nk):=∣[n]k∣).

(c) Monotonicity. If J⊆J′⊆I then AJ′⊆AJ. For J=∅ this is clause (a); otherwise an element lying in every Ai with i∈J′ lies in every Ai with i∈J.

(d) The trace of a point. For x∈X put

T(x)  :=  { i∈I : x∈Ai }⊆I,

a finite set. For every nonempty J⊆I,

x∈AJ  ⟺  J⊆T(x),

both sides saying that x∈Ai for every i∈J. And x∈U if and only if T(x)≠∅. Writing t(x):=∣T(x)∣, clause (b) applied to T(x) gives ∣[T(x)]j∣=(t(x)j), and for nonempty J the condition x∈AJ with ∣J∣=j says exactly that J∈[T(x)]j.

XA0A1A2xx2Af0;2g;T(x)=f0;2g.

Remarks

  • The counts stay in N; the identities do not. Each ∣AJ∣ is a natural number. Every identity that sieves them carries a minus sign, and N has no subtraction, so those identities are stated in R through the canonical natural and read back by its injectivity. That is a property of the identities, not of this definition, which introduces no arithmetic at all.

  • I is an arbitrary finite index set, not a natural number. Nothing below numbers the sets A0,A1,…; the subsets J⊆I are the objects the sums run over, and ∣J∣ rather than any position is what carries the sign.

  • The clause A∅=X supplies every empty-subfamily term. In the complementary form at J=∅ it contributes ∣X∣; later sieve instances also use it when identifying the intersection at the empty subfamily. Removing the stipulation would leave those terms undefined.

Depends on

Used by

Dependency tree · two levels

21 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