首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A localization inequality for set functions
Authors:László Lovász
Institution:a Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA
b Department of Mathematics-Hill Center, Rutgers University, 110 Frelinghuysen Road, Piscataway, NJ 08854, USA
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 View the MathML source for i∈{1,2}, there exists a positive multiplicative set function μ over S and two subsets A,BS such that for i∈{1,2}μ(A)fi(A)+μ(B)fi(B)+μ(AB)fi(AB)+μ(AB)fi(AB)?0. The Ahlswede-Daykin four function theorem can be deduced easily from this.
Keywords:Inequalities  Set functions  Four function theorem  Discrete localization
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号