Zulip Chat Archive

Stream: new members

Topic: exists at most one


view this post on Zulip Ali Sever (Jul 25 2018 at 13:14):

I want to state p a b → ∃ (at most one) c, q c, and if such c exists, I want f a b = c. Is there a smart/efficient way to do this?

view this post on Zulip Kevin Buzzard (Jul 25 2018 at 13:29):

you'll need the axiom of choice, because you're constructing data from a proof :-)

view this post on Zulip Simon Hudon (Jul 25 2018 at 13:41):

Are you trying to build such a f?

The assertion I think could be made as p a b -> ∀ c₀ c₁, q c₀ → q c₁ → c₀ = c₁

view this post on Zulip Simon Hudon (Jul 25 2018 at 13:49):

If you're defining f, you can do it in two ways:

noncomputable def f {a b} (h : p a b) := classical.epsilon (λ c, q c)

If a proper c exists (and your type is nonempty), the above f will return it (but you can't evaluate it). If such a c doesn't exist, we don't know what value f has.

We can be more defensive and write:

noncomputable def f {a b} (h : p a b) (h' :  c, q c) := classical.some h'

This f can only used with a proof that a proper c exists and it will return that c (non-constructively, again).


Last updated: May 11 2021 at 14:11 UTC