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 of subsets of a finite set , the intersections for , and the convention
Definition
A sieve family consists of a finite set , called the ambient set, a finite set , called the index set, and a family of subsets of , that is a function (Finite, countably infinite, countable, uncountable, The cardinality of a finite set). For set
and write for the union of the family.
Why the ambient set has to be named, and why is a stipulation. For the intersection is the set of elements belonging to every with , and it is determined by the family alone. For that description is satisfied by every set whatsoever, so it determines nothing; an intersection of no subsets of is only relative to . Naming as part of the data and stipulating is what makes the symbol defined for all , which is what the complementary form of the sieve identity requires.
(a) Every is a finite subset of . For pick ; then . For , . In both cases is finite by clause 1 of A subset of a finite set is finite, with , and equality holds if and only if , and so is ; hence and are natural numbers (The cardinality of a finite set).
(b) The index sets of the sieve's sums are finite. is finite with ( for finite ); the set of nonempty subsets of and the set of -element subsets of are subsets of , hence finite (A subset of a finite set is finite, with , and equality holds if and only if ), and (The set of -element subsets and the binomial coefficient ).
(c) Monotonicity. If then . For this is clause (a); otherwise an element lying in every with lies in every with .
(d) The trace of a point. For put
a finite set. For every nonempty ,
both sides saying that for every . And if and only if . Writing , clause (b) applied to gives , and for nonempty the condition with says exactly that .
Remarks
-
The counts stay in ; the identities do not. Each is a natural number. Every identity that sieves them carries a minus sign, and has no subtraction, so those identities are stated in 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.
-
is an arbitrary finite index set, not a natural number. Nothing below numbers the sets ; the subsets are the objects the sums run over, and rather than any position is what carries the sign.
-
The clause supplies every empty-subfamily term. In the complementary form at it contributes ; later sieve instances also use it when identifying the intersection at the empty subfamily. Removing the stipulation would leave those terms undefined.
Depends on
- The cardinality $\lvert A\rvert$ of a finite set
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
- $\lvert\mathcal{P}(A)\rvert = 2^{\lvert A\rvert}$ for finite $A$
- The set $[A]^{k}$ of $k$-element subsets and the binomial coefficient $\binom{n}{k} := \lvert [n]^{k}\rvert$
- Finite, countably infinite, countable, uncountable
Used by
- The complementary inclusion-exclusion formula is Möbius inversion on the Boolean lattice Corollary
- A three-set count that drops the triple intersection and returns the wrong answer Counterexample
- The sieve run in full on three explicit finite sets and then on four, with every nonempty intersection listed Example
- FALSE: the real-valued three-set inclusion-exclusion identity remains true after deleting the triple-intersection term False statement
- FALSE: truncating the sieve at a fixed depth of at least two gives the exact size of the union False statement
- The conventions this page fixes: the empty intersection, where the counts live, the first index of every sum, and what the declared prerequisites do not supply Remark
- Euler's product formula φ(n)=n∏_p∣ n(1-1/p)=∏_pᵏ∥ n(pᵏ-pᵏ⁻¹) for n≥1, stated through a finite injective list of its prime divisors Theorem
- Inclusion and exclusion: ι|⋃_i ∈ I Aᵢ| = ∑_∅ ≠ J ⊆ I(-1)^| J| + 1 ι| A_J|, together with the complementary form counting the elements in none of the Aᵢ Theorem
- The number of surjections from an n-element set onto a k-element set is ∑_i<k+1(-1)ⁱbinomki(k-i)ⁿ, read in ℝ through ι Theorem
- Truncating the sieve at an odd depth over-estimates the size of the union and truncating it at an even depth under-estimates it Theorem
- ι(Dₙ) = ι(n!)∑_i<n+1(-1)ⁱ/ι(i!), with the term at i = 0 equal to 1 and D₀ = 1 Theorem
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
- Inclusion-exclusion principle (Wikipedia) (standard reference, not scraped)
- R. Stanley, Enumerative Combinatorics, Vol. 1, Ch. 2 (standard reference, not scraped)
- Guichard, The Inclusion-Exclusion Formula (LibreTexts) (standard reference, not scraped)