where A and B are any 3x3 [matrices]
That seems like a bold claim.
put down any operators you found that partially satisfy [the equation], i.e. A & B [need] to be invertible, or…
Placing conditions on A and B seems more reasonable. I say that because I'd started by thinking about the simpler problem
det[A+B] = det[A] + det[B]
…… where A and B are 2×2 matrices
and it didn't take long to realize that the equation is not generally true.
After picking symbols for the elements of A and B, I wrote out expressions for det[A]+det[B] and for det[A+B]. They showed that the equation is true only when four specific terms in those expressions sum to zero. It is clear enough how to make that happen (i.e., how to choose elements of B, given elements of A). However, the success of forging B like that depends on a prerequisite condition:
none of the elements in A
or B
can be zero. (There could be other prerequisite conditions; I didn't write a proof.)
In other words, the equation det[A+B]=det[A]+det[B] is not true for
any pair of 2×2 matrices. Finding a single matrix operator K to always make it true seems unlikely. By extension, the claim in red above seems like a stretch.
Was this exercise given to you in class?