A localization inequality for set functions

L. Lovász, Michael Saks

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We prove the following theorem, which is an analog for discrete set functions of a geometric result of Lovász and Simonovits. Given two real-valued set functions f1, f2 defined on the subsets of a finite set S, satisfying ∑X⊆S fi(X) ≥ 0 for i ∈ {1, 2}, there exists a positive multiplicative set function μ over S and two subsets A, B ⊆ S such that for i ∈ {1, 2} μ(A) fi(A) + μ(B) fi(B) + μ(A ∪ B) fi(A ∪ B) + μ(A ∩ B) fi(A ∩ B) ≥ 0. The Ahlswede-Daykin four function theorem can be deduced easily from this.

Original languageEnglish
Pages (from-to)726-735
Number of pages10
JournalJournal of Combinatorial Theory, Series A
Volume113
Issue number4
DOIs
Publication statusPublished - May 2006

Fingerprint

Set theory
Set-valued Function
Subset
Theorem
Finite Set
Multiplicative
Analogue

Keywords

  • Discrete localization
  • Four function theorem
  • Inequalities
  • Set functions

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A localization inequality for set functions. / Lovász, L.; Saks, Michael.

In: Journal of Combinatorial Theory, Series A, Vol. 113, No. 4, 05.2006, p. 726-735.

Research output: Contribution to journalArticle

Lovász, L. ; Saks, Michael. / A localization inequality for set functions. In: Journal of Combinatorial Theory, Series A. 2006 ; Vol. 113, No. 4. pp. 726-735.
@article{22e8d703d2d644e596066d0a6e08d212,
title = "A localization inequality for set functions",
abstract = "We prove the following theorem, which is an analog for discrete set functions of a geometric result of Lov{\'a}sz and Simonovits. Given two real-valued set functions f1, f2 defined on the subsets of a finite set S, satisfying ∑X⊆S fi(X) ≥ 0 for i ∈ {1, 2}, there exists a positive multiplicative set function μ over S and two subsets A, B ⊆ S such that for i ∈ {1, 2} μ(A) fi(A) + μ(B) fi(B) + μ(A ∪ B) fi(A ∪ B) + μ(A ∩ B) fi(A ∩ B) ≥ 0. The Ahlswede-Daykin four function theorem can be deduced easily from this.",
keywords = "Discrete localization, Four function theorem, Inequalities, Set functions",
author = "L. Lov{\'a}sz and Michael Saks",
year = "2006",
month = "5",
doi = "10.1016/j.jcta.2005.03.011",
language = "English",
volume = "113",
pages = "726--735",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "4",

}

TY - JOUR

T1 - A localization inequality for set functions

AU - Lovász, L.

AU - Saks, Michael

PY - 2006/5

Y1 - 2006/5

N2 - We prove the following theorem, which is an analog for discrete set functions of a geometric result of Lovász and Simonovits. Given two real-valued set functions f1, f2 defined on the subsets of a finite set S, satisfying ∑X⊆S fi(X) ≥ 0 for i ∈ {1, 2}, there exists a positive multiplicative set function μ over S and two subsets A, B ⊆ S such that for i ∈ {1, 2} μ(A) fi(A) + μ(B) fi(B) + μ(A ∪ B) fi(A ∪ B) + μ(A ∩ B) fi(A ∩ B) ≥ 0. The Ahlswede-Daykin four function theorem can be deduced easily from this.

AB - We prove the following theorem, which is an analog for discrete set functions of a geometric result of Lovász and Simonovits. Given two real-valued set functions f1, f2 defined on the subsets of a finite set S, satisfying ∑X⊆S fi(X) ≥ 0 for i ∈ {1, 2}, there exists a positive multiplicative set function μ over S and two subsets A, B ⊆ S such that for i ∈ {1, 2} μ(A) fi(A) + μ(B) fi(B) + μ(A ∪ B) fi(A ∪ B) + μ(A ∩ B) fi(A ∩ B) ≥ 0. The Ahlswede-Daykin four function theorem can be deduced easily from this.

KW - Discrete localization

KW - Four function theorem

KW - Inequalities

KW - Set functions

UR - http://www.scopus.com/inward/record.url?scp=33645553703&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645553703&partnerID=8YFLogxK

U2 - 10.1016/j.jcta.2005.03.011

DO - 10.1016/j.jcta.2005.03.011

M3 - Article

AN - SCOPUS:33645553703

VL - 113

SP - 726

EP - 735

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 4

ER -