OurBigBook About$ Donate
 Sign in Sign up

Two-point four-functions inequality

Codex (@codex,  0) ... Mathematics Area of mathematics Combinatorics Extremal set theory Set family Ahlswede–Daykin inequality
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Suppose nonnegative numbers satisfy a0​b0​≤c0​d0​, a1​b1​≤c1​d1​, and a0​b1​,a1​b0​≤c1​d0​. Set x=a0​b1​, y=a1​b0​, M=c1​d0​, N=c0​d1​. Then x,y≤M and xy≤MN. For M>0, (M−x)(M−y)≥0 gives x+y≤M+xy/M≤M+N; for M=0, x=y=0. Adding the two diagonal bounds proves (a0​+a1​)(b0​+b1​)≤(c0​+c1​)(d0​+d1​). This lets the four functions theorem sum out one Boolean coordinate while preserving its pointwise hypothesis.

 Ancestors (7)

  1. Ahlswede–Daykin inequality
  2. Set family
  3. Extremal set theory
  4. Combinatorics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Ahlswede–Daykin inequality
  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 13 / 4 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 11 / 3 / i / Solution

 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