It is possible to prove that a piece of code matches a given mathematical specification. That spec has to be good though, and there can still be hardware failures (e.g. bitflips), problems with the environment (if not proven correct as well), and more. It theoretically is possible though that way to at least 100% secure a not-too-complex piece of software by itself (without hardware).
Incorrect memory management leads to memory safety issues. That's what those words mean. You manage the memory, you get it wrong, you have a potentially exploitable memory safety issue. It sounds like you're just playing with words.
Fixing memory management errors fixes some memory safety issues, I agree with that, I only disagreed with your quantitative claim that you can fix all memory safety issues this way.
I wonder if it can be proven?