--- a/src/HOL/Analysis/Ball_Volume.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Ball_Volume.thy Tue Jan 01 21:47:27 2019 +0100
@@ -3,7 +3,7 @@
Author: Manuel Eberl, TU München
*)
-section \<open>The Volume of an $n$-Dimensional Ball\<close>
+section \<open>The Volume of an \<open>n\<close>-Dimensional Ball\<close>
theory Ball_Volume
imports Gamma_Function Lebesgue_Integral_Substitution
@@ -25,8 +25,8 @@
text \<open>
We first need the value of the following integral, which is at the core of
- computing the measure of an $n+1$-dimensional ball in terms of the measure of an
- $n$-dimensional one.
+ computing the measure of an \<open>n + 1\<close>-dimensional ball in terms of the measure of an
+ \<open>n\<close>-dimensional one.
\<close>
lemma emeasure_cball_aux_integral:
"(\<integral>\<^sup>+x. indicator {-1..1} x * sqrt (1 - x\<^sup>2) ^ n \<partial>lborel) =
--- a/src/HOL/Analysis/Binary_Product_Measure.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Binary_Product_Measure.thy Tue Jan 01 21:47:27 2019 +0100
@@ -336,7 +336,7 @@
by (simp add: ac_simps)
qed
-subsection%important \<open>Binary products of $\sigma$-finite emeasure spaces\<close>
+subsection%important \<open>Binary products of \<open>\<sigma>\<close>-finite emeasure spaces\<close>
locale%important pair_sigma_finite = M1?: sigma_finite_measure M1 + M2?: sigma_finite_measure M2
for M1 :: "'a measure" and M2 :: "'b measure"
--- a/src/HOL/Analysis/Bochner_Integration.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Bochner_Integration.thy Tue Jan 01 21:47:27 2019 +0100
@@ -2100,7 +2100,7 @@
then show ?thesis using Lim_null by auto
qed
-text \<open>The next lemma asserts that, if a sequence of functions converges in $L^1$, then
+text \<open>The next lemma asserts that, if a sequence of functions converges in \<open>L\<^sup>1\<close>, then
it admits a subsequence that converges almost everywhere.\<close>
lemma%important tendsto_L1_AE_subseq:
--- a/src/HOL/Analysis/Borel_Space.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Borel_Space.thy Tue Jan 01 21:47:27 2019 +0100
@@ -2140,7 +2140,7 @@
shows "(\<lambda>x. \<bar>f x\<bar> powr p) \<in> borel_measurable M"
unfolding powr_def by auto
-text \<open>The next one is a variation around \verb+measurable_restrict_space+.\<close>
+text \<open>The next one is a variation around \<open>measurable_restrict_space\<close>.\<close>
lemma%unimportant measurable_restrict_space3:
assumes "f \<in> measurable M N" and
@@ -2152,7 +2152,7 @@
measurable_restrict_space2[of f, of "restrict_space M A", of B, of N] assms(2) space_restrict_space)
qed
-text \<open>The next one is a variation around \verb+measurable_piecewise_restrict+.\<close>
+text \<open>The next one is a variation around \<open>measurable_piecewise_restrict\<close>.\<close>
lemma%important measurable_piecewise_restrict2:
assumes [measurable]: "\<And>n. A n \<in> sets M"
--- a/src/HOL/Analysis/Brouwer_Fixpoint.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Brouwer_Fixpoint.thy Tue Jan 01 21:47:27 2019 +0100
@@ -407,8 +407,8 @@
retracts (ENR). We define AR and ANR by specializing the standard definitions for a set to embedding
in spaces of higher dimension.
-John Harrison writes: "This turns out to be sufficient (since any set in $\mathbb{R}^n$ can be
-embedded as a closed subset of a convex subset of $\mathbb{R}^{n+1}$) to derive the usual
+John Harrison writes: "This turns out to be sufficient (since any set in \<open>\<real>\<^sup>n\<close> can be
+embedded as a closed subset of a convex subset of \<open>\<real>\<^sup>n\<^sup>+\<^sup>1\<close>) to derive the usual
definitions, but we need to split them into two implications because of the lack of type
quantifiers. Then ENR turns out to be equivalent to ANR plus local compactness."\<close>
--- a/src/HOL/Analysis/Complete_Measure.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Complete_Measure.thy Tue Jan 01 21:47:27 2019 +0100
@@ -1085,7 +1085,7 @@
qed
text \<open>The following theorem is a specialization of D.H. Fremlin, Measure Theory vol 4I (413G). We
- only show one direction and do not use a inner regular family $K$.\<close>
+ only show one direction and do not use a inner regular family \<open>K\<close>.\<close>
lemma (in cld_measure) borel_measurable_cld:
fixes f :: "'a \<Rightarrow> real"
--- a/src/HOL/Analysis/Complex_Transcendental.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Complex_Transcendental.thy Tue Jan 01 21:47:27 2019 +0100
@@ -883,9 +883,9 @@
qed
text\<open>This function returns the angle of a complex number from its representation in polar coordinates.
-Due to periodicity, its range is arbitrary. @{term Arg2pi} follows HOL Light in adopting the interval $[0,2\pi)$.
+Due to periodicity, its range is arbitrary. @{term Arg2pi} follows HOL Light in adopting the interval \<open>[0,2\<pi>)\<close>.
But we have the same periodicity issue with logarithms, and it is usual to adopt the same interval
-for the complex logarithm and argument functions. Further on down, we shall define both functions for the interval $(-\pi,\pi]$.
+for the complex logarithm and argument functions. Further on down, we shall define both functions for the interval \<open>(-\<pi>,\<pi>]\<close>.
The present version is provided for compatibility.\<close>
lemma Arg2pi_0 [simp]: "Arg2pi(0) = 0"
@@ -1751,7 +1751,7 @@
subsection\<open>The Argument of a Complex Number\<close>
-text\<open>Finally: it's is defined for the same interval as the complex logarithm: $(-\pi,\pi]$.\<close>
+text\<open>Finally: it's is defined for the same interval as the complex logarithm: \<open>(-\<pi>,\<pi>]\<close>.\<close>
definition%important Arg :: "complex \<Rightarrow> real" where "Arg z \<equiv> (if z = 0 then 0 else Im (Ln z))"
--- a/src/HOL/Analysis/Embed_Measure.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Embed_Measure.thy Tue Jan 01 21:47:27 2019 +0100
@@ -14,7 +14,7 @@
text \<open>
Given a measure space on some carrier set \<open>\<Omega>\<close> and a function \<open>f\<close>, we can define a push-forward
- measure on the carrier set $f(\Omega)$ whose \<open>\<sigma>\<close>-algebra is the one generated by mapping \<open>f\<close> over
+ measure on the carrier set \<open>f(\<Omega>)\<close> whose \<open>\<sigma>\<close>-algebra is the one generated by mapping \<open>f\<close> over
the original sigma algebra.
This is useful e.\,g.\ when \<open>f\<close> is injective, i.\,e.\ it is some kind of ``tagging'' function.
--- a/src/HOL/Analysis/Extended_Real_Limits.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Extended_Real_Limits.thy Tue Jan 01 21:47:27 2019 +0100
@@ -396,11 +396,11 @@
subsubsection%important \<open>Continuity of addition\<close>
-text \<open>The next few lemmas remove an unnecessary assumption in \verb+tendsto_add_ereal+, culminating
-in \verb+tendsto_add_ereal_general+ which essentially says that the addition
-is continuous on ereal times ereal, except at $(-\infty, \infty)$ and $(\infty, -\infty)$.
+text \<open>The next few lemmas remove an unnecessary assumption in \<open>tendsto_add_ereal\<close>, culminating
+in \<open>tendsto_add_ereal_general\<close> which essentially says that the addition
+is continuous on ereal times ereal, except at \<open>(-\<infinity>, \<infinity>)\<close> and \<open>(\<infinity>, -\<infinity>)\<close>.
It is much more convenient in many situations, see for instance the proof of
-\verb+tendsto_sum_ereal+ below.\<close>
+\<open>tendsto_sum_ereal\<close> below.\<close>
lemma%important tendsto_add_ereal_PInf:
fixes y :: ereal
@@ -437,7 +437,7 @@
qed
text\<open>One would like to deduce the next lemma from the previous one, but the fact
-that $-(x+y)$ is in general different from $(-x) + (-y)$ in ereal creates difficulties,
+that \<open>- (x + y)\<close> is in general different from \<open>(- x) + (- y)\<close> in ereal creates difficulties,
so it is more efficient to copy the previous proof.\<close>
lemma%important tendsto_add_ereal_MInf:
@@ -503,8 +503,8 @@
ultimately show ?thesis by simp
qed
-text \<open>The next lemma says that the addition is continuous on ereal, except at
-the pairs $(-\infty, \infty)$ and $(\infty, -\infty)$.\<close>
+text \<open>The next lemma says that the addition is continuous on \<open>ereal\<close>, except at
+the pairs \<open>(-\<infinity>, \<infinity>)\<close> and \<open>(\<infinity>, -\<infinity>)\<close>.\<close>
lemma%important tendsto_add_ereal_general [tendsto_intros]:
fixes x y :: ereal
@@ -528,7 +528,7 @@
subsubsection%important \<open>Continuity of multiplication\<close>
text \<open>In the same way as for addition, we prove that the multiplication is continuous on
-ereal times ereal, except at $(\infty, 0)$ and $(-\infty, 0)$ and $(0, \infty)$ and $(0, -\infty)$,
+ereal times ereal, except at \<open>(\<infinity>, 0)\<close> and \<open>(-\<infinity>, 0)\<close> and \<open>(0, \<infinity>)\<close> and \<open>(0, -\<infinity>)\<close>,
starting with specific situations.\<close>
lemma%important tendsto_mult_real_ereal:
@@ -922,7 +922,7 @@
ultimately show ?thesis using MInf by auto
qed (simp add: assms)
-text \<open>the next one is copied from \verb+tendsto_sum+.\<close>
+text \<open>the next one is copied from \<open>tendsto_sum\<close>.\<close>
lemma tendsto_sum_ereal [tendsto_intros]:
fixes f :: "'a \<Rightarrow> 'b \<Rightarrow> ereal"
assumes "\<And>i. i \<in> S \<Longrightarrow> (f i \<longlongrightarrow> a i) F"
@@ -1476,8 +1476,8 @@
qed
text \<open>The following statement about limsups is reduced to a statement about limits using
-subsequences thanks to \verb+limsup_subseq_lim+. The statement for limits follows for instance from
-\verb+tendsto_add_ereal_general+.\<close>
+subsequences thanks to \<open>limsup_subseq_lim\<close>. The statement for limits follows for instance from
+\<open>tendsto_add_ereal_general\<close>.\<close>
lemma%important ereal_limsup_add_mono:
fixes u v::"nat \<Rightarrow> ereal"
@@ -1521,7 +1521,7 @@
then show ?thesis unfolding w_def by simp
qed
-text \<open>There is an asymmetry between liminfs and limsups in ereal, as $\infty + (-\infty) = \infty$.
+text \<open>There is an asymmetry between liminfs and limsups in \<open>ereal\<close>, as \<open>\<infinity> + (-\<infinity>) = \<infinity>\<close>.
This explains why there are more assumptions in the next lemma dealing with liminfs that in the
previous one about limsups.\<close>
--- a/src/HOL/Analysis/Function_Topology.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Function_Topology.thy Tue Jan 01 21:47:27 2019 +0100
@@ -17,14 +17,14 @@
to each factor is continuous.
To form a product of objects in Isabelle/HOL, all these objects should be subsets of a common type
-'a. The product is then @{term "Pi\<^sub>E I X"}, the set of elements from 'i to 'a such that the $i$-th
-coordinate belongs to $X\;i$ for all $i \in I$.
+'a. The product is then @{term "Pi\<^sub>E I X"}, the set of elements from \<open>'i\<close> to \<open>'a\<close> such that the \<open>i\<close>-th
+coordinate belongs to \<open>X i\<close> for all \<open>i \<in> I\<close>.
Hence, to form a product of topological spaces, all these spaces should be subsets of a common type.
This means that type classes can not be used to define such a product if one wants to take the
product of different topological spaces (as the type 'a can only be given one structure of
topological space using type classes). On the other hand, one can define different topologies (as
-introduced in \verb+thy+) on one type, and these topologies do not need to
+introduced in \<open>thy\<close>) on one type, and these topologies do not need to
share the same maximal open set. Hence, one can form a product of topologies in this sense, and
this works well. The big caveat is that it does not interact well with the main body of
topology in Isabelle/HOL defined in terms of type classes... For instance, continuity of maps
@@ -41,25 +41,24 @@
probably too naive here).
Here is an example of a reformulation using topologies. Let
-\begin{verbatim}
-continuous_on_topo T1 T2 f = ((\<forall> U. openin T2 U \<longrightarrow> openin T1 (f-`U \<inter> topspace(T1)))
- \<and> (f`(topspace T1) \<subseteq> (topspace T2)))
-\end{verbatim}
-be the natural continuity definition of a map from the topology $T1$ to the topology $T2$. Then
-the current \verb+continuous_on+ (with type classes) can be redefined as
-\begin{verbatim}
-continuous_on s f = continuous_on_topo (subtopology euclidean s) (topology euclidean) f
-\end{verbatim}
+@{text [display]
+\<open>continuous_on_topo T1 T2 f =
+ ((\<forall> U. openin T2 U \<longrightarrow> openin T1 (f-`U \<inter> topspace(T1)))
+ \<and> (f`(topspace T1) \<subseteq> (topspace T2)))\<close>}
+be the natural continuity definition of a map from the topology \<open>T1\<close> to the topology \<open>T2\<close>. Then
+the current \<open>continuous_on\<close> (with type classes) can be redefined as
+@{text [display] \<open>continuous_on s f =
+ continuous_on_topo (subtopology euclidean s) (topology euclidean) f\<close>}
-In fact, I need \verb+continuous_on_topo+ to express the continuity of the projection on subfactors
-for the product topology, in Lemma~\verb+continuous_on_restrict_product_topology+, and I show
-the above equivalence in Lemma~\verb+continuous_on_continuous_on_topo+.
+In fact, I need \<open>continuous_on_topo\<close> to express the continuity of the projection on subfactors
+for the product topology, in Lemma~\<open>continuous_on_restrict_product_topology\<close>, and I show
+the above equivalence in Lemma~\<open>continuous_on_continuous_on_topo\<close>.
I only develop the basics of the product topology in this theory. The most important missing piece
is Tychonov theorem, stating that a product of compact spaces is always compact for the product
topology, even when the product is not finite (or even countable).
-I realized afterwards that this theory has a lot in common with \verb+Fin_Map.thy+.
+I realized afterwards that this theory has a lot in common with \<^file>\<open>~~/src/HOL/Library/Finite_Map.thy\<close>.
\<close>
subsection%important \<open>Topology without type classes\<close>
@@ -67,15 +66,15 @@
subsubsection%important \<open>The topology generated by some (open) subsets\<close>
text \<open>In the definition below of a generated topology, the \<open>Empty\<close> case is not necessary,
-as it follows from \<open>UN\<close> taking for $K$ the empty set. However, it is convenient to have,
+as it follows from \<open>UN\<close> taking for \<open>K\<close> the empty set. However, it is convenient to have,
and is never a problem in proofs, so I prefer to write it down explicitly.
-We do not require UNIV to be an open set, as this will not be the case in applications. (We are
-thinking of a topology on a subset of UNIV, the remaining part of UNIV being irrelevant.)\<close>
+We do not require \<open>UNIV\<close> to be an open set, as this will not be the case in applications. (We are
+thinking of a topology on a subset of \<open>UNIV\<close>, the remaining part of \<open>UNIV\<close> being irrelevant.)\<close>
inductive generate_topology_on for S where
-Empty: "generate_topology_on S {}"
-|Int: "generate_topology_on S a \<Longrightarrow> generate_topology_on S b \<Longrightarrow> generate_topology_on S (a \<inter> b)"
+ Empty: "generate_topology_on S {}"
+| Int: "generate_topology_on S a \<Longrightarrow> generate_topology_on S b \<Longrightarrow> generate_topology_on S (a \<inter> b)"
| UN: "(\<And>k. k \<in> K \<Longrightarrow> generate_topology_on S k) \<Longrightarrow> generate_topology_on S (\<Union>K)"
| Basis: "s \<in> S \<Longrightarrow> generate_topology_on S s"
@@ -83,8 +82,8 @@
"istopology (generate_topology_on S)"
unfolding istopology_def by (auto intro: generate_topology_on.intros)
-text \<open>The basic property of the topology generated by a set $S$ is that it is the
-smallest topology containing all the elements of $S$:\<close>
+text \<open>The basic property of the topology generated by a set \<open>S\<close> is that it is the
+smallest topology containing all the elements of \<open>S\<close>:\<close>
lemma%unimportant generate_topology_on_coarsest:
assumes "istopology T"
@@ -344,8 +343,8 @@
we will need it to define the strong operator topology on the space of continuous linear operators,
by pulling back the product topology on the space of all functions.\<close>
-text \<open>\verb+pullback_topology A f T+ is the pullback of the topology $T$ by the map $f$ on
-the set $A$.\<close>
+text \<open>\<open>pullback_topology A f T\<close> is the pullback of the topology \<open>T\<close> by the map \<open>f\<close> on
+the set \<open>A\<close>.\<close>
definition%important pullback_topology::"('a set) \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> ('b topology) \<Rightarrow> ('a topology)"
where "pullback_topology A f T = topology (\<lambda>S. \<exists>U. openin T U \<and> S = f-`U \<inter> A)"
@@ -434,7 +433,7 @@
set along one single coordinate, and the whole space along other coordinates. In fact, this is only
equivalent for nonempty products, but for the empty product the first formulation is better
(the second one gives an empty product space, while an empty product should have exactly one
-point, equal to \verb+undefined+ along all coordinates.
+point, equal to \<open>undefined\<close> along all coordinates.
So, we use the first formulation, which moreover seems to give rise to more straightforward proofs.
\<close>
@@ -970,7 +969,7 @@
"\<And>x i. open (A x i)"
"\<And>x S. open S \<Longrightarrow> x \<in> S \<Longrightarrow> (\<exists>i. A x i \<subseteq> S)"
by metis
- text \<open>$B i$ is a countable basis of neighborhoods of $x_i$.\<close>
+ text \<open>\<open>B i\<close> is a countable basis of neighborhoods of \<open>x\<^sub>i\<close>.\<close>
define B where "B = (\<lambda>i. (A (x i))`UNIV \<union> {UNIV})"
have "countable (B i)" for i unfolding B_def by auto
@@ -1119,13 +1118,13 @@
subsection%important \<open>The strong operator topology on continuous linear operators\<close> (* FIX ME mv*)
-text \<open>Let 'a and 'b be two normed real vector spaces. Then the space of linear continuous
-operators from 'a to 'b has a canonical norm, and therefore a canonical corresponding topology
-(the type classes instantiation are given in \verb+Bounded_Linear_Function.thy+).
+text \<open>Let \<open>'a\<close> and \<open>'b\<close> be two normed real vector spaces. Then the space of linear continuous
+operators from \<open>'a\<close> to \<open>'b\<close> has a canonical norm, and therefore a canonical corresponding topology
+(the type classes instantiation are given in \<^file>\<open>Bounded_Linear_Function.thy\<close>).
-However, there is another topology on this space, the strong operator topology, where $T_n$ tends to
-$T$ iff, for all $x$ in 'a, then $T_n x$ tends to $T x$. This is precisely the product topology
-where the target space is endowed with the norm topology. It is especially useful when 'b is the set
+However, there is another topology on this space, the strong operator topology, where \<open>T\<^sub>n\<close> tends to
+\<open>T\<close> iff, for all \<open>x\<close> in \<open>'a\<close>, then \<open>T\<^sub>n x\<close> tends to \<open>T x\<close>. This is precisely the product topology
+where the target space is endowed with the norm topology. It is especially useful when \<open>'b\<close> is the set
of real numbers, since then this topology is compact.
We can not implement it using type classes as there is already a topology, but at least we
@@ -1202,12 +1201,12 @@
text \<open>In general, the product topology is not metrizable, unless the index set is countable.
When the index set is countable, essentially any (convergent) combination of the metrics on the
-factors will do. We use below the simplest one, based on $L^1$, but $L^2$ would also work,
+factors will do. We use below the simplest one, based on \<open>L\<^sup>1\<close>, but \<open>L\<^sup>2\<close> would also work,
for instance.
What is not completely trivial is that the distance thus defined induces the same topology
as the product topology. This is what we have to prove to show that we have an instance
-of \verb+metric_space+.
+of \<^class>\<open>metric_space\<close>.
The proofs below would work verbatim for general countable products of metric spaces. However,
since distances are only implemented in terms of type classes, we only develop the theory
@@ -1476,10 +1475,10 @@
by simp
next
text\<open>Finally, we show that the topology generated by the distance and the product
- topology coincide. This is essentially contained in Lemma \verb+fun_open_ball_aux+,
+ topology coincide. This is essentially contained in Lemma \<open>fun_open_ball_aux\<close>,
except that the condition to prove is expressed with filters. To deal with this,
- we copy some mumbo jumbo from Lemma \verb+eventually_uniformity_metric+ in
- \verb+Real_Vector_Spaces.thy+\<close>
+ we copy some mumbo jumbo from Lemma \<open>eventually_uniformity_metric\<close> in
+ \<^file>\<open>~~/src/HOL/Real_Vector_Spaces.thy\<close>\<close>
fix U::"('a \<Rightarrow> 'b) set"
have "eventually P uniformity \<longleftrightarrow> (\<exists>e>0. \<forall>x (y::('a \<Rightarrow> 'b)). dist x y < e \<longrightarrow> P (x, y))" for P
unfolding uniformity_fun_def apply (subst eventually_INF_base)
@@ -1581,7 +1580,7 @@
text \<open>There are two natural sigma-algebras on a product space: the borel sigma algebra,
generated by open sets in the product, and the product sigma algebra, countably generated by
products of measurable sets along finitely many coordinates. The second one is defined and studied
-in \verb+Finite_Product_Measure.thy+.
+in \<^file>\<open>Finite_Product_Measure.thy\<close>.
These sigma-algebra share a lot of natural properties (measurability of coordinates, for instance),
but there is a fundamental difference: open sets are generated by arbitrary unions, not only
--- a/src/HOL/Analysis/Further_Topology.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Further_Topology.thy Tue Jan 01 21:47:27 2019 +0100
@@ -4188,7 +4188,7 @@
subsection%important\<open>The "Borsukian" property of sets\<close>
-text\<open>This doesn't have a standard name. Kuratowski uses ``contractible with respect to $[S^1]$''
+text\<open>This doesn't have a standard name. Kuratowski uses ``contractible with respect to \<open>[S\<^sup>1]\<close>''
while Whyburn uses ``property b''. It's closely related to unicoherence.\<close>
definition%important Borsukian where
--- a/src/HOL/Analysis/Gamma_Function.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Gamma_Function.thy Tue Jan 01 21:47:27 2019 +0100
@@ -1799,10 +1799,10 @@
text \<open>
The following is a proof of the Bohr--Mollerup theorem, which states that
- any log-convex function $G$ on the positive reals that fulfils $G(1) = 1$ and
- satisfies the functional equation $G(x+1) = x G(x)$ must be equal to the
+ any log-convex function \<open>G\<close> on the positive reals that fulfils \<open>G(1) = 1\<close> and
+ satisfies the functional equation \<open>G(x + 1) = x G(x)\<close> must be equal to the
Gamma function.
- In principle, if $G$ is a holomorphic complex function, one could then extend
+ In principle, if \<open>G\<close> is a holomorphic complex function, one could then extend
this from the positive reals to the entire complex plane (minus the non-positive
integers, where the Gamma function is not defined).
\<close>
--- a/src/HOL/Analysis/Lipschitz.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Lipschitz.thy Tue Jan 01 21:47:27 2019 +0100
@@ -423,9 +423,9 @@
text \<open>We deduce that if a function is Lipschitz on finitely many closed sets on the real line, then
it is Lipschitz on any interval contained in their union. The difficulty in the proof is to show
-that any point $z$ in this interval (except the maximum) has a point arbitrarily close to it on its
+that any point \<open>z\<close> in this interval (except the maximum) has a point arbitrarily close to it on its
right which is contained in a common initial closed set. Otherwise, we show that there is a small
-interval $(z, T)$ which does not intersect any of the initial closed sets, a contradiction.\<close>
+interval \<open>(z, T)\<close> which does not intersect any of the initial closed sets, a contradiction.\<close>
proposition lipschitz_on_closed_Union:
assumes "\<And>i. i \<in> I \<Longrightarrow> lipschitz_on M (U i) f"
--- a/src/HOL/Analysis/Measure_Space.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Measure_Space.thy Tue Jan 01 21:47:27 2019 +0100
@@ -1093,7 +1093,7 @@
qed
text \<open>The next lemma is convenient to combine with a lemma whose conclusion is of the
-form \<open>AE x in M. P x = Q x\<close>: for such a lemma, there is no \verb+[symmetric]+ variant,
+form \<open>AE x in M. P x = Q x\<close>: for such a lemma, there is no \<open>[symmetric]\<close> variant,
but using \<open>AE_symmetric[OF...]\<close> will replace it.\<close>
(* depricated replace by laws about eventually *)
@@ -3522,7 +3522,7 @@
qed
qed
-subsubsection%unimportant \<open>Supremum of a set of $\sigma$-algebras\<close>
+subsubsection%unimportant \<open>Supremum of a set of \<open>\<sigma>\<close>-algebras\<close>
lemma space_Sup_eq_UN: "space (Sup M) = (\<Union>x\<in>M. space x)"
unfolding Sup_measure_def
--- a/src/HOL/Analysis/Path_Connected.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Path_Connected.thy Tue Jan 01 21:47:27 2019 +0100
@@ -3401,9 +3401,9 @@
(\<forall>x. h(1, x) = q x) \<and>
(\<forall>t \<in> {0..1}. P(\<lambda>x. h(t, x))))"
-text\<open>$p, q$ are functions $X \to Y$, and the property $P$ restricts all intermediate maps.
-We often just want to require that $P$ fixes some subset, but to include the case of a loop homotopy,
-it is convenient to have a general property $P$.\<close>
+text\<open>\<open>p\<close>, \<open>q\<close> are functions \<open>X \<rightarrow> Y\<close>, and the property \<open>P\<close> restricts all intermediate maps.
+We often just want to require that \<open>P\<close> fixes some subset, but to include the case of a loop homotopy,
+it is convenient to have a general property \<open>P\<close>.\<close>
text \<open>We often want to just localize the ending function equality or whatever.\<close>
text%important \<open>%whitespace\<close>
--- a/src/HOL/Analysis/Set_Integral.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Set_Integral.thy Tue Jan 01 21:47:27 2019 +0100
@@ -817,7 +817,7 @@
then show ?thesis using * by auto
qed
-text \<open>The next lemma shows that $L^1$ convergence of a sequence of functions follows from almost
+text \<open>The next lemma shows that \<open>L\<^sup>1\<close> convergence of a sequence of functions follows from almost
everywhere convergence and the weaker condition of the convergence of the integrated norms (or even
just the nontrivial inequality about them). Useful in a lot of contexts! This statement (or its
variations) are known as Scheffe lemma.
--- a/src/HOL/Analysis/Sigma_Algebra.thy Tue Jan 01 20:57:54 2019 +0100
+++ b/src/HOL/Analysis/Sigma_Algebra.thy Tue Jan 01 21:47:27 2019 +0100
@@ -1431,7 +1431,7 @@
subsubsection \<open>Induction rule for intersection-stable generators\<close>
-text%important \<open>The reason to introduce Dynkin-systems is the following induction rules for $\sigma$-algebras
+text%important \<open>The reason to introduce Dynkin-systems is the following induction rules for \<open>\<sigma>\<close>-algebras
generated by a generator closed under intersection.\<close>
proposition sigma_sets_induct_disjoint[consumes 3, case_names basic empty compl union]:
@@ -2022,7 +2022,7 @@
using emeasure_extend_measure[OF M _ _ ms(2,3), of "(i,j)"] eq ms(1) \<open>I i j\<close>
by (auto simp: subset_eq)
-subsection \<open>The smallest $\sigma$-algebra regarding a function\<close>
+subsection \<open>The smallest \<open>\<sigma>\<close>-algebra regarding a function\<close>
definition%important vimage_algebra :: "'a set \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'b measure \<Rightarrow> 'a measure" where
"vimage_algebra X f M = sigma X {f -` A \<inter> X | A. A \<in> sets M}"