Skip to content
This repository was archived by the owner on Jul 24, 2024. It is now read-only.

Commit 0a0ec35

Browse files
author
github-actions[bot]
committed
chore(*): add mathlib4 synchronization comments (#18387)
Regenerated from the [port status wiki page](https://github.com/leanprover-community/mathlib/wiki/mathlib4-port-status). Relates to the following files: * `combinatorics.colex` * `combinatorics.set_family.harris_kleitman` * `data.finset.pimage` * `data.fintype.perm` * `data.holor` * `dynamics.minimal` * `order.filter.partial` * `order.partition.equipartition` * `order.partition.finpartition` * `topology.extend_from` * `topology.order.basic` * `topology.paracompact` * `topology.shrinking_lemma` * `topology.uniform_space.absolute_value` * `topology.uniform_space.complete_separated` * `topology.uniform_space.pi` * `topology.uniform_space.uniform_convergence` * `topology.uniform_space.uniform_embedding`
1 parent cc8e88c commit 0a0ec35

18 files changed

Lines changed: 54 additions & 0 deletions

src/combinatorics/colex.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@ import algebra.geom_sum
99
/-!
1010
# Colex
1111
12+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
13+
> Any changes to this file require a corresponding PR to mathlib4.
14+
1215
We define the colex ordering for finite sets, and give a couple of important
1316
lemmas and properties relating to it.
1417

src/combinatorics/set_family/harris_kleitman.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -10,6 +10,9 @@ import data.fintype.big_operators
1010
/-!
1111
# Harris-Kleitman inequality
1212
13+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
14+
> Any changes to this file require a corresponding PR to mathlib4.
15+
1316
This file proves the Harris-Kleitman inequality. This relates `𝒜.card * ℬ.card` and
1417
`2 ^ card α * (𝒜 ∩ ℬ).card` where `𝒜` and `ℬ` are upward- or downcard-closed finite families of
1518
finsets. This can be interpreted as saying that any two lower sets (resp. any two upper sets)

src/data/finset/pimage.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@ import data.pfun
99
/-!
1010
# Image of a `finset α` under a partially defined function
1111
12+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
13+
> Any changes to this file require a corresponding PR to mathlib4.
14+
1215
In this file we define `part.to_finset` and `finset.pimage`. We also prove some trivial lemmas about
1316
these definitions.
1417

src/data/fintype/perm.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@ import group_theory.perm.basic
99
/-!
1010
# fintype instances for `equiv` and `perm`
1111
12+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
13+
> Any changes to this file require a corresponding PR to mathlib4.
14+
1215
Main declarations:
1316
* `perms_of_finset s`: The finset of permutations of the finset `s`.
1417

src/data/holor.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@ import algebra.big_operators.basic
99
/-!
1010
# Basic properties of holors
1111
12+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
13+
> Any changes to this file require a corresponding PR to mathlib4.
14+
1215
Holors are indexed collections of tensor coefficients. Confusingly,
1316
they are often called tensors in physics and in the neural network
1417
community.

src/dynamics/minimal.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@ import topology.algebra.const_mul_action
99
/-!
1010
# Minimal action of a group
1111
12+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
13+
> Any changes to this file require a corresponding PR to mathlib4.
14+
1215
In this file we define an action of a monoid `M` on a topological space `α` to be *minimal* if the
1316
`M`-orbit of every point `x : α` is dense. We also provide an additive version of this definition
1417
and prove some basic facts about minimal actions.

src/order/filter/partial.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@ import data.pfun
99
/-!
1010
# `tendsto` for relations and partial functions
1111
12+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
13+
> Any changes to this file require a corresponding PR to mathlib4.
14+
1215
This file generalizes `filter` definitions from functions to partial functions and relations.
1316
1417
## Considering functions and partial functions as relations

src/order/partition/equipartition.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@ import order.partition.finpartition
99
/-!
1010
# Finite equipartitions
1111
12+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
13+
> Any changes to this file require a corresponding PR to mathlib4.
14+
1215
This file defines finite equipartitions, the partitions whose parts all are the same size up to a
1316
difference of `1`.
1417

src/order/partition/finpartition.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -10,6 +10,9 @@ import order.sup_indep
1010
/-!
1111
# Finite partitions
1212
13+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
14+
> Any changes to this file require a corresponding PR to mathlib4.
15+
1316
In this file, we define finite partitions. A finpartition of `a : α` is a finite set of pairwise
1417
disjoint parts `parts : finset α` which does not contain `⊥` and whose supremum is `a`.
1518

src/topology/extend_from.lean

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,9 @@ import topology.separation
88
/-!
99
# Extending a function from a subset
1010
11+
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
12+
> Any changes to this file require a corresponding PR to mathlib4.
13+
1114
The main definition of this file is `extend_from A f` where `f : X → Y`
1215
and `A : set X`. This defines a new function `g : X → Y` which maps any
1316
`x₀ : X` to the limit of `f` as `x` tends to `x₀`, if such a limit exists.

0 commit comments

Comments
 (0)