Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 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)iI(A_i)_{i \in I} of subsets of a finite set XX, the intersections AJA_J for JIJ \subseteq I, and the convention A=XA_\varnothing = X

Definition

A sieve family consists of a finite set XX, called the ambient set, a finite set II, called the index set, and a family (Ai)iI(A_i)_{i \in I} of subsets of XX, that is a function IP(X)I \to \mathcal{P}(X) (Finite, countably infinite, countable, uncountable, The cardinality A\lvert A\rvert of a finite set). For JIJ \subseteq I set

AJ  :=  {iJAi,J,X,J=,A_J \;:=\; \begin{cases} \displaystyle\bigcap_{i \in J} A_i, & J \ne \varnothing,\\[4pt] X, & J = \varnothing,\end{cases}

and write U:=iIAiU := \bigcup_{i \in I} A_i for the union of the family.

Why the ambient set has to be named, and why A:=XA_\varnothing := X is a stipulation. For JJ \ne \varnothing the intersection iJAi\bigcap_{i \in J}A_i is the set of elements belonging to every AiA_i with iJi \in J, and it is determined by the family alone. For J=J = \varnothing that description is satisfied by every set whatsoever, so it determines nothing; an intersection of no subsets of XX is XX only relative to XX. Naming XX as part of the data and stipulating A=XA_\varnothing = X is what makes the symbol AJA_J defined for all JIJ \subseteq I, which is what the complementary form of the sieve identity requires.

(a) Every AJA_J is a finite subset of XX. For JJ \ne \varnothing pick iJi \in J; then AJAiXA_J \subseteq A_i \subseteq X. For J=J = \varnothing, AJ=XA_J = X. In both cases AJXA_J \subseteq X is finite by clause 1 of A subset of a finite set is finite, with BA\lvert B\rvert \le \lvert A\rvert, and equality holds if and only if B=AB = A, and so is UXU \subseteq X; hence AJ\lvert A_J\rvert and U\lvert U\rvert are natural numbers (The cardinality A\lvert A\rvert of a finite set).

(b) The index sets of the sieve's sums are finite. P(I)\mathcal{P}(I) is finite with P(I)=2I\lvert\mathcal{P}(I)\rvert = 2^{\lvert I\rvert} (P(A)=2A\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert} for finite AA); the set P(I){}\mathcal{P}(I) \setminus \{\varnothing\} of nonempty subsets of II and the set [I]j[I]^{j} of jj-element subsets of II are subsets of P(I)\mathcal{P}(I), hence finite (A subset of a finite set is finite, with BA\lvert B\rvert \le \lvert A\rvert, and equality holds if and only if B=AB = A), and [I]j=(Ij)\lvert [I]^{j}\rvert = \binom{\lvert I\rvert}{j} (The set [A]k[A]^{k} of kk-element subsets and the binomial coefficient (nk):=[n]k\binom{n}{k} := \lvert [n]^{k}\rvert).

(c) Monotonicity. If JJIJ \subseteq J' \subseteq I then AJAJA_{J'} \subseteq A_J. For J=J = \varnothing this is clause (a); otherwise an element lying in every AiA_i with iJi \in J' lies in every AiA_i with iJi \in J.

(d) The trace of a point. For xXx \in X put

T(x)  :=  {iI : xAi}I,T(x) \;:=\; \{\, i \in I \ :\ x \in A_i \,\} \subseteq I ,

a finite set. For every nonempty JIJ \subseteq I,

xAJ    JT(x),x \in A_J \iff J \subseteq T(x) ,

both sides saying that xAix \in A_i for every iJi \in J. And xUx \in U if and only if T(x)T(x) \ne \varnothing. Writing t(x):=T(x)t(x) := \lvert T(x)\rvert, clause (b) applied to T(x)T(x) gives [T(x)]j=(t(x)j)\lvert [T(x)]^{j}\rvert = \binom{t(x)}{j}, and for nonempty JJ the condition xAJx \in A_J with J=j\lvert J\rvert = j says exactly that J[T(x)]jJ \in [T(x)]^{j}.

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

Remarks

  • The counts stay in N\mathbb{N}; the identities do not. Each AJ\lvert A_J\rvert is a natural number. Every identity that sieves them carries a minus sign, and N\mathbb{N} has no subtraction, so those identities are stated in R\mathbb{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.

  • II is an arbitrary finite index set, not a natural number. Nothing below numbers the sets A0,A1,A_0, A_1, \dots; the subsets JIJ \subseteq I are the objects the sums run over, and J\lvert J\rvert rather than any position is what carries the sign.

  • The clause A=XA_\varnothing = X supplies every empty-subfamily term. In the complementary form at J=J = \varnothing it contributes X\lvert X\rvert; 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 · next 3 levels

Direct dependencies and their dependencies through the next three levels: 49 results over 22 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