OurBigBook About$ Donate
 Sign in Sign up

Weighted inclusion-exclusion principle (∑x∈/⋃i​Ai​​f(x)=∑S⊆{1,…,m}​(−1)∣S∣∑x∈⋂i∈S​Ai​​f(x))

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Inclusion-exclusion principle
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For finite subsets Ai​ of a finite ambient set X, the indicator function of their complement is ∏i​(1−1Ai​​). Expanding this finite product and summing it against any weight f:X→R proves the weighted formula. The empty intersection is X. Negative weights are allowed; finiteness removes every convergence issue.

 Ancestors (5)

  1. Inclusion-exclusion principle
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / ia / Paper 4 / 8E / Solution
  • Sum of reduced residues

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook