The matches of the annotated basis commute with homomorphisms #
The query the annotated basis theorem builds over {∅, Π, σ, apply, γ, win, μ^⊎, ε, −} reads no annotation, so one query serves every semiring of a
counter's class (exists_annEpsOps_matchU), and it gives the source's
annotated rows wherever the source settles. A homomorphism the source
commutes with therefore commutes with the match too: the match is the
source on both sides. Nothing is asked of the match's syntax – its labels
and recorded read sets may be those a construction copies, which
AggQueryIn.evaluateAnnotated_hom would not accept – only of the source.
The annotated basis theorem's match commutes with homomorphisms. For
every query of the annotated algebra in the minimal universe there is one
query over the nine classes which, between any two semirings where the
counter ch simulates a set recursion, commutes with every homomorphism
the source commutes with (AggQueryIn.evaluateAnnotated_hom), wherever the
source settles on both sides.