Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Lspace #1230

Open
wants to merge 28 commits into
base: master
Choose a base branch
from
Open

Lspace #1230

wants to merge 28 commits into from

Conversation

hoheinzollern
Copy link
Collaborator

No description provided.

@affeldt-aist
Copy link
Member

The CI error is:

       > COQC theories/lspace.v
       > File "./theories/lspace.v", line 82, characters 33-42:
       > Error: Syntax error: [reduce] expected after ':=' (in [def_body]).

@hoheinzollern
Copy link
Collaborator Author

Wikipedia uses the p-norm to define Lp spaces when p may be +oo, whereas for example this reference sticks to the definition that was previously in this PR. Klenke also seems to go with the Wikipedia approach.
I have now moved to using norms in the last commits, and extending the theory to extended reals.
Is there a good reason to choose one over the other?

Comment on lines +157 to +161
match p with
| r%:E => [get q : R | r^-1 + q^-1 = 1]%:E
| +oo => 1
| -oo => 0
end.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This is ill-defined when p = 1, writing the following

Suggested change
match p with
| r%:E => [get q : R | r^-1 + q^-1 = 1]%:E
| +oo => 1
| -oo => 0
end.
[get q : \bar R | (q > 0) /\ r^-1 + q^-1 = 1]

with a proper definition of ^-1 that I might PR soon.

Comment on lines 248 to 260
Lemma ess_sup_cst_lty r : (0 < mu setT)%E -> (ess_sup mu (cst r) < +oo)%E.
Proof.
rewrite /ess_sup => mu0.
under eq_set do rewrite preimage_cst/=.
rewrite ereal_inf_EFin ?ltry//.
- exists r => x/=; case: ifPn => [_|].
by move: mu0 => /[swap] ->; rewrite ltNge lexx.
by rewrite set_itvE notin_setE//= ltNge => /negP/negbNE.
by exists r => /=; rewrite ifF//; rewrite set_itvE;
rewrite memNset //=; apply/negP; rewrite -real_leNgt ?num_real.
Qed.

Lemma ess_sup_cst r : (0 < mu setT)%E -> (ess_sup mu (cst r) = r%:E)%E.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The former lemma is subsumed by the latter.

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

no need to have it indeed

Qed.


Lemma Lnorm_eq0 (f : ty) : nm f = 0 -> f = 0 %[ae mu].
Copy link
Member

@CohenCyril CohenCyril Feb 7, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Add a lemma saying forall f : ty, nm f = 'N[mu]_p[f]%:E

Comment on lines +4114 to +4134
Require Import -(notations) Setoid.

Declare Scope signature_scope.
Delimit Scope signature_scope with signature.
Import -(notations) Morphisms.
Module ProperNotations.

Notation " R ++> R' " := (@respectful _ _ (R%signature) (R'%signature))
(right associativity, at level 55) : signature_scope.

Notation " R ==> R' " := (@respectful _ _ (R%signature) (R'%signature))
(right associativity, at level 55) : signature_scope.

Notation " R ~~> R' " := (@respectful _ _ (Program.Basics.flip (R%signature)) (R'%signature))
(right associativity, at level 55) : signature_scope.

End ProperNotations.
Import ProperNotations.

Arguments Proper {A}%_type R%_signature m.
Arguments respectful {A B}%_type (R R')%_signature _ _.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This should be in a dedicated compat file for importing setoid rewrite into MCA.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants