Find the number of pairs of union/intersection operations (□1,□2)∈{∪,∩}2 satisfying the condition: for any sets S,T, function f:S→T, and subsets X,Y,Z of S, we have equality of sets f(X)□1(f(Y)□2f(Z))=f(X□1(Y□2Z)).
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
If and only if □1=□2=∪. See http://math.stackexchange.com/questions/359693/overview-of-
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.