A Characterisation of Coincidence Ideals for Complex Values

We investigate properties of coincidence ideals in subattribute lattices that occur in complex value datamodels, i.e. sets of subattributes, on which two complex values coincide. we let complex values be defined by constructors for records, sets, multisets, lists, disjoint union and optionality, i.e. the constructors cover the gist of all complex value data models. such lattices carry the structure of a brouwer algebra as long as the union-constructor is absent, and for this case sufficient and necessary conditions for coincidence ideals are already known. in this paper, we extend the characterisation of coincidence ideals to the most general case. the presence of the disjoint union constructor complicates all results and proofs significantly. the reason for this is that the union-constructor causes non-trivial restructuring rules to hold. the characterisation of coincidence ideal is of decisive importance for the axiomatisation of (weak) functional dependencies.