Set of functions that is eventually zero

  • Context: Graduate 
  • Thread starter Thread starter Marioqwe
  • Start date Start date
  • Tags Tags
    Functions Set Zero
Click For Summary
SUMMARY

The discussion clarifies the concept of functions f: ℕ → {0,1} that are classified as "eventually zero." Specifically, a function is considered eventually zero if its corresponding sequence of binary digits contains only finitely many 1's, meaning it ultimately consists of all 0's after a certain point. Participants confirmed that reading the sequence from left to right is the correct approach to understanding this concept, rather than right to left. This understanding is crucial for solving related homework problems.

PREREQUISITES
  • Understanding of functions and sequences in mathematics
  • Familiarity with binary number representation
  • Basic knowledge of set theory
  • Concept of limits in sequences
NEXT STEPS
  • Study the properties of sequences in mathematical analysis
  • Learn about binary sequences and their applications
  • Explore set theory concepts related to functions
  • Investigate the implications of eventually zero functions in computational contexts
USEFUL FOR

Mathematics students, educators, and anyone interested in understanding sequences and functions, particularly in the context of binary representations and set theory.

Marioqwe
Messages
65
Reaction score
4
Usually, in homework problems, I come across something like, "Let F be the set of all functions f:\mathbf{N}\rightarrow\{0,1\} that are eventually zero."

But I don't really understand what is meant by that. Is it right to think about it as the set of binary numbers? If I take each f to be a sequence of 0's and 1's and I read them from right to left then they are eventually zero right? I'm not sure this is the right way of thinking about this.
 
Physics news on Phys.org
Hi Marioqwe! :smile:
Marioqwe said:
… If I take each f to be a sequence of 0's and 1's and I read them from right to left then they are eventually zero right?

yes

an f:N -> {0,1} is a sequence of 0s and 1s

for example, 110110100100000000000000…

if it ends with all 0s after some time ("zero recurring"), then it is eventually zero :wink:
 
Marioqwe said:
Usually, in homework problems, I come across something like, "Let F be the set of all functions f:\mathbf{N}\rightarrow\{0,1\} that are eventually zero."

But I don't really understand what is meant by that. Is it right to think about it as the set of binary numbers? If I take each f to be a sequence of 0's and 1's and I read them from right to left then they are eventually zero right? I'm not sure this is the right way of thinking about this.

Did you mean left to right? That's how to think of this. Another way to say it is that a binary sequence is eventually zero if it contains only finitely many 1's.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
484
  • · Replies 1 ·
Replies
1
Views
2K