Bachelier
- 375
- 0
Is it a solid proof to show that the closure of a union equals the union of the closures of the sets via induction?
The discussion revolves around the validity of using proof by induction to demonstrate that the closure of a union of sets is equal to the union of the closures of those sets. The scope includes theoretical aspects of mathematical proofs and the nature of different proof techniques.
Participants express differing views on the appropriateness of using induction for this proof. There is no consensus on whether induction is the best method, and some participants emphasize the importance of logical rigor over the method used.
Some assumptions about the nature of the sets involved (finite vs. infinite) are not fully clarified, and the discussion does not resolve whether induction is suitable for all cases.
Bachelier said:Is it a solid proof to show that the closure of a union equals the union of the closures of the sets via induction?
Number Nine said:How can we possibly know if your proof is valid if you don't show us your proof? Still, I'm not entirely sure why you would use induction here. Are you only considering the union of finitely many sets?
jedishrfu said:A proof is a proof no matter if you use induction or some direct method as long as the logic of each step is impeccable.
There are some math purists who disdain induction proofs for some theorems and prefer other styles of proof but that's beyond my math understanding to explain here:
http://en.wikipedia.org/wiki/Brouwer–Hilbert_controversy