Skip to content

Commit 25573b5

Browse files
authored
Merge pull request #105 from proux01/minor-cleanup
Doc typos and minor cleanup
2 parents 883ecef + 11a612c commit 25573b5

File tree

1 file changed

+11
-13
lines changed

1 file changed

+11
-13
lines changed

src/mpoly.v

Lines changed: 11 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -16,18 +16,18 @@
1616
(* delimited by %MM *)
1717
(* [multinom E i | i < n] *)
1818
(* == the monomial in n variables whose i-th power is E(i) *)
19-
(* mdeg m == the degree of the monomial m; i.e. *)
20-
(* mdeg m = \sum_(i < n) (m i) *)
19+
(* mdeg m == the degree of the monomial m; *)
20+
(* i.e. mdeg m = \sum_(i < n) (m i) *)
2121
(* 'X_{1..n < k} == the finite type of monomials in n variables with *)
2222
(* degree bounded by k. *)
23-
(* (m1 <= m2)%MM == the point-wise partial order over monomials, i.e. *)
24-
(* (m1 <= m2)%MM <=> forall i, m1 i <= m2 i *)
23+
(* (m1 <= m2)%MM == the point-wise partial order over monomials, *)
24+
(* i.e. (m1 <= m2)%MM <=> forall i, m1 i <= m2 i *)
2525
(* (m1 <= m2)%O == the total cpo (equipped with a cpoType) over *)
2626
(* monomials. This is the degrevlex monomial ordering. *)
2727
(* 0, 'U_i, m1 + m2, == 'X_{1..n} is equipped with a semi-group structure, *)
2828
(* m1 - m2, m *+ n, ... all operations being point-wise. The substraction *)
29-
(* is truncated when (m1 <= m2)%MM does not hold. *)
30-
(* mlcm m1 m2 == the monomial that is the least common multiple *)
29+
(* is truncated when (m2 <= m1)%MM does not hold. *)
30+
(* mlcm m1 m2 == the monomial that is the least common multiple *)
3131
(* {mpoly R[n]} == the type of multivariate polynomials in n variables *)
3232
(* and with coefficients of type R represented as *)
3333
(* {free 'X_{1..n} / R}, i.e. as a formal sum over *)
@@ -52,16 +52,16 @@
5252
(* monomial of p for the degrevlex monimial ordering. *)
5353
(* mlead p defaults to 0%MM when p is 0. *)
5454
(* mlast p == the smallest non-zero monomial of p for the *)
55-
(* degrevlex monimial ordering. *)
55+
(* degrevlex monimial ordering. *)
5656
(* mlast p defaults to 0%MM when p is 0. *)
5757
(* mleadc p == the coefficient of the highest monomial in p; *)
5858
(* this is a notation for p@_(mlead p). *)
5959
(* p \is a mpolyOver S <=> the coefficients of p satisfy S; S should have a *)
6060
(* key that should be (at least) an addrPred. *)
6161
(* p.@[x] == the evaluation of a polynomial p at a point x, where *)
62-
(* v is a n.-tuple R s.t. 'X_i evaluates to (tnth v i) *)
63-
(* p^`M() == formal derivative of p w.r.t the i-th variable *)
64-
(* p^`M(n, i) == formal n-derivative of p w.r.t the i-th variable *)
62+
(* x is a n.-tuple R s.t. 'X_i evaluates to (tnth x i) *)
63+
(* p^`M(i) == formal derivative of p w.r.t the i-th variable *)
64+
(* p^`M(i, n) == formal n-derivative of p w.r.t the i-th variable *)
6565
(* p^`M[m] == formal parallel (m i)-derivative of p w.r.t the *)
6666
(* i-th variable, i ranging in {0..n.-1}. *)
6767
(* p \mPo lq == multivariate polynomial composition, where lq is a *)
@@ -4133,9 +4133,7 @@ apply/eqP; rewrite eq_sym eqEcard; apply/andP; split.
41334133
apply/negP=> /imsetP [/=] x _ /eqP.
41344134
by rewrite eqE /= eq_sym ltn_eqF.
41354135
have := disjoint_S n k; rewrite -leq_card_setU=> /eqP->.
4136-
rewrite !card_imset //= ?card_draws /=;
4137-
try exact/inj_swiden; try exact/inj_mDswiden.
4138-
(* remove the line above once requiring Coq >= 8.17 *)
4136+
rewrite !card_imset //= ?card_draws /=.
41394137
by rewrite !card_ord binS.
41404138
Qed.
41414139

0 commit comments

Comments
 (0)