A minimal primary decomposition is an expression
in which every is a primary ideal, the prime ideals are pairwise distinct, and the decomposition is irredundant: deleting any changes the intersection.
Solved by gpt-5.6-sol high.