Fix an integer n≥2, let N1={x1,…,xn} and N2={a,b,c} be disjoint, and set N=N1⊔N2. For J⊆N1 and K⊆N2, define
f(JK)=θK+∣J∣λK−μJK.
In the column order K=(∅,a,b,c,ab,ac,bc,abc), the tables are
n+1θ=(0,2n3+5n2,4n2+2n−1,3n2+n,2n3+8n2+4n−1,2n3+5n2+2n,6n2+4n−1,2n3+8n2+4n−1),
−λ=(n2,2n3+5n2+2n,4n2+2n−1,4n2+2n−1,2n3+8n2+4n−1,2n3+5n2+2n,6n2+4n−1,2n3+8n2+4n−1).
The only nonzero μ values are μ{a}=2n2(n+1) and μ{a,b}=2n(n+1)2, on those exact subsets of N.
For pairwise disjoint subsets U,V,W,α1,…,αp of a fixed finite ground set, empty subsets permitted, put
Lp(h;U,V,W,α)=i=1∑pIh(U:V∣αi)+i=1∑ph(αi)−h(i=1⋃pαi)−(p−1)Ih(UV:W).
Here h is a normalized real set function, Ih(U:V)=h(U)+h(V)−h(UV) and Ih(U:V∣W)=h(UW)+h(VW)−h(W)−h(UVW); juxtaposition denotes union. The constrained inequality Cp is Lp≥0 under Ih(U:W∣V)=Ih(V:W∣U)=0.
The function satisfies If(a:c∣b)=If(b:c∣a)=0. For every integer p≥2 with p=n and every pairwise disjoint family αi⊆N1,
Lp(f;a,b,c,α)≥0,Ln(f;a,b,c,({xi})i=1n)<0.
The labels a,b,c are fixed in the first assertion and the αi may be empty. This is a separation by the explicit table, without requiring f to obey weak monotonicity.
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number n≥2, let Pn={A,B,C}⊔{Xi:0≤i<n}, with distinct labels, and set X={Xi:0≤i<n}. For M⊆Pn, define K=M∩{A,B,C}, r=∣M∩X∣, and
Fn(M)=(n+1)Tn(K)−rLn(K)−2n2(n+1)1M={A}−2n(n+1)21M={A,B},
where 1 denotes an indicator and
K∅{A}{B}{C}{A,B} or {A,B,C}{A,C}{B,C}Tn(K)02n3+5n24n2+2n−13n2+n2n3+8n2+4n−12n3+5n2+2n6n2+4n−1Ln(K)n22n3+5n2+2n4n2+2n−14n2+2n−12n3+8n2+4n−12n3+5n2+2n6n2+4n−1
For subsets of Pn, write
JF(U,V;W)=Fn(U∪W)+Fn(V∪W)−Fn(W)−Fn(U∪V∪W),IF(U;V)=Fn(U)+Fn(V)−Fn(U∪V),
using a party label as shorthand for its singleton. The assertion is the conjunction of
JF(A,C;B)=0,JF(B,C;A)=0,
the statement that for every natural number p≥2 with p=n and every indexed collection α0,…,αp−1 of pairwise disjoint subsets of X,
0≤i=0∑p−1JF(A,B;αi)+i=0∑p−1Fn(αi)−Fn(i=0⋃p−1αi)−(p−1)IF(AB;C),
and the strict inequality
i=0∑n−1JF(A,B;Xi)+i=0∑n−1Fn(Xi)−Fn(X)−(n−1)IF(AB;C)<0.
Here AB={A,B}; the sets αi may be empty, need not cover X, and p may exceed n.
Confirmed by the moderator at approval.