Proof that 0 + 0 +....+ 0 +.... = 0

  • Context: Undergrad 
  • Thread starter Thread starter deRoy
  • Start date Start date
  • Tags Tags
    Proof
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
33 replies · 5K views
With the same logic ##1+ \cdots + 1\,=\, 1## because ##\{1\} \cup \cdots \cup \{1\} = \{1\}##?
That approach brings more problems than it is supposed to solve, especially as it is trivial to show the limit directly with the definitions (as done in posts 27 and 29).
 
Mathematics news on Phys.org
mfb said:
With the same logic 1+⋯+1=11+ \cdots + 1\,=\, 1 because {1}∪⋯∪{1}={1}\{1\} \cup \cdots \cup \{1\} = \{1\}?

No beacuse defining the successor function for sets ##S(A)=A\cup\{A\}## you have that ##1=S(\emptyset)=\emptyset \cup \{\emptyset\}=\{\emptyset,\{\emptyset\}\}## so ##1+1 \not = 1## but ##\{\{\emptyset,\{\emptyset\}\},\{\{\emptyset,\{\emptyset\}\}\}\}=2##.
Ssnow
 
That is different from what you suggested before, and it is still wrong. If you identify addition with the union of sets then x+x=x for all x because ##s \cup s=s\quad \forall s##.

If you identify the addition with ##f(s,t)=\{s,\{t\}\}## then 1+1 works but nothing else works any more.
 
mfb said:
If you identify the addition with f(s,t)={s,{t}}f(s,t)=\{s,\{t\}\} then 1+1 works but nothing else works any more.

Yes, I was thinking of "classes" rather than "sets" ...