Struggling with Zero Content Proofs?

In summary: But wait a second...the definition says FINITE cover of rectangles, then how be k be infinity?Dick is making the (intuitive) point that you can get the area of the cover as close to zero as you like; because in the limit (k ---> infinity), it has zero area. In other words, for a given epsilon, you can make the cover smaller than epsilon by pushing k as close to infinity as you...
  • #1
kingwinner
1,270
0
http://www.geocities.com/asdfasdf23135/advcal15.JPG

Well...I have no idea about this question. I don't even know where to start, and I am having terrible panic on these types of proof.

Can someone please explain and guide me through? Believe it or not, my textbook (which is horrible) has absolutely no examples on it, and it expects me to be able to do in the exercises after the section, this is making me feeling really deseparate...

I really need some help on this topic! So if someone understands it well, please help me out!

Thanks a million!
 
Last edited:
Physics news on Phys.org
  • #2
What is v(Ui)?
 
  • #3
Just draw a picture of the diamond. You can cover it with four squares with side length 1 for a total area of 4. If you use squares with sides of length 1/2, you can cover it with eight of them, for a total area of 2. If you use sixteen with side 1/4, total area 1. Extrapolate.
 
  • #4
To Enuma:

v(U_i) is the "volume" of U_i. So if U = [a_1,b_1] x ... x [a_n,b_n], then vol(U)= (b_1-a_1)...(b_n-a_n).
 
  • #5
Dick said:
Just draw a picture of the diamond. You can cover it with four squares with side length 1 for a total area of 4. If you use squares with sides of length 1/2, you can cover it with eight of them, for a total area of 2. If you use sixteen with side 1/4, total area 1. Extrapolate.

But the definition says FINITE cover of rectangles, then how can I extrapolate to infinity?

How can do a prove on this rigorously?

I am really lost on this topic, and I hope somebody can provide more help...

Thanks!
 
  • #6
The more rectangles you use the smaller the area. You can stop when the area is less than epsilon. Describing a cover whose area is less than epsilon is a rigorous proof.
 
  • #7
I sort of get the idea now.

But how can I describe the reatangles mathematically and choose an appropriate partition?


Also, do I need 4 separate cases (one for each side of the diamond) for this proof?
 
Last edited:
  • #8
I'll illustrate with squares with each side = s.

To cover each side of the diamond with k squares, you need to solve ("length of one side of the diamond"/k)^2 = 2s^2 for s.
 
  • #9
EnumaElish said:
I'll illustrate with squares with each side = s.

To cover each side of the diamond with k squares, you need to solve ("length of one side of the diamond"/k)^2 = 2s^2 for s.
Hi,

Why do I have to solve for s? How can this help?
 
  • #10
Can I just restrict my attention to one side, say x>0, y>0, prove that it has zero cotent, and argue that the other 3 sides also has zero content due to SYMMETRY?
 
  • #11
kingwinner said:
Hi,

Why do I have to solve for s? How can this help?
In response to your "But how can I describe the reatangles mathematically and choose an appropriate partition?"
 
  • #12
kingwinner said:
Can I just restrict my attention to one side, say x>0, y>0, prove that it has zero cotent, and argue that the other 3 sides also has zero content due to SYMMETRY?
I think so.
 
  • #13
EnumaElish said:
I'll illustrate with squares with each side = s.

To cover each side of the diamond with k squares, you need to solve ("length of one side of the diamond"/k)^2 = 2s^2 for s.

Um...why do you need to solve the left side? And why do you need a "2" on the right side?

Sorry...I don't see where this comes from...
 
  • #14
Each side of your diamond is a diagonal, and can be thought of as a diagonal of a square. Say it has length = L.

To cover L with k squares, the diagonal of each of the k squares has to be L/k. Are you with me so far?
 
  • #15
EnumaElish said:
Each side of your diamond is a diagonal, and can be thought of as a diagonal of a square. Say it has length = L.

To cover L with k squares, the diagonal of each of the k squares has to be L/k. Are you with me so far?

Yes, I am with you so far!
 
  • #16
kingwinner said:
Yes, I am with you so far!

Ok, so what's the area of one of those squares? What's the total area of all of them?
 
  • #17
Dick said:
Ok, so what's the area of one of those squares? What's the total area of all of them?

Is it L^2 / (2k) ?

How does this help?
 
  • #18
If that's the total area of all of them, then yes. What happens as k->infinity?
 
  • #19
Dick said:
If that's the total area of all of them, then yes. What happens as k->infinity?

But wait a second...the definition says FINITE cover of rectangles, then how be k be infinity?
 
  • #20
Dick is making the (intuitive) point that you can get the area of the cover as close to zero as you like; because in the limit (k ---> infinity), it has zero area. In other words, for a given epsilon, you can make the cover smaller than epsilon by pushing k as close to infinity as you like.
 
  • #21
k->infinity doesn't mean k=infinity. As EnumaElish says.
 

1. What are zero knowledge proofs?

Zero knowledge proofs are a type of cryptographic protocol that allows a prover to demonstrate to a verifier that they have certain information or knowledge, without revealing that information to the verifier.

2. How do zero knowledge proofs work?

Zero knowledge proofs use complex mathematical calculations and algorithms to allow a prover to convince a verifier that they have certain knowledge or information, without actually revealing that knowledge or information.

3. What are the potential applications of zero knowledge proofs?

Zero knowledge proofs have a wide range of potential applications, including secure authentication, digital signatures, and privacy-preserving data sharing. They can also be used in cryptocurrency and blockchain technology to prove ownership or transfer of assets without revealing personal information.

4. Are zero knowledge proofs completely foolproof?

While zero knowledge proofs are considered highly secure, they are not completely foolproof. There is always a small chance that a dishonest prover could manipulate the system to trick the verifier. However, this chance is incredibly small and can be reduced by using different types of zero knowledge proofs in combination.

5. Can zero knowledge proofs be broken by quantum computers?

There is ongoing research into the potential vulnerability of zero knowledge proofs to quantum computers. While it is possible that quantum computers could eventually break certain types of zero knowledge proofs, there are also efforts being made to develop quantum-resistant zero knowledge proof protocols.

Similar threads

  • Calculus and Beyond Homework Help
Replies
5
Views
3K
  • Calculus and Beyond Homework Help
Replies
32
Views
2K
  • Calculus and Beyond Homework Help
Replies
4
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
  • Calculus and Beyond Homework Help
Replies
7
Views
7K
Replies
4
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
Back
Top