Skip to content

Commit

Permalink
Blueprint: Fix links to Lean declarations
Browse files Browse the repository at this point in the history
  • Loading branch information
YaelDillies committed Oct 30, 2023
1 parent c96629b commit 5104404
Show file tree
Hide file tree
Showing 4 changed files with 8 additions and 8 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -13,10 +13,10 @@ Rename
* `map_add_mul` → `map_add_eq_mul`
* `map_zero_one` → `map_zero_eq_one`
* `map_nsmul_pow` → `map_nsmul_eq_pow`
* `coe_to_fun_apply` → whatever is better, maybe change to `ψ.to_monoid_hom a = ψ (of_mul a)`.
* `coe_toFun_apply` → whatever is better, maybe change to `ψ.toMonoidNom a = ψ (of_mul a)`.
Kill the evil instance `add_char.monoid_hom_class`. It creates a diamond for
`fun_like (add_char G R) _ _`.
Kill the evil instance `AddChar.MonoidHomClass`. It creates a diamond for
`FunLike (AddChar G R) _ _`.
-/

--TODO: This instance is evil
Expand All @@ -39,7 +39,7 @@ instance instFunLike : FunLike (AddChar G R) G fun _ ↦ R where
coe := (⇑)
coe_injective' ψ χ h := by obtain ⟨⟨_, _⟩, _⟩ := ψ; congr

-- TODO: Replace `add_char.to_monoid_hom`
-- TODO: Replace `AddChar.toMonoidHom`
/-- Interpret an additive character as a monoid homomorphism. -/
def toMonoidHom' : AddChar G R ≃ (Multiplicative G →* R) := Equiv.refl _

Expand Down
2 changes: 1 addition & 1 deletion blueprint/src/ap.tex
Original file line number Diff line number Diff line change
Expand Up @@ -110,7 +110,7 @@ \chapter{Almost-Periodicity}

\begin{theorem}[$L_p$ almost periodicity]
\label{lp_ap}
\lean{almost_periodicity}
\lean{AlmostPeriodicity.almost_periodicity}
\leanok
Let $\epsilon\in (0,1]$ and $m\geq 1$. Let $K\geq 2$ and $A,S\subseteq G$ with $\lvert A+S\rvert\leq K\lvert A\rvert$.
Let $f:G\to \bbc$. There exists $T\subseteq G$ such that
Expand Down
4 changes: 2 additions & 2 deletions blueprint/src/chang.tex
Original file line number Diff line number Diff line change
Expand Up @@ -85,7 +85,7 @@ \chapter{Chang's lemma}
\begin{definition}[Energy]
\label{energy}
\uses{weight_energy}
\lean{boring_energy}
\lean{boringEnergy}
\leanok
Let $G$ be a finite abelian group and $A\subseteq G$. Let $m\geq 1$. We define
\[E_{2m}(A)=\sum_{a_1,\ldots,a_{2m}\in A}1_{a_1+\cdots-a_{2m}=0}.\]
Expand Down Expand Up @@ -146,7 +146,7 @@ \chapter{Chang's lemma}
\begin{lemma}
\label{energy_alt}
\uses{energy}
\lean{boring_energy_eq}
\lean{boringEnergy_eq}
\leanok
If $A\subset G$ and $m\geq 1$ then
\[E_{2m}(A) = \sum_x 1_A^{(m)}(x)^2.\]
Expand Down
2 changes: 1 addition & 1 deletion blueprint/src/ff.tex
Original file line number Diff line number Diff line change
Expand Up @@ -172,7 +172,7 @@ \chapter{Finite field model}

\begin{lemma}
\label{no3aps_inner_prod}
\lean{add_salem_spencer.L2inner_mu_conv_mu_mu_two_smul_mu}
\lean{AddSalemSpencer.l2inner_mu_conv_mu_mu_two_smul_mu}
\leanok
If $A\subseteq G$ has no non-trivial three-term arithmetic progressions and $G$ has odd order then
\[\langle \mu_A\ast \mu_A,\mu_{2\cdot A}\rangle = 1/\abs{A}^2.\]
Expand Down

0 comments on commit 5104404

Please sign in to comment.