Question

What do we mean by elegance in mathematical proof?​

Answer 1

Answer:

A proof is elegant if it has less no of steps when we break up the proof into largest no of pieces possible, i.e. the proof consists of only axioms and modus ponens. A proof is elegant if it based on least no of axioms, but this can't be true because the statement of the proof can itself be treated as an axiom.

Answer 2

A proof is elegant if it has less no of steps when we break up the proof into largest no of pieces possible, i.e. the proof consists of only axioms and modus ponens. A proof is elegant if it based on least no of axioms, but this can't be true because the statement of the proof can itself be treated as an axiom.

Hope it helps...

Have a great day...