forked from kmill/LeanTeX-mathlib
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBasic.lean
More file actions
232 lines (201 loc) · 8.67 KB
/
Basic.lean
File metadata and controls
232 lines (201 loc) · 8.67 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
import LeanTeX
import Mathlib
/-!
# LaTeX pretty printers for mathlib
-/
open LeanTeX
namespace Mathlib.LeanTeX
open Lean
open scoped MkAppNMacro
-- Note: `HasSubset.Subset` is not in scope here
latex_pp_app_rules (const := HasSubset.Subset)
| _, #[_, _, a, b] => do
let a ← latexPP a
let b ← latexPP b
return a.protectRight 50 ++ LatexData.nonAssocOp " \\subseteq " 50 ++ b.protectLeft 50
@[latex_pp_app const.Union.union] def pp_Union := basicBinOpPrinter " \\cup " 65 .left 4
@[latex_pp_app const.Inter.inter] def pp_Inter := basicBinOpPrinter " \\cap " 70 .left 4
/-- This renders `Set.image f X` as `f[X]`, which is a reasonably common notation for set image. -/
latex_pp_app_rules (const := Set.image)
| _, #[_, _, f, X] => do
let f ← latexPP f
let X ← latexPP X
return ← f.protectRight funAppBP ++ X.brackets |>.mergeBP (lbp := .NonAssoc funAppBP) (rbp := .NonAssoc funAppBP)
|>.maybeWithTooltip s!"image of \\({X.latex.1}\\) under \\({f.latex.1}\\)"
-- Use the type itself as the universe
latex_pp_app_rules (const := Finset.univ)
| _, #[ty, _] => latexPP ty
latex_pp_app_rules (const := Finset.prod)
| _, #[_α, _β, _inst, s, f] => do
let set ← withExtraSmallness 2 <| latexPP s
withBindingBodyUnusedName' f `i fun name body => do
let pbody ← latexPP body
let pbody := pbody.protectLeft 66
let psum := (← (LatexData.atomString "\\prod" |>.bigger 1).sub (s!"{name.toLatex} \\in " ++ set) |>.maybeWithTooltip "Finset.prod") ++ pbody
return psum |>.resetBP (lbp := .Infinity) |>.mergeBP (rbp := .NonAssoc 65)
latex_pp_app_rules (const := Finset.sum)
| _, #[_α, _β, _inst, s, f] => do
let set ← withExtraSmallness 2 <| latexPP s
withBindingBodyUnusedName' f `i fun name body => do
let pbody ← latexPP body
let pbody := pbody.protectLeft 66
let psum := (← (LatexData.atomString "\\sum" |>.bigger 1).sub (s!"{name.toLatex} \\in " ++ set) |>.maybeWithTooltip "Finset.sum") ++ pbody
return psum |>.resetBP (lbp := .Infinity) |>.mergeBP (rbp := .NonAssoc 65)
-- Suppress casts
latex_pp_app_rules (const := Nat.cast)
| _, #[_, _, n] => latexPP n
latex_pp_app_rules (const := Int.cast)
| _, #[_, _, n] => latexPP n
latex_pp_const_rule Rat := (LatexData.atomString "\\mathbb{Q}").maybeWithTooltip "Rat"
latex_pp_const_rule Real := (LatexData.atomString "\\mathbb{R}").maybeWithTooltip "Real"
latex_pp_const_rule Real.pi := LatexData.atomString "\\pi" |>.maybeWithTooltip "real.pi"
latex_pp_app_rules (const := Real.sqrt)
| _, #[x] => do
let v ← latexPP x
let (latex, bigness) := v.latex
-- Note: using an atom, but subscripts are incompatible with the square root symbol.
-- Assuming subscripts will never happen.
return .Atom ("\\sqrt{" ++ latex ++ "}") bigness none none
macro "latex_pp_trig_rule" c:ident tex:str : command =>
`(
latex_pp_app_rules (const := $c)
| _, #[x] => do
let v ← latexPP x
return LatexData.atomString $tex ++ " " ++ v.protect (funAppBP - 1)
|>.mergeBP (lbp := .NonAssoc funAppBP) (rbp := .NonAssoc funAppBP)
)
latex_pp_trig_rule Real.sin "\\sin"
latex_pp_trig_rule Real.cos "\\cos"
latex_pp_trig_rule Real.tan "\\tan"
latex_pp_trig_rule Real.arcsin "\\sin^{-1}"
latex_pp_trig_rule Real.arccos "\\cos^{-1}"
latex_pp_trig_rule Real.arctan "\\tan^{-1}"
latex_pp_app_rules (const := Finset.Icc)
| _, #[_, _, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "[" ++ lo ++ ", " ++ hi ++ "]" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.Ico)
| _, #[_, _, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "[" ++ lo ++ ", " ++ hi ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.Ioc)
| _, #[_, _, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "(" ++ lo ++ ", " ++ hi ++ "]" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.Ioo)
| _, #[_, _, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "(" ++ lo ++ ", " ++ hi ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.Iic)
| _, #[_, _, _, hi] => do
let hi ← latexPP hi
-- using infty is not technically correct. for example, ℕ would be starting from 0
return "(-\\infty, " ++ hi ++ "]" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.Iio)
| _, #[_, _, _, hi] => do
let hi ← latexPP hi
return "(-\\infty, " ++ hi ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.Ici)
| _, #[_, _, _, lo] => do
let lo ← latexPP lo
return "[" ++ lo ++ ", \\infty)" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.Ioi)
| _, #[_, _, _, lo] => do
let lo ← latexPP lo
return "(" ++ lo ++ ", \\infty)" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Icc)
| _, #[_, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "[" ++ lo ++ ", " ++ hi ++ "]" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Ico)
| _, #[_, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "[" ++ lo ++ ", " ++ hi ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Ioc)
| _, #[_, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "(" ++ lo ++ ", " ++ hi ++ "]" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Ioo)
| _, #[_, _, lo, hi] => do
let lo ← latexPP lo
let hi ← latexPP hi
return "(" ++ lo ++ ", " ++ hi ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Iio)
| _, #[_, _, hi] => do
let hi ← latexPP hi
return "(-\\infty, " ++ hi ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Iic)
| _, #[_, _, lo] => do
let lo ← latexPP lo
return "(-\\infty, " ++ lo ++ "]" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Ici)
| _, #[_, _, lo] => do
let lo ← latexPP lo
return "[" ++ lo ++ ", \\infty)" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Set.Ioi)
| _, #[_, _, lo] => do
let lo ← latexPP lo
return "(" ++ lo ++ ", \\infty)" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Finset.range)
| _, #[hi] => do
let hi ← latexPP hi
return "[0, " ++ hi ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Nat.ceil)
| _, #[_, _, _, e] => do
let e ← LeanTeX.latexPP e
return "\\left\\lceil " ++ e ++ "\\right\\rceil" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Nat.floor)
| _, #[_, _, _, e] => do
let e ← LeanTeX.latexPP e
return "\\left\\lfloor " ++ e ++ "\\right\\rfloor" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Max.max)
| _, #[_, _, a, b] => do
let a ← LeanTeX.latexPP a
let b ← LeanTeX.latexPP b
return "\\max(" ++ a ++ "," ++ b ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Min.min)
| _, #[_, _, a, b] => do
let a ← LeanTeX.latexPP a
let b ← LeanTeX.latexPP b
return "\\min(" ++ a ++ "," ++ b ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Singleton.singleton)
| _, #[_, _, _, a] => do
let a ← LeanTeX.latexPP a
return "\\{ " ++ a ++ " \\}" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := Inv.inv)
| _, #[_, _, a] => do
let a ← LeanTeX.latexPP a
return a.protectRight 100 ++ LatexData.atomString "^{-1}"
latex_pp_app_rules (const := HSMul.hSMul)
| _, #[_, _, _, _, a, b] => do
let a ← LeanTeX.latexPP a
let b ← LeanTeX.latexPP b
return "(" ++ a ++ " \\cdot " ++ b ++ ")" |>.resetBP .Infinity .Infinity
latex_pp_app_rules (const := DirectSum)
| _, #[ι, β, _inst] => do
let pι ← withExtraSmallness 2 <| latexPP ι
withBindingBodyUnusedName' β `i fun name body => do
let pbody ← latexPP body
let psum := (← (LatexData.atomString "\\bigoplus" |>.bigger 1).sub (s!"{name.toLatex} \\in " ++ pι) |>.maybeWithTooltip "DirectSum") ++ pbody
return psum |>.resetBP (rbp := .NonAssoc 0)
latex_pp_app_rules (const := TensorProduct)
| _, #[R, _, M, N, _, _, _, _] => do
let pR ← latexPP R
let pM ← latexPP M
let pN ← latexPP N
return pM.protectRight 100 ++ (LatexData.atomString "\\otimes" |>.sub pR) ++ pN.protectLeft 100
latex_pp_app_rules (const := PiTensorProduct)
| _, #[ι, R, _, s, _, _] => do
let pι ← latexPP ι
let _pR ← latexPP R
withBindingBodyUnusedName' s `i fun name body => do
let pbody ← latexPP body
let psum := (← (LatexData.atomString "\\bigotimes" |>.bigger 1).sub (s!"{name.toLatex} \\in " ++ pι) |>.maybeWithTooltip "PiTensorProduct") ++ pbody
return psum |>.resetBP (rbp := .NonAssoc 0)