Is Huffman Encoding always optimal?
Yes, it is always optimal.

No, there is no threshold where it would use less space to use fixed length non-encoded data.

I found a number of proofs on the Web, but there is sufficient discussion in the Wikipedia article Huffman coding.

This also covers other techniques which achieve higher compression (working outside the space for which the Huffman code is optimal).