Simple Indicator Function and its Set

In summary: Yes, you got it.In summary, the conversation discusses how to prove that for any function f with values of 0 or 1, there exists a subset A of the real numbers such that f equals the indicator function C_A, where C_A is defined as 0 for numbers not in A and 1 for numbers in A. The solution involves considering all possible values for f and determining the corresponding set A.
  • #1
Seydlitz
263
4

Homework Statement



This is taken from Spivak's Calculus Book Chapter 3 - Functions, Problem 9.

Suppose ##f## is a function such that ##f(x)=1\text{ or }0## for each ##x##. Prove that there is a set ##A## such that ##f = C_A## ##C_A## is an indicator function, where ##C_A(x)=0## if ##x## is not in ##A##, and 1 if ##x## is in ##A##

Homework Equations



I've finished the previous sub-problem (a) in the same number.

The Attempt at a Solution


I don't understand clearly what does the problem wants us to prove. Is it asking us whether a set exist like this for example ##A=\{x : f(x)=1 \text{ or } 0\}## exist? How then can we prove that it is true? What kind of condition is that? I mean how can we know what lies inside of a set, with only the property, that it has to lie inside the set. It's a bit confusing..

EDIT: Isn't it like hey I tell my friend to go to a market to buy something and put it in a bucket. So what do you want to buy then? He asked. I want to buy everything that is in that bucket.

Thank You
 
Last edited:
Physics news on Phys.org
  • #2
Seydlitz said:
I don't understand clearly what does the problem wants us to prove. Is it asking us whether a set exist like this for example ##A=\{x : f(x)=1 \text{ or } 0\}## exist?
Well, it wouldn't be ##A=\{x : f(x)=1 \text{ or } 0\}##. Are there any values of ##x## that are NOT in that set?

You want ##A## to be the set of points ##x## where ##f(x) = ##what value?
 
  • #3
jbunniii said:
Well, it wouldn't be ##A=\{x : f(x)=1 \text{ or } 0\}##. Are there any values of ##x## that are NOT in that set?

You want ##A## to be the set of points ##x## where ##f(x) = ##what value?

Ah I see, because it is a set of all real number ##x## that ##C_A## is referring to, then there's actually no real number which is not in the set. So ##f(x)## has to be 1. Is the reasoning right?
 
  • #4
Seydlitz said:
Ah I see, because it is a set of all real number ##x## that ##C_A## is referring to, then there's actually no real number which is not in the set. So ##f(x)## has to be 1. Is the reasoning right?
Right, so write out the definition of ##A## and you're pretty much done. I'm not sure why Spivak is asking for a "proof" here as there isn't much to prove.
 
  • #5
jbunniii said:
Right, so write out the definition of ##A## and you're pretty much done. I'm not sure why Spivak is asking for a "proof" here as there isn't much to prove.

Ok sure I'll do so. On the other hand, will setting the condition of ##f(x)=0## create an empty set then?

Thanks for your help.
 
  • #6
No, you are missing the whole point. You are told only that f(x) takes on values of 0 and 1. f(x) could be "f(x)= 0 if x is rational, 1 if x is irrational". In that case, A= {x| f(x)= 1} is the set of irrational numbers, B= {x| f(x)= 0} is the set of rational numbers.

Or you could have f(x) defined to be 0 for all x. In that case A would be empty.
 
  • #7
HallsofIvy said:
No, you are missing the whole point. You are told only that f(x) takes on values of 0 and 1. f(x) could be "f(x)= 0 if x is rational, 1 if x is irrational". In that case, A= {x| f(x)= 1} is the set of irrational numbers, B= {x| f(x)= 0} is the set of rational numbers.

Or you could have f(x) defined to be 0 for all x. In that case A would be empty.

Yes it is true, but then the question says such that ##f=C_A##. While ##C_A## clearly stipulates 1 for the set of real number ##A##.
 
  • #8
Seydlitz said:
Yes it is true, but then the question says such that ##f=C_A##. While ##C_A## clearly stipulates 1 for the set of real number ##A##.

Look at the question again:

Seydlitz said:
Suppose ##f## is a function such that ##f(x)=1\text{ or }0## for each ##x##. Prove that there is a set ##A## such that ##f = C_A## ##C_A## is an indicator function, where ##C_A(x)=0## if ##x## is not in ##A##, and 1 if ##x## is in ##A##

This is asking you to prove that, for every [itex]f : \mathbb{R} \to \{0, 1\}[/itex], there exists a subset [itex]A \subset \mathbb{R}[/itex] such that [itex]f(x) = 1[/itex] if and only if [itex]x \in A[/itex] and [itex]f(x) = 0[/itex] if and only if [itex]x \in \mathbb{R} \setminus A[/itex].

There's really only one choice for A. What is it?
 
  • #9
pasmith said:
Look at the question again:

This is asking you to prove that, for every [itex]f : \mathbb{R} \to \{0, 1\}[/itex], there exists a subset [itex]A \subset \mathbb{R}[/itex] such that [itex]f(x) = 1[/itex] if and only if [itex]x \in A[/itex] and [itex]f(x) = 0[/itex] if and only if [itex]x \in \mathbb{R} \setminus A[/itex].

There's really only one choice for A. What is it?

##A## should be the set of real number ##\mathbb{R}## and that ##f(x)=1## because of the fact that there is an element in the set? Is there anything else in it? I'm sorry if I miss the subtleties but the language of set is a bit beyond my level right now.

Edit: Or ##A## must contain all rational number instead?
 
Last edited:
  • #10
A is NOT the set f all real numbers- it is the set of all numbers such that f(x)= 1.
 
  • #11
HallsofIvy said:
A is NOT the set f all real numbers- it is the set of all numbers such that f(x)= 1.

Ok, so this function ##f(x)## so to say is general right? We don't decide for now what makes it 1? We just prepare a container for whatever might make it ##1## according to our own definition?
 

1. What is a simple indicator function?

A simple indicator function, also known as a characteristic function, is a mathematical function that takes on only two values, typically 0 and 1. It is often used to indicate whether an element belongs to a certain set or not.

2. How is a simple indicator function defined?

A simple indicator function is defined as follows: IA(x) = 1 if x ∈ A and IA(x) = 0 if x ∉ A, where A is a set and x is an element.

3. What is the purpose of a simple indicator function?

The main purpose of a simple indicator function is to identify whether an element belongs to a specific set or not. It is often used in set theory, probability, and statistics, among other fields.

4. How is a simple indicator function represented?

A simple indicator function is typically represented using the Iverson bracket notation, where the function is enclosed in square brackets. For example, [x ∈ A] would represent the simple indicator function for an element x belonging to a set A.

5. Can a simple indicator function be used for more than two values?

Yes, a simple indicator function can be extended to have more than two values, depending on the application. For example, in probability and statistics, a simple indicator function can take on values of 0, 1, or -1 to represent different outcomes or events.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
499
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
759
  • Calculus and Beyond Homework Help
Replies
7
Views
267
  • Calculus and Beyond Homework Help
Replies
3
Views
521
  • Calculus and Beyond Homework Help
Replies
8
Views
466
  • Calculus and Beyond Homework Help
Replies
9
Views
2K
  • Calculus and Beyond Homework Help
Replies
9
Views
939
  • Calculus and Beyond Homework Help
2
Replies
35
Views
5K
  • Calculus and Beyond Homework Help
Replies
7
Views
2K
Back
Top