blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 7 139 | content_id stringlengths 40 40 | detected_licenses listlengths 0 16 | license_type stringclasses 2
values | repo_name stringlengths 7 55 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 6
values | visit_date int64 1,471B 1,694B | revision_date int64 1,378B 1,694B | committer_date int64 1,378B 1,694B | github_id float64 1.33M 604M ⌀ | star_events_count int64 0 43.5k | fork_events_count int64 0 1.5k | gha_license_id stringclasses 6
values | gha_event_created_at int64 1,402B 1,695B ⌀ | gha_created_at int64 1,359B 1,637B ⌀ | gha_language stringclasses 19
values | src_encoding stringclasses 2
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 1
class | length_bytes int64 3 6.4M | extension stringclasses 4
values | content stringlengths 3 6.12M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4d0412959bde51cfb0ca64025ca956a8e441f103 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/list/nodup_auto.lean | 1e48bda78ce156f38acf69dad2a0c14d8c448a47 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,717 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.list.pairwise
import Mathlib.data.list.forall2
import Mathlib.PostPort
uni... |
f3065bd239a9cf333f48f810f93d3290cb69f9c9 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/category_theory/monoidal/internal/types.lean | 40e3dde9e6f17cc39679aaac6a1b145c9f73d487 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 2,448 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import algebra.category.Mon.basic
import category_theory.monoidal.internal
import category_theory.monoidal.types
/-!
# `Mon_ (Type u) ≌ Mon.{u}`
The category of int... |
3145e0caa6f8b0eb9ecfe3359a44bd8dde818d05 | cf39355caa609c0f33405126beee2739aa3cb77e | /tmp/micro_lenses.lean | 76458e9361c7310eaff08812782d0134588d485f | [
"Apache-2.0"
] | permissive | leanprover-community/lean | 12b87f69d92e614daea8bcc9d4de9a9ace089d0e | cce7990ea86a78bdb383e38ed7f9b5ba93c60ce0 | refs/heads/master | 1,687,508,156,644 | 1,684,951,104,000 | 1,684,951,104,000 | 169,960,991 | 457 | 107 | Apache-2.0 | 1,686,744,372,000 | 1,549,790,268,000 | C++ | UTF-8 | Lean | false | false | 3,417 | lean | universes u v w
structure lens (α : Type u) (β : Type v) :=
(get : α → β)
(modify : α → (β → β) → α)
(set : α → β → α := λ a b, modify a (λ _, b))
def lens.compose {α : Type u} {β : Type v} {σ : Type w} (t : lens β σ) (s : lens α β) : lens α σ :=
{ get := t^.get ∘ s^.get,
modify := λ a f, s^.modify a $ λ b... |
f091c9ea331a0e42ff89256e7e7f430904fc3a63 | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/real_measurable_space.lean | 582710f3ef16c51b81cd8083c5257f48d2f875cc | [
"Apache-2.0"
] | permissive | eric-wieser/formal-ml | e278df5a8df78aa3947bc8376650419e1b2b0a14 | 630011d19fdd9539c8d6493a69fe70af5d193590 | refs/heads/master | 1,681,491,589,256 | 1,612,642,743,000 | 1,612,642,743,000 | 360,114,136 | 0 | 0 | Apache-2.0 | 1,618,998,189,000 | 1,618,998,188,000 | null | UTF-8 | Lean | false | false | 27,653 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
86a54e9e91110f90dd151aef99ff542ed9f43d03 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/dynamics/fixed_points/basic_auto.lean | 9efbf1b3df0be2de0228785ce696e4044d5bba12 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,837 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.set.function
import Mathlib.logic.function.iterate
import Mathlib.PostPort
universe... |
858c12d1ba9b708c5c22852f6ba6214a10456251 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/zmod/basic.lean | fb7dd8c76d543feb4a4103c67a0fa4d332e1c967 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 33,948 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.char_p.basic
import tactic.fin_cases
/-!
# Integers mod `n`
Definition of the integers mod n, and the field structure on the integers mod p.
## Defini... |
eb2b1d97cd675957f3d943a18ea3458225beb805 | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/algebra/opposites.lean | 9948bcb52b08681e136bd5a62f26e8e8d4b9255d | [
"Apache-2.0"
] | permissive | ayush1801/mathlib | 78949b9f789f488148142221606bf15c02b960d2 | ce164e28f262acbb3de6281b3b03660a9f744e3c | refs/heads/master | 1,692,886,907,941 | 1,635,270,866,000 | 1,635,270,866,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,685 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import data.opposite
import algebra.field
import algebra.group.commute
import group_theory.group_action.defs
import data.equiv.mul_add
/-!
# Algebraic operations on `αᵒᵖ`
Thi... |
add6de4c98612fa329c0224eb4735eb9cbbc2f46 | da23b545e1653cafd4ab88b3a42b9115a0b1355f | /src/tidy/rewrite_search/tracer/unit.lean | 6ca960de5bd8b6a4a5115bcd36ef9943f4ffe48e | [] | no_license | minchaowu/lean-tidy | 137f5058896e0e81dae84bf8d02b74101d21677a | 2d4c52d66cf07c59f8746e405ba861b4fa0e3835 | refs/heads/master | 1,585,283,406,120 | 1,535,094,033,000 | 1,535,094,033,000 | 145,945,792 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,144 | lean | import tidy.rewrite_search.engine
open tidy.rewrite_search
namespace tidy.rewrite_search.tracer.unit
open tactic
meta def unit_tracer_init : tactic (init_result unit) := return (init_result.success ())
meta def unit_tracer_publish_vertex (_ : unit) (_ : vertex) : tactic unit := skip
meta def unit_tracer_publish_edg... |
eb0d4ca0f5bc7e1b7ffd82386f55abac1c7e1d3b | 8eeb99d0fdf8125f5d39a0ce8631653f588ee817 | /src/topology/uniform_space/completion.lean | aabb3aa79348c30ca78cd13c8aec75ea85afea4d | [
"Apache-2.0"
] | permissive | jesse-michael-han/mathlib | a15c58378846011b003669354cbab7062b893cfe | fa6312e4dc971985e6b7708d99a5bc3062485c89 | refs/heads/master | 1,625,200,760,912 | 1,602,081,753,000 | 1,602,081,753,000 | 181,787,230 | 0 | 0 | null | 1,555,460,682,000 | 1,555,460,682,000 | null | UTF-8 | Lean | false | false | 23,312 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.uniform_space.abstract_completion
/-!
# Hausdorff completions of uniform spaces
The goal is to construct a left-adjoint to the inclu... |
54a504c9004d32b5bc861605e2f7ef2f3c0dd202 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/real/irrational_auto.lean | 5561a4b88068cd69cd38e1a0cf73abd5923ef778 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,394 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Yury Kudryashov.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.real.sqrt
import Mat... |
41806ee92886145ca24a154d23989a552e845dee | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/simp_trace.lean | b763b97017f3dac27a347d12c2ce30a2a0a604e7 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 2,011 | lean | set_option tactic.simp.trace true
set_option trace.Meta.Tactic.simp.rewrite true
def f (x : α) := x
example (a : α) (b : List α) : f (a::b = []) = False :=
by simp [f]
def length : List α → Nat
| [] => 0
| a::as => length as + 1
example (a b c : α) (as : List α) : length (a :: b :: as) > length as := by
... |
d0a5683847d7be813c72c54bf31c7e63691c77a6 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/data/int/basic.lean | 187da287cfc0c3b7f5389d2e961d83f7f1d9ceb1 | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 55,390 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import algebra.order_functions
import data.nat.pow
/-!
# Basic operations on the integers
This file contains:
* instances on `ℤ`. The stronger one is `int.linear_orde... |
bbbe12b10bfc690ff0bc33880f656b3946370e7f | b1e80085f6d9158c0b431ffc4fa9d0d53cbac8e4 | /src/quiver.lean | 8bb268b904e14a6447dcad1f04343ef73d05a1bc | [] | no_license | dwarn/nielsen-schreier-2 | d73c20e4d2a8ae537fe4f8063272d0b72c58276a | e51a8c6511d374dc584698c7fa236a5be47e7dbe | refs/heads/master | 1,679,911,740,113 | 1,615,656,058,000 | 1,615,656,058,000 | 344,111,212 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,091 | lean | import category_theory.single_obj
misc
open category_theory
universes v u
def quiver (G : Type u) := G → G → Type v
def valu {G} (p : quiver G) (X) :=
Π {a b}, p a b → X
def subquiver {G} (p : quiver G) :=
Π a b : G, set (p a b)
def quiver_of_sub {G} {q : quiver G} (p : subquiver q) : quiver G :=
λ a b, { ... |
b5af13cbb85eee11998618a4a6e25a61c70dbf03 | b6f0d4562078d09b2d51c6aa5216cf0e07e8090f | /LeanRanges/FinRange.lean | fe5751fb49e77aaf2b7f3f6a68564df03c56a2e1 | [
"Apache-2.0"
] | permissive | pnwamk/lean4-ranges | 206a46e0ded663f546927f598549efacc36492f2 | 6c6a7e21edc1c2ad319749b75a222d77b1340f7d | refs/heads/master | 1,680,233,414,507 | 1,617,384,186,000 | 1,617,384,186,000 | 349,486,531 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,559 | lean | import LeanRanges.ToRange
structure FinRange (n : Nat) where
start : Nat
stop : Nat
step : Nat
ascending : Bool
instance : ToRange (Fin n) (FinRange n) where
toRange start stop step := ⟨start, stop, step.natAbs, step >= 0⟩
toRangeEq start stop step := ⟨start, stop+1, step.natAbs, step >= 0⟩
-- Lem... |
116406215e7ac217004ef32a3559833aa2b3c746 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/analysis/analytic/composition.lean | 49f6754c92942aeec5bf1f0fccdcde7d86dd5a02 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 56,734 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Johan Commelin
-/
import analysis.analytic.basic
import combinatorics.composition
/-!
# Composition of analytic functions
in this file we prove that the composi... |
31959be51913dfa04d61034c04eac5458d559db3 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/submonoid/center.lean | c41a592df9157009d7f063d71febaaa302aab2d8 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 2,526 | lean | /-
Copyright (c) 2021 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import group_theory.submonoid.operations
import group_theory.subsemigroup.center
/-!
# Centers of monoids
## Main definitions
* `submonoid.center`: the center of a monoi... |
cff9f92dcc1e759acf42ce463dd6e856823ab5d6 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/algebra/euclidean_domain.lean | 6247db4be0f3ac873f6afc7c249c6cb683b7dc7f | [
"Apache-2.0"
] | permissive | waynemunro/mathlib | e3fd4ff49f4cb43d4a8ded59d17be407bc5ee552 | 065a70810b5480d584033f7bbf8e0409480c2118 | refs/heads/master | 1,693,417,182,397 | 1,634,644,781,000 | 1,634,644,781,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,123 | lean | /-
Copyright (c) 2018 Louis Carlin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Louis Carlin, Mario Carneiro
-/
import data.int.basic
import algebra.field
/-!
# Euclidean domains
This file introduces Euclidean domains and provides the extended Euclidean algorithm... |
76019b15d43a86a36cbfb0a8e5b2df6e196e9287 | 367134ba5a65885e863bdc4507601606690974c1 | /src/linear_algebra/projection.lean | 7ee6d0117157e25a70cbad6451fc323d557386b3 | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 12,966 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury Kudryashov
-/
import linear_algebra.basic
import linear_algebra.prod
/-!
# Projection to a subspace
In this file we define
* `linear_proj_of_is_compl (p q : submodule R E) (h : ... |
66684b2ec78b976864fb7e6706a3579bfb5f38b2 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch6/ex0305.lean | 371863fa527455812ca4939077efede0ad1098ac | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24 | lean | open nat (succ add sub)
|
5d3a38c26a2cea78387f7d5166ad65c1bdf700d1 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/init/data/set.lean | e0a352b094be6877b477e2ff6851fecc52dd932c | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 2,292 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.interactive
import init.control.lawful
universes u v
def set (α : Type u) := α → Prop
def set_of {α : Type u} (p : α → Prop) : se... |
ea9aa49c6b3b25a6c543ad3630c71b83775b404a | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/graphs/default.lean | 6e01b34f6907c52b1461ef2c52c71d1e577665d5 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 2,689 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Stephen Morgan and Scott Morrison
import category_theory.tactics.obviously
import tidy.auto_cast
namespace category_theory.graphs
universes u₁ u₂
class graph (vertices : Type... |
a686d8eb5b9553779fa6fefdbd1d3538b4d3fa4c | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/category_theory/natural_isomorphism.lean | 210660ea453dcbeb8608f7b74d87eef80d896178 | [
"Apache-2.0"
] | permissive | eric-wieser/mathlib | 42842584f584359bbe1fc8b88b3ff937c8acd72d | d0df6b81cd0920ad569158c06a3fd5abb9e63301 | refs/heads/master | 1,669,546,404,255 | 1,595,254,668,000 | 1,595,254,668,000 | 281,173,504 | 0 | 0 | Apache-2.0 | 1,595,263,582,000 | 1,595,263,581,000 | null | UTF-8 | Lean | false | false | 4,661 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tim Baumann, Stephen Morgan, Scott Morrison, Floris van Doorn
-/
import category_theory.functor_category
import category_theory.isomorphism
open category_theory
-- declare the `v`'s ... |
4ae83269e61bbb991899a3d6d6f2c3840bc0f60b | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/tactic/localized.lean | c753b7210a5fc2753c3904d5e56a35597905f963 | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,550 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import tactic.core
/-!
# Localized notation
This consists of two user-commands which allow you to declare notation and commands localized to a
locale.
See the ... |
a3403772c27a91cbaa562e89c98be6f1bba34ba8 | 737dc4b96c97368cb66b925eeea3ab633ec3d702 | /tests/leanpkg/user_ext/UserExt/Tst1.lean | df3f4ff5ce58d8adccef994df576a1cc6b56a233 | [
"Apache-2.0"
] | permissive | Bioye97/lean4 | 1ace34638efd9913dc5991443777b01a08983289 | bc3900cbb9adda83eed7e6affeaade7cfd07716d | refs/heads/master | 1,690,589,820,211 | 1,631,051,000,000 | 1,631,067,598,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 121 | lean | import UserExt.FooExt
import UserExt.BlaExt
insert_foo hello
insert_foo world
show_foo_set
insert_bla abc
show_bla_set
|
3a8cca2442d951e9c18bf361896c82e6ab93b2f1 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/fintype/card.lean | 3f493c3334d52f00820f6fffe60da48d4d5a421d | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 6,536 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
import data.fintype.basic algebra.big_operators data.nat.choose tactic.ring
/-!
Results about "big operations" over a `fintype`, and consequent
results about cardina... |
9e8bfc41a4f5f3ae644f196e8f7530bbd035af7c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/combinatorics/composition.lean | f3935977c485306223cbba6431ac484c58f96203 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,263 | lean | /-
Copyright (c) 2020 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.fintype.card
import Mathlib.data.finset.sort
import Mathlib.tactic.omega.default... |
195558eda4e3a8df3d4e838ce8416bcc0bb98060 | 6cc23d886ccf271bfd0c9ca5d29cafb9c0be7bf5 | /src/Blake3.lean | b83904537e0426ede7753589708d671ba0afc9d9 | [] | no_license | Anderssorby/LeanPlay | d39b15dbc3441c2be5a4ea5adf8fe70c4648737b | 8fd63d98d02490060323f4c5117b9a7e8da50813 | refs/heads/main | 1,692,004,930,931 | 1,633,974,729,000 | 1,633,974,729,000 | 368,654,414 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,570 | lean | /-
Bindings to the Blake3 hashing library.
-/
namespace Blake3
constant BLAKE3_KEY_LEN: UInt16 := 32
constant BLAKE3_OUT_LEN: UInt16 := 32
constant BLAKE3_BLOCK_LEN: UInt16 := 64
constant BLAKE3_CHUNK_LEN: UInt16 := 1024
constant BLAKE3_MAX_DEPTH: UInt16 := 54
@[extern "blake3_hasher"]
constant Blake3Hasher : Type ... |
e7b3829e34128d31c48eb698b54225912af26088 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/linear_algebra/tensor_product.lean | 6811aaf0165d51b7201962b7c9048b47b6920ccc | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 17,631 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro
Tensor product of modules over commutative rings.
-/
import group_theory.free_abelian_group
import linear_algebra.direct_sum_module
variables {R : Type*} [comm... |
02878a21a0e92d214210b1c0383b72bb139b3aa5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/examples/deps/foo/Foo/Foo.lean | 060b281a849c182b41e8941da1fcd81219cb0c62 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 39 | lean | def foo := "foo"
--#eval IO.sleep 3000
|
6541af8ef14f189e71f344dc5cc7824bd5f8a85c | c777c32c8e484e195053731103c5e52af26a25d1 | /src/algebra/hom/equiv/basic.lean | 423615c762cc7b23e077ac570fe99019e7b35f3f | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 22,257 | lean | /-
Copyright (c) 2018 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Callum Sutton, Yury Kudryashov
-/
import algebra.hom.group
import data.fun_like.equiv
import logic.equiv.basic
import data.pi.algebra
/-!
# Multiplicative and additive... |
b262dfc0f35770a44d2cf76b33b7731e1abfc891 | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch3/ex0207.lean | 906d593b0220bb5a871b8e3f755506608d85e4f3 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 106 | lean | constants p q : Prop
theorem t1 (hp : p) (hq : q) : p := hp
axiom hp : p
theorem t2 : q → p := t1 hp
|
fb3d363d9821f6035c4383ad0cc12e5308582911 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/data/int/order.lean | 81052110d7a44a586584b2ec5383e9205c01a6a1 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 17,656 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Jeremy Avigad
The order relation on the integers. We show that int is an instance of linear_comm_ordered_ring
and transfer the results.
-/
import .basic algebra.or... |
b5031423f792ec565874655ba642611962460512 | 36938939954e91f23dec66a02728db08a7acfcf9 | /old-lean4/rbnode.lean | f40aaf1319e2a0ac7988e6fe06844f2b2dff6f50 | [] | no_license | pnwamk/reopt-vcg | f8b56dd0279392a5e1c6aee721be8138e6b558d3 | c9f9f185fbefc25c36c4b506bbc85fd1a03c3b6d | refs/heads/master | 1,631,145,017,772 | 1,593,549,019,000 | 1,593,549,143,000 | 254,191,418 | 0 | 0 | null | 1,586,377,077,000 | 1,586,377,077,000 | null | UTF-8 | Lean | false | false | 581 | lean | namespace RBNode
variable {α : Type _}
variable {β : Type _}
variable (lt : α → α → Bool)
def ofList' : RBNode α (λ_, β) → List (α × β) → RBNode α (λ_, β)
| l [] := l
| l ((k,v) :: r) := ofList' (l.insert lt k v) r
def ofList (l:List (α × β)) : RBNode α (λ_, β) := ofList' lt leaf l
section
variable {A:Type _}
vari... |
d36ab8be7ffa418c0fd2dc7a733d889c75a17b42 | 54c9ed381c63410c9b6af3b0a1722c41152f037f | /Binport.lean | 80f4054f70aba68e10006b47a25729314301ea9a | [
"Apache-2.0"
] | permissive | dselsam/binport | 0233f1aa961a77c4fc96f0dccc780d958c5efc6c | aef374df0e169e2c3f1dc911de240c076315805c | refs/heads/master | 1,687,453,448,108 | 1,627,483,296,000 | 1,627,483,296,000 | 333,825,622 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,189 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Binport.Run
import Binport.Path
import Lean
open Lean
open Lean.Meta
open Binport
unsafe def main (args : List String) : IO Unit := do
match args wi... |
285c901ab3e79ecd63a2be902583c16e68d7b082 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/notation7.lean | 9792c8c3c803b86f59101944f791ed13ba608876 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 220 | lean | import logic data.num
open num
constant f : num → num
constant g : num → num → num
notation A `:+1`:100000 := f A
check g 0:+1:+1 (1:+1 + 2:+1):+1
set_option pp.notation false
check g 0:+1:+1 (1:+1 + 2:+1):+1
|
2d067edc0cb88f4124c7b20fb7ca627c90e885c9 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /group_theory/coset.lean | 39d82b3ce78aae9cea7f6acde95424948f4342ce | [
"Apache-2.0"
] | permissive | kckennylau/mathlib | 21fb810b701b10d6606d9002a4004f7672262e83 | 47b3477e20ffb5a06588dd3abb01fe0fe3205646 | refs/heads/master | 1,634,976,409,281 | 1,542,042,832,000 | 1,542,319,733,000 | 109,560,458 | 0 | 0 | Apache-2.0 | 1,542,369,208,000 | 1,509,867,494,000 | Lean | UTF-8 | Lean | false | false | 10,462 | lean | /-
Copyright (c) 2018 Mitchell Rowett. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mitchell Rowett, Scott Morrison
-/
import group_theory.subgroup data.equiv.basic data.quot
open set function
variable {α : Type*}
@[to_additive left_add_coset]
def left_coset [has_m... |
39727bd33ba9d777094e53b84a8954d604334e3e | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/integral/riesz_markov_kakutani.lean | 24aeedef3703a7b36fb182fcf31b971dafe5b5a3 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 5,035 | lean | /-
Copyright (c) 2022 Jesse Reimann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jesse Reimann, Kalle Kytölä
-/
import topology.continuous_function.bounded
import topology.sets.compacts
/-!
# Riesz–Markov–Kakutani representation theorem
This file will prove diffe... |
8719abdd12d381d453a3270d0d99c08e89c6ad6c | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/dynamics/omega_limit_auto.lean | 207980ccb136c084726cff987fb50cb08e5f753d | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,428 | lean | /-
Copyright (c) 2020 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.dynamics.flow
import Mathlib.PostPort
universes u_1 u_2 u_3 u_4 u_5
namespace Mathlib
/-!
# ω-limits
... |
b6b9a522a441f5798b15b7c035961e4fdcb7078d | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/pkg/user_attr_app/lakefile.lean | 0196ebab36623b6e0c073bcab27c546019c3f90f | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 160 | lean | import Lake
open System Lake DSL
package user_attr
lean_lib UserAttr
@[default_target]
lean_exe user_attr where
root := `Main
supportInterpreter := true
|
68bb56c9c508ed08229c661b9252e4f9eb84b50b | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/namelit.lean | f6ecef7e407f00720eb3f5bec42c01f43f3e40fa | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 258 | lean |
#check `foo
#check `foo.bla
#check `«foo bla»
#check `«foo bla».«hello world»
#check `«foo bla».boo.«hello world»
#check `foo.«hello»
macro dummy1 : term => `(`hello)
macro dummy2 : term => `(`hello.«world !!!»)
#check dummy1
#check dummy2
|
3c115232fc1bfc8dd34c50473765a98a3b0c1866 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/euclidean_domain.lean | a4709703046c1b03addc8d816e2512dc361a7df0 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 18,650 | lean | /-
Copyright (c) 2018 Louis Carlin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Louis Carlin, Mario Carneiro
-/
import data.int.basic
import algebra.field.basic
/-!
# Euclidean domains
This file introduces Euclidean domains and provides the extended Euclidean alg... |
76fd328da4937aaca04b75958eed18d2360fb5c3 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/category_theory/generator.lean | e398a80921da10eeeff500f8a488924e6c24a3ff | [
"Apache-2.0"
] | permissive | ramonfmir/mathlib | c5dc8b33155473fab97c38bd3aa6723dc289beaa | 14c52e990c17f5a00c0cc9e09847af16fabbed25 | refs/heads/master | 1,661,979,343,526 | 1,660,830,384,000 | 1,660,830,384,000 | 182,072,989 | 0 | 0 | null | 1,555,585,876,000 | 1,555,585,876,000 | null | UTF-8 | Lean | false | false | 26,589 | lean | /-
Copyright (c) 2022 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import category_theory.balanced
import category_theory.limits.essentially_small
import category_theory.limits.opposites
import category_theory.limits.shapes.zero_morphi... |
ad13f236ec244d2ff7b59390758356c6087ebc4d | 4727251e0cd73359b15b664c3170e5d754078599 | /src/set_theory/game/pgame.lean | 00924a6c460fb056bab7bcd497157732fd438d14 | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 51,011 | lean | /-
Copyright (c) 2019 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Mario Carneiro, Isabel Longbottom, Scott Morrison
-/
import data.fin.basic
import data.list.basic
import logic.relation
/-!
# Combinatorial (pre-)games.
The basic theory... |
4f12043d5984ecd588dcdb93b6c93596ebee36a7 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/limits/preserves/limits.lean | 4798fffae9805666ef845209afe56907f9074588 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 5,044 | lean | /-
Copyright (c) 2020 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.limits.preserves.basic
/-!
# Isomorphisms about functors which preserve (co)limits
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
>... |
627c836b9c939cae0e06e7cca2fffda591e494d6 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/tree_subterm_pred.lean | 95feacd305e5785b27f35ccb0b80081582c85db7 | [
"Apache-2.0"
] | permissive | soonhokong/lean | cb8aa01055ffe2af0fb99a16b4cda8463b882cd1 | 38607e3eb57f57f77c0ac114ad169e9e4262e24f | refs/heads/master | 1,611,187,284,081 | 1,450,766,737,000 | 1,476,122,547,000 | 11,513,992 | 2 | 0 | null | 1,401,763,102,000 | 1,374,182,235,000 | C++ | UTF-8 | Lean | false | false | 2,158 | lean | import logic
open eq.ops
inductive tree (A : Type) :=
| leaf : A → tree A
| node : tree A → tree A → tree A
namespace tree
inductive direct_subterm {A : Type} : tree A → tree A → Prop :=
| node_l : Π (l r : tree A), direct_subterm l (node l r)
| node_r : Π (l r : tree A), direct_subterm r (node l r)
definition dire... |
33a341392602472a1ffd23671d772cb4d49389c9 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/topology/metric_space/metric_separated.lean | 1c2d35184ac709b7352a67f2b09be4559f1df836 | [
"Apache-2.0"
] | permissive | jcommelin/mathlib | d8456447c36c176e14d96d9e76f39841f69d2d9b | ee8279351a2e434c2852345c51b728d22af5a156 | refs/heads/master | 1,664,782,136,488 | 1,663,638,983,000 | 1,663,638,983,000 | 132,563,656 | 0 | 0 | Apache-2.0 | 1,663,599,929,000 | 1,525,760,539,000 | Lean | UTF-8 | Lean | false | false | 4,415 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import topology.metric_space.emetric_space
/-!
# Metric separated pairs of sets
In this file we define the predicate `is_metric_separated`. We say that two sets i... |
8be5c1fd9baa6b35f87759f70f273709c61a03fe | c777c32c8e484e195053731103c5e52af26a25d1 | /src/linear_algebra/matrix/special_linear_group.lean | 82548fa6bd476ccfba5e119af66ff76db141344b | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 11,904 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import linear_algebra.general_linear_group
import linear_algebra.matrix.adjugate
import linear_algebra.matrix.to_lin
/-!
# The Special Linear group $SL(n, R)$
This file d... |
4100c990376e99f77427f8d40dfa4272638b4369 | 32fa6b3db8c34b5b2996ed46f2eef23e6cd58023 | /list.lean | 1d6880a355d524e96fdca0463f9b53e41f50574e | [] | no_license | skbaek/strassen | 3568459f9aa85beb9d3a653e92225bd9518985a5 | 396c94805360b10896d436813c1e4d0190885840 | refs/heads/master | 1,587,522,553,720 | 1,549,860,051,000 | 1,549,860,051,000 | 170,051,087 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,753 | lean | namespace list
variables {α : Type}
lemma append_take_drop :
∀ k (as : list α), as.take k ++ as.drop k = as
| 0 as := rfl
| k [] := begin cases k; simp end
| (k+1) (a::as) :=
begin simp [append_take_drop] end
#exit
def split : nat → list α → (list α × list α)
| 0 [] := ([],[])
| (k+1) [] := ... |
adea3d0cdbf01e0f62397c5bbd7ffc7dc1085b49 | 10c7c971a1902d76057c52ce0529ebb491a69c44 | /Quotients.lean | eb5c8e2d3d74d12b06afaee85d3eee4b9c08759a | [] | no_license | SzymonKubica/Lean | 5f6122e8dd9171239b36a9ce0515f6acbc49781a | 627bff2f001ba3f009c112c9332093e8de84863c | refs/heads/main | 1,675,563,490,768 | 1,608,538,609,000 | 1,608,538,609,000 | 307,184,347 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,107 | lean | import tactic
/-- The equivalence relation on ℕ² such that equivalence classes are ℤ -/
def nat2.R (a b : ℕ × ℕ) : Prop :=
a.1 + b.2 = b.1 + a.2
-- here a and b are pairs, so a = (a.1, a.2) etc.
-- introduce ≈ (type with `\~~`) notation for this relation
instance : has_equiv (ℕ × ℕ) := ⟨nat2.R⟩
-- let's prove some l... |
cff284ec1d93eac74d25f4f71396e5b136f255d0 | 87d5955e1100ba73f6b56149b659e85116fa215b | /group_theory/extra.lean | bb32325d79381db319a895f1a6e2dbb0d38751c7 | [
"Apache-2.0"
] | permissive | avigad/leanproved | 4d15a05f8544a67b9f589c5e656358e1485aef3c | 3cf0f5dda3ace82f6b7cdc159528ce3ebaef159f | refs/heads/master | 1,611,368,103,158 | 1,433,589,072,000 | 1,433,589,072,000 | 36,843,899 | 0 | 0 | null | 1,433,385,918,000 | 1,433,385,918,000 | null | UTF-8 | Lean | false | false | 4,110 | lean | /-
Copyright (c) 2015 Haitao Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author : Haitao Zhang
-/
-- These belong in the library somewhere.
import data.list.basic data.finset.basic data.fintype.card
-- renamed and_imp_eq
-- theorem and_imp_curry (a b c : P... |
e4e66d1bcd32e4e786c49863f0ac310b2528fc19 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/abel.lean | a7fb931bd1e6e0ce9661d0bebca7eddbcdca1f55 | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 17,321 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.norm_num
/-!
# The `abel` tactic
Evaluate expressions in the language of additive, commutative monoids and groups.
-/
namespace tactic
namespace ab... |
8a7b94143438739874aedc0e191a691a41773c54 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/category/galois_connection.lean | 2c369976fe89eb911c936475bf239841f16bfc07 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 1,343 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison, Johannes Hölzl, Reid Barton
-/
import category_theory.category.preorder
import category_theory.adjunction.basic
import order.galois_connection
/-!
# G... |
74233bc1b3e73da65626ff619231b67c437ceedb | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/premises.lean | 76b63046cfe3719ffcccc63a558386dbe5524d5d | [
"Apache-2.0"
] | permissive | soonhokong/lean-osx | 4a954262c780e404c1369d6c06516161d07fcb40 | 3670278342d2f4faa49d95b46d86642d7875b47c | refs/heads/master | 1,611,410,334,552 | 1,474,425,686,000 | 1,474,425,686,000 | 12,043,103 | 5 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 156 | lean | variable a : Prop
variables b c : Prop
premise Ha : a
premises (Hb : b) (Hc : c)
theorem tst : a ∧ b ∧ c :=
and.intro Ha (and.intro Hb Hc)
check tst
|
5925de7bc02c6ff2a262043b0e784508f5e1942a | 7007bb645068e0b6b859aab9da7cf5c1c79e98be | /tests/lean/widget/widget1.lean | f2d77e77389863102095f0e432dcc14fb9a9a086 | [
"Apache-2.0"
] | permissive | EdAyers/lean | 7d3fb852380bc386545ebc119b7d03c128c3ce1c | be72c8dc527a062e243a408480f487a55b06cb0a | refs/heads/master | 1,624,443,179,694 | 1,592,837,958,000 | 1,592,837,958,000 | 154,972,348 | 0 | 0 | Apache-2.0 | 1,557,768,267,000 | 1,540,649,772,000 | C++ | UTF-8 | Lean | false | false | 2,972 | lean |
open widget
meta class has_show_html (π : Type) :=
(show_html' {α : Type}: π → html α)
meta def show_html {π α : Type} [has_show_html π] : π → html α := has_show_html.show_html'
meta instance string_show_html : has_show_html string := ⟨λ α p, html.of_string p⟩
meta class has_to_editor (π : Type) :=
(comp : π → htm... |
da1ca6499591d92d5ef01f1424c54d9fa1e2e87b | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /stage0/src/Lean/Elab/Deriving/Util.lean | 0b8240ea150c05e955302803b38688e982f42830 | [
"Apache-2.0"
] | permissive | WojciechKarpiel/lean4 | 7f89706b8e3c1f942b83a2c91a3a00b05da0e65b | f6e1314fa08293dea66a329e05b6c196a0189163 | refs/heads/master | 1,686,633,402,214 | 1,625,821,189,000 | 1,625,821,258,000 | 384,640,886 | 0 | 0 | Apache-2.0 | 1,625,903,617,000 | 1,625,903,026,000 | null | UTF-8 | Lean | false | false | 5,728 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Parser.Term
import Lean.Elab.Term
namespace Lean.Elab.Deriving
open Meta
def implicitBinderF := Parser.Term.implicitBinder
def instBinderF ... |
da1057daf5f1b430b25b316b58832807431bfa76 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/group/commute.lean | bff5f4635db7712c97c89491fcaddc83a1f20d2e | [
"Apache-2.0"
] | permissive | kodyvajjha/mathlib | 9bead00e90f68269a313f45f5561766cfd8d5cad | b98af5dd79e13a38d84438b850a2e8858ec21284 | refs/heads/master | 1,624,350,366,310 | 1,615,563,062,000 | 1,615,563,062,000 | 162,666,963 | 0 | 0 | Apache-2.0 | 1,545,367,651,000 | 1,545,367,651,000 | null | UTF-8 | Lean | false | false | 5,676 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland, Yury Kudryashov
-/
import algebra.group.semiconj
/-!
# Commuting pairs of elements in monoids
We define the predicate `commute a b := a * b = b * a` and provide som... |
fa30202402a503bebb68cbcdb399788e122190aa | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/listex2.lean | a12b3727b7770ddba9cc0f5756e84668554af865 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 2,400 | lean | universe variable u
constant in_tail {α : Type u} {a : α} (b : α) {l : list α} : a ∈ l → a ∈ b::l
constant in_head {α : Type u} (a : α) (l : list α) : a ∈ a::l
constant in_left {α : Type u} {a : α} {l : list α} (r : list α) : a ∈ l → a ∈ l ++ r
constant in_right {α : Type u} {a : α} (l : l... |
93f72a187d74ad64372ba1ec205bd861c409a9fa | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /test4.lean | be732a0ccd2cd1d3ca0cf567cf92a1db9f18e0b4 | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,564 | lean |
-- let's define the real numbers to be a number system which satisfies
-- the basic properties of the real numbers which we will need.
noncomputable theory
constant real : Type
@[instance] constant real_field : linear_ordered_field real
-- This piece of magic means that "real" now behaves a lot like
-- the real nu... |
c0ede06c6f1acd6329d8958dddcc7d9063a3dc5e | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/category_theory/opposites.lean | 54720541d047bb962dcf7b3992aafd9524245cb1 | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,880 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Stephen Morgan, Scott Morrison
-/
import category_theory.types
import category_theory.equivalence
universes v₁ v₂ u₁ u₂ -- morphism levels before object levels. See note [category_the... |
c06e1b4c5138326ec6cf167c1bbc64cc843bcd28 | 4fa161becb8ce7378a709f5992a594764699e268 | /src/data/finsupp.lean | acf528c6aaf7086d8184451cb893c808827cfd7f | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 70,986 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Scott Morrison
-/
import algebra.module
import data.fintype.card
/-!
# Type of functions with finite support
For any type `α` and a type `β` with zero, we define the... |
f172d9fabd0742cb94c524078fa82e243a120328 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/data/hash_map.lean | 53a2d86e74c7e3236ef6beaa5cb36077d26c0180 | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 29,737 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Mario Carneiro
-/
import data.pnat.basic
import data.list.range
import data.array.lemmas
import algebra.group
import data.sigma.basic
/-!
# Hash maps
Define... |
2fd54dee7b164fc2c2c0f4d9ff399fc954b58d3f | 159fed64bfae88f3b6a6166836d6278f953bcbf9 | /Structure/ConcreteBuildingBlocks.lean | f9059fec84c60c4376322a9edbe5a567c2ae9d48 | [
"MIT"
] | permissive | SReichelt/lean4-experiments | 3e56830c8b2fbe3814eda071c48e3c8810d254a8 | ff55357a01a34a91bf670d712637480089085ee4 | refs/heads/main | 1,683,977,454,907 | 1,622,991,121,000 | 1,622,991,121,000 | 340,765,677 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 316 | lean | -- An abstract formalization of "isomorphism is equality up to relabeling"
-- -------------------------------------------------------------------------
--
-- See `README.md` for more info.
--
-- TODO: Here, we need to specialize the building blocks from `AbstractBuildingBlocks.lean` to actual types and instances.
|
7c1773824348d3657d6e69643259111c51f81c25 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/functor_categories/whiskering.lean | 2b196d9fe2e909e7ef6ec431c1d36ce57ec1e93b | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 3,362 | lean | -- Copyright (c) 2018 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.functor_category
import category_theory.tactics.obviously
set_option trace.tidy true
namespace category_theory
universes u₁ v₁ u₂ v₂ u₃ ... |
c61ad69d2036e13cfe67bfcc367c374f46ee303d | ce6917c5bacabee346655160b74a307b4a5ab620 | /src/ch5/ex0102.lean | 682bcec6df3e17764b133c669c7274aa9d758458 | [] | no_license | Ailrun/Theorem_Proving_in_Lean | ae6a23f3c54d62d401314d6a771e8ff8b4132db2 | 2eb1b5caf93c6a5a555c79e9097cf2ba5a66cf68 | refs/heads/master | 1,609,838,270,467 | 1,586,846,743,000 | 1,586,846,743,000 | 240,967,761 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 146 | lean | theorem test (p q : Prop) (hp : p) (hq : q) : p ∧ q ∧ p :=
begin
apply and.intro,
exact hp,
apply and.intro,
exact hq,
exact hp
end
|
3ff834f6641839a7e3455f46720fcb1659047536 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/henselian.lean | 453fb3c8464a1a9070024f8d749f47d0614206fe | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 11,760 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import data.polynomial.taylor
import ring_theory.ideal.local_ring
import linear_algebra.adic_completion
/-!
# Henselian rings
In this file we set up the basic theo... |
71fc62fc08fc22770e0d7d60497b3a88c9a3fa1c | 432d948a4d3d242fdfb44b81c9e1b1baacd58617 | /src/ring_theory/eisenstein_criterion.lean | cba1ee88562311c5ccb7bf672c8ba08b4b116d5c | [
"Apache-2.0"
] | permissive | JLimperg/aesop3 | 306cc6570c556568897ed2e508c8869667252e8a | a4a116f650cc7403428e72bd2e2c4cda300fe03f | refs/heads/master | 1,682,884,916,368 | 1,620,320,033,000 | 1,620,320,033,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,539 | lean | /-
Copyright (c) 2020 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import ring_theory.prime
import ring_theory.polynomial.content
/-!
# Eisenstein's criterion
A proof of a slight generalisation of Eisenstein's criterion for the irreduci... |
c8edd14682e631a81cb59bf4985ff9baefbb489a | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/topology/instances/nnreal.lean | d7ad5308071d291c53c02b56d73dc0fb967f48a3 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 4,614 | lean | /-
Copyright (c) 2018 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
Nonnegative real numbers.
-/
import topology.algebra.infinite_sum
noncomputable theory
open set topological_space metric
open_locale topological_space
namespace nnreal... |
11cb47f3f7af25ba321b9c3704df2cd1139a0220 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/algebra/homology/complex_shape.lean | 8be04efb55ad38869d445c813d24546326af85d7 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 6,276 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Scott Morrison
-/
import algebra.group.defs
import data.option.basic
import logic.relation
/-!
# Shapes of homological complexes
We define a structure `complex_shape ... |
6ffb7967d59e29288c360288b98fab205e33a381 | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/ppProofs.lean | 35ce06374f1028ea4c48949326774c245edd22c5 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 420 | lean | set_option pp.analyze.trustSubst true
set_option pp.proofs false
example (h : α = β) : h ▸ (a : α) = (b : β) := _
example (h : α = β) : id h ▸ (a : α) = (b : β) := _
example (h : α = β) : id h ▸ (a : α) = (b : β) := by simp
set_option pp.proofs.withType false
example (h : α = β) : id h ▸ (a : α) = (b : β) := _
set_opti... |
920bbd4ba50e3d1b5dca7c32487d5914a2cf26bc | 0845ae2ca02071debcfd4ac24be871236c01784f | /tests/playground/persistentarray.lean | be7457fd114cd65bdddab984f5d8cd7e6d8a6ff6 | [
"Apache-2.0"
] | permissive | GaloisInc/lean4 | 74c267eb0e900bfaa23df8de86039483ecbd60b7 | 228ddd5fdcd98dd4e9c009f425284e86917938aa | refs/heads/master | 1,643,131,356,301 | 1,562,715,572,000 | 1,562,715,572,000 | 192,390,898 | 0 | 0 | null | 1,560,792,750,000 | 1,560,792,749,000 | null | UTF-8 | Lean | false | false | 779 | lean | import init.data.persistentarray
abbrev MyArray := PersistentArray Nat
-- abbrev MyArray := Array Nat
def mkMyArray (n : Nat) : MyArray :=
n.fold (λ i s, s.push i) { PersistentArray . }
-- n.fold (λ i s, s.push i) Array.empty
def check (n : Nat) (p : Nat → Nat → Bool) (s : MyArray) : IO Unit :=
n.mfor $ λ i, unless ... |
affd49068c6c7f105589e8d82de19cba2f0062ff | ab34e36d695606fd149ce177e03e0fc29ad58c72 | /main.lean | 33d0c3b4d1150059c12d22807e9749a82833484f | [] | no_license | theemathas/loogle | 85d44e527094f9ecc7dd5f0ae17ba1f86392fe70 | 68439fea92b16464b9080d3e44ad319970770efd | refs/heads/master | 1,609,480,375,031 | 1,499,554,592,000 | 1,499,554,671,000 | 97,296,823 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,231 | lean | import .logging
universe u
/- Checks if applying a tactic will succeed without actually applying it -/
meta def tactic.will_succeed {α : Type u} (t : tactic α) : tactic bool :=
λ ts,
let b :=
match t ts with
| (result.success _ _) := tt
| (result.exception _ _ _) := ff
end
in result.... |
37c11fa2549e12300a7e613f127e7cd5d866bed2 | e514e8b939af519a1d5e9b30a850769d058df4e9 | /src/lib/array.lean | 2eedbfd80527a64eaaa71a295c23902ebc082298 | [] | no_license | semorrison/lean-rewrite-search | dca317c5a52e170fb6ffc87c5ab767afb5e3e51a | e804b8f2753366b8957be839908230ee73f9e89f | refs/heads/master | 1,624,051,754,485 | 1,614,160,817,000 | 1,614,160,817,000 | 162,660,605 | 0 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,964 | lean | universes u v z
namespace array
-- TODO Prove well-founded induction
meta def mmap_copy_aux {k : Type v → Type z} [monad k] {α : Type u} {β : Type v} {n m : ℕ} (f : α → k β) : ℕ → array n α → array m β → k (array m β)
| r x y := do if h : r < n ∧ r < m then do
let fn : fin n := ⟨r, and.elim_left h⟩,
... |
d5bf994054cf4ccf7c318dbc915fd7a0cf3ee0d9 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/project_1_a_decrire/lean-scheme-submission/src/sheaves/stalk_on_basis.lean | 0e5af7a7dacd73987b8691f0a8d1087975d1e816 | [] | no_license | Or7ando/lean | cc003e6c41048eae7c34aa6bada51c9e9add9e66 | d41169cf4e416a0d42092fb6bdc14131cee9dd15 | refs/heads/master | 1,650,600,589,722 | 1,587,262,906,000 | 1,587,262,906,000 | 255,387,160 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,715 | lean | /-
Stalk (of types) on basis.
https://stacks.math.columbia.edu/tag/009H
-/
import to_mathlib.opens
import sheaves.presheaf_on_basis
open topological_space
universe u
variables {α : Type u} [topological_space α]
variables {B : set (opens α )} {HB : opens.is_basis B}
variables (F : presheaf_on_basis α HB) ... |
85ff1bd84a409d01af67db9ed3b5bbbf7c27bcd3 | a81826cfd4fd71c797ea79b8e827b03ccb332c17 | /src/wonky_sq/differentiation.lean | 55304cd436730d6fce46db2d0821cd82bc44607f | [
"Apache-2.0"
] | permissive | jamesa9283/Generalised-Trigonometric-Functions-for-Lean | 0a0f4774363c3708be466526935c6d07f4b970f0 | 33775fb8286eacfc17397fe41af9d446cbdd78f3 | refs/heads/master | 1,669,337,232,958 | 1,597,061,947,000 | 1,597,061,947,000 | 276,104,804 | 0 | 0 | null | 1,593,540,795,000 | 1,593,523,262,000 | Lean | UTF-8 | Lean | false | false | 563 | lean | import analysis.special_functions.trigonometric
import wonky_sq.basic
--open real
/-!
Right, so this seems really confusing. So we are going to do a couple of things.
* Prove that sinₘ x is continuous
* Prove that sinₘ x is differentiable
* Prove that sinₘ x has a differential and its on the paper
* Do that for th... |
0cdb91ab98756be34da6d1c446fcf21c26e8d352 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/algebra/category/Module/kernels.lean | 83592e487de2cf2b318ee4818ab1300e9d923be0 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 2,436 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import algebra.category.Module.basic
/-!
# The concrete (co)kernels in the category of modules are (co)kernels in the categorical sense.
-/
open category_theory
open ... |
9860e99c45bc2dfef043eeca86215ec330600aa4 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/tactic/subtype_instance.lean | 7f027343a34e95d9505571b0201cf407fa1770fa | [
"Apache-2.0"
] | permissive | gebner/mathlib | eab0150cc4f79ec45d2016a8c21750244a2e7ff0 | cc6a6edc397c55118df62831e23bfbd6e6c6b4ab | refs/heads/master | 1,625,574,853,976 | 1,586,712,827,000 | 1,586,712,827,000 | 99,101,412 | 1 | 0 | Apache-2.0 | 1,586,716,389,000 | 1,501,667,958,000 | Lean | UTF-8 | Lean | false | false | 2,372 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Provides a `subtype_instance` tactic which builds instances for algebraic substructures
(sub-groups, sub-rings...).
-/
import data.string.basic
import tactic.interactive tac... |
c6bd23c93f166f7bb86c9bf0e05c3f2627252313 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/linear_algebra/affine_space/ordered.lean | ba9ede16290db11377a6f01e0ee3491d470bdd75 | [
"Apache-2.0"
] | permissive | jjgarzella/mathlib | 96a345378c4e0bf26cf604aed84f90329e4896a2 | 395d8716c3ad03747059d482090e2bb97db612c8 | refs/heads/master | 1,686,480,124,379 | 1,625,163,323,000 | 1,625,163,323,000 | 281,190,421 | 2 | 0 | Apache-2.0 | 1,595,268,170,000 | 1,595,268,169,000 | null | UTF-8 | Lean | false | false | 15,794 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import linear_algebra.affine_space.midpoint
import algebra.module.ordered
import tactic.field_simp
/-!
# Ordered modules as affine spaces
In this file we de... |
3d46e85c4ee370fa2753a75689ba2bdba3a3e7a0 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/number_theory/multiplicity.lean | 52564d9bc8ed8ec159ddfdd65b5d9472748fa3d6 | [
"Apache-2.0"
] | permissive | alreadydone/mathlib | dc0be621c6c8208c581f5170a8216c5ba6721927 | c982179ec21091d3e102d8a5d9f5fe06c8fafb73 | refs/heads/master | 1,685,523,275,196 | 1,670,184,141,000 | 1,670,184,141,000 | 287,574,545 | 0 | 0 | Apache-2.0 | 1,670,290,714,000 | 1,597,421,623,000 | Lean | UTF-8 | Lean | false | false | 17,444 | lean | /-
Copyright (c) 2022 Tian Chen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Tian Chen, Mantas Bakšys
-/
import algebra.geom_sum
import data.int.parity
import data.zmod.basic
import number_theory.padics.padic_val
/-!
# Multiplicity in Number Theory
This file conta... |
3b1915e310f9f795c5790dbd3b2a752481c201bd | 4f065978c49388d188224610d9984673079f7d91 | /Knaster-Tarski.lean | f0a3897b72c4cbc34291cdaf7ae329ada4d36c01 | [] | no_license | kckennylau/Lean | b323103f52706304907adcfaee6f5cb8095d4a33 | 907d0a4d2bd8f23785abd6142ad53d308c54fdcb | refs/heads/master | 1,624,623,720,653 | 1,563,901,820,000 | 1,563,901,820,000 | 109,506,702 | 3 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 4,252 | lean | import order.complete_lattice order.order_iso order.fixed_points
open lattice
universe u
variables {α : Type u} [complete_lattice α]
variables (f : α → α) (M : monotone f)
def fixed_points : set α := { x | f x = x }
namespace fixed_points
def previous (x : α) : α :=
gfp (λ z, x ⊓ f z)
variable {f}
theorem previ... |
d8bd2ea0b6e9aea11d03774dd06b2881cd5e975f | ea5678cc400c34ff95b661fa26d15024e27ea8cd | /limits.lean | 71f7456bbb7e99a68c1dd2c8ab08c3513f731de9 | [] | no_license | ChrisHughes24/leanstuff | dca0b5349c3ed893e8792ffbd98cbcadaff20411 | 9efa85f72efaccd1d540385952a6acc18fce8687 | refs/heads/master | 1,654,883,241,759 | 1,652,873,885,000 | 1,652,873,885,000 | 134,599,537 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,317 | lean | import data.complex.basic
namespace cau_seq
theorem const_inv {α β : Type*} [discrete_field β] [discrete_linear_ordered_field α] {abv : β → α}
[is_absolute_value abv] {x : β} (hx : x ≠ 0) :
const abv (x⁻¹) = inv (const abv x) (by rwa const_lim_zero) :=
ext (assume n, by simp[inv_apply, const_apply])
end cau_s... |
a69c3bfb664bd1984af396fc0137c6502f944a7e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/options_auto.lean | bc34af860534c1df71989aef4a94b41de045ad80 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 257 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.name
namespace Mathlib
end Mathlib |
42216cebf9162858b202d81f3be3ad4524635f0a | 3618c6e11aa822fd542440674dfb9a7b9921dba0 | /src/cyclically_reduce.lean | c30ea77d4b5b8dcbba4b1e108e4da03930889033 | [] | no_license | ChrisHughes24/single_relation | 99ceedcc02d236ce46d6c65d72caa669857533c5 | 057e157a59de6d0e43b50fcb537d66792ec20450 | refs/heads/master | 1,683,652,062,698 | 1,683,360,089,000 | 1,683,360,089,000 | 279,346,432 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,789 | lean | import coprod.free_group
import initial
/-!
# Cyclically reducing words
This file contains three functions `cyclically_reduce`, `cyclically_conjugate` and
`min_max_subscript`
-/
variables {ι : Type} [decidable_eq ι]
open free_group mul_aut multiplicative
/-- Given a word `r` returns a pair `(g, r')` such that `r'` is... |
714de9c581526e7de0935b55a8b468a151cdb375 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/ring_theory/subsemiring/basic.lean | a3226669e9c8ae2b94047b34a5bc897b99bb9d19 | [
"Apache-2.0"
] | permissive | robertylewis/mathlib | 3d16e3e6daf5ddde182473e03a1b601d2810952c | 1d13f5b932f5e40a8308e3840f96fc882fae01f0 | refs/heads/master | 1,651,379,945,369 | 1,644,276,960,000 | 1,644,276,960,000 | 98,875,504 | 0 | 0 | Apache-2.0 | 1,644,253,514,000 | 1,501,495,700,000 | Lean | UTF-8 | Lean | false | false | 35,059 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.ring.prod
import algebra.module.basic
import group_theory.submonoid.membership
import group_theory.submonoid.center
import data.set.finite
import dat... |
cdf2c5895a3801eaf18fbf098ca4d6e303fa9035 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/rat/default.lean | 19df28db197c87795a75dec9046dceb33502f302 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 292 | lean | /-
Copyright (c) 2019 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.rat.floor
import Mathlib.PostPort
namespace Mathlib
|
bfdf3997f3639439d703038a4e16070d2662c8d8 | e7de183433d907275be4926240a8c8ddb5915131 | /recipes/plain-lean3.lean | b9148cfe098fc2b855db7a3b9c80850df1bc0e64 | [
"MIT"
] | permissive | cpitclaudel/alectryon | 70b01086e9b4aee4f18017621578004903ce74d3 | 11e8cdc8395d66858baa7371b6cf8e827ca38f4a | refs/heads/master | 1,683,666,125,135 | 1,683,473,634,000 | 1,683,473,844,000 | 260,735,576 | 206 | 29 | MIT | 1,655,000,579,000 | 1,588,439,321,000 | HTML | UTF-8 | Lean | false | false | 417 | lean | /- To compile:
alectryon --frontend lean3 plain-lean3.lean # Lean → HTML; produces ‘plain-lean3.lean.html’ -/
-- Queries:
#check nat #check bool
-- Proofs:
example (p q r : Prop) : p ∧ q ↔ q ∧ p :=
begin
apply iff.intro,
intro H,
apply and.intro,
apply (and.elim_right H),
apply (and.elim_left H),
in... |
786c2ad99e911dec94cdb3e94e22e86741a33246 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/sheaves/stalks.lean | 8801ae491a9dfd590f011babe8e73a900d6d1fbd | [
"Apache-2.0"
] | permissive | Vierkantor/mathlib | 0ea59ac32a3a43c93c44d70f441c4ee810ccceca | 83bc3b9ce9b13910b57bda6b56222495ebd31c2f | refs/heads/master | 1,658,323,012,449 | 1,652,256,003,000 | 1,652,256,003,000 | 209,296,341 | 0 | 1 | Apache-2.0 | 1,568,807,655,000 | 1,568,807,655,000 | null | UTF-8 | Lean | false | false | 24,410 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Justus Springer
-/
import topology.category.Top.open_nhds
import topology.sheaves.presheaf
import topology.sheaves.sheaf_condition.unique_gluing
import category_theory.... |
7e344c75a5165fdc04949e7c861ea6b877528c39 | e030b0259b777fedcdf73dd966f3f1556d392178 | /tests/lean/run/ematch2.lean | 6211e177397d498aef5e93775ed78222c046b978 | [
"Apache-2.0"
] | permissive | fgdorais/lean | 17b46a095b70b21fa0790ce74876658dc5faca06 | c3b7c54d7cca7aaa25328f0a5660b6b75fe26055 | refs/heads/master | 1,611,523,590,686 | 1,484,412,902,000 | 1,484,412,902,000 | 38,489,734 | 0 | 0 | null | 1,435,923,380,000 | 1,435,923,379,000 | null | UTF-8 | Lean | false | false | 1,005 | lean | namespace foo
universe variables u
variables {α : Type u}
open tactic
meta def add_insts : list (expr × expr) → tactic unit
| [] := skip
| ((inst, pr)::r) := do
assertv `_einst inst pr,
add_insts r
meta def internalize_hs : list expr → ematch_state → tactic ematch_state
| [] s := return s
| (h:... |
d8997381c1363d429d008182fe7ed16f8100f577 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /tests/lean/run/depElim1.lean | 27127e3ded287fb7cc231b555bb1526a6c31f9c2 | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 13,777 | lean | import Lean.Meta.Match
open Lean
open Lean.Meta
open Lean.Meta.Match
/- Infrastructure for testing -/
universes u v
def check (x : Bool) : IO Unit := do
unless x do
throw $ IO.userError "check failed"
def inaccessible {α : Sort u} (a : α) : α := a
def val {α : Sort u} (a : α) : α := a
def As {α : Sort u} (v a : ... |
a5d90d6039edda193635f9d6497aff5cce8d17c5 | 2dae50597b29069308a49d0995d06d4a0720029a | /lean_modifications/tactic_modifications.lean | acdb5777c3ad37fa0ab14d142fbcae49572011aa | [
"Apache-2.0"
] | permissive | jasonrute/lean-proof-recording-public-old | d94ae9ba64c1cbf49cda9fb4f25755a3d92fb171 | 34e75a8bb67b6527177b217c9207191d409368dd | refs/heads/master | 1,678,527,177,787 | 1,613,767,073,000 | 1,613,767,073,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,655 | lean | /- This is a staging area for code which will be inserted
into a Lean file.
The code to be inserted is between the line comments
`PR BEGIN MODIFICATION` and `PR END MODIFICATION`
It will be inserted by `insert_proof_recording_code.py`.
Insert info:
- file: `_target/lean/library/init/meta/tactic.lean`
- location... |
4e967fbff6ca9965a516c475b08f4f9019cc73fe | fc086f79b20cf002d6f34b023749998408e94fbf | /examples/proofs-by-induction.lean | 189360495d8db4f025657dd17eeb2ff94d237156 | [] | no_license | semorrison/lean-tidy | f039460136b898fb282f75efedd92f2d5c5d90f8 | 6c1d46de6cff05e1c2c4c9692af812bca3e13b6c | refs/heads/master | 1,624,461,332,392 | 1,559,655,744,000 | 1,559,655,744,000 | 96,569,994 | 9 | 4 | null | 1,538,287,895,000 | 1,499,455,306,000 | Lean | UTF-8 | Lean | false | false | 3,771 | lean | import algebra.big_operators data.fintype
import tactic.ring
import tidy.tidy
-- https://xenaproject.wordpress.com/2018/03/30/proofs-by-induction/
open nat
def odd : ℕ → ℕ := λ i, 2 * i + 1
def square : ℕ → ℕ := λ i, i * i
@[ematch] theorem odd_square_inductive_step (d : ℕ) :
odd d + square d = square (d+1) :=
be... |
da72ff5c29fe8f70800c94d6704b8309099da632 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/category_theory/limits/concrete_category.lean | 151489d19408b8f8fe86407f30571bc0649cfb42 | [
"Apache-2.0"
] | permissive | abentkamp/mathlib | d9a75d291ec09f4637b0f30cc3880ffb07549ee5 | 5360e476391508e092b5a1e5210bd0ed22dc0755 | refs/heads/master | 1,682,382,954,948 | 1,622,106,077,000 | 1,622,106,077,000 | 149,285,665 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 528 | lean | /-
Copyright (c) 2017 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.has_limits
import category_theory.concrete_category.basic
import tactic.elementwise
/-!
# Facts about (co)limits of functors into concr... |
db5f1bb00245d212a408be0b25ef93e904121528 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/mk_iff_of_inductive.lean | f8bafe42a7c8911decf856877e5ad2e4237e3e6f | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,004 | lean | import data.list.perm
import data.multiset.basic
mk_iff_of_inductive_prop list.chain test.chain_iff
mk_iff_of_inductive_prop false test.false_iff
mk_iff_of_inductive_prop true test.true_iff
mk_iff_of_inductive_prop nonempty test.non_empty_iff
mk_iff_of_inductive_prop and test.and_iff
mk_iff_of_inducti... |
e62a1017106f72cb48aa9f420456b61c9a3298a1 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/measure_theory/integral/layercake.lean | 058d48d0699f950fa7dd0a2d93b52296b9db076e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 18,279 | lean | /-
Copyright (c) 2022 Kalle Kytölä. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kalle Kytölä
-/
import measure_theory.integral.interval_integral
import analysis.special_functions.integrals
/-!
# The layer cake formula / Cavalieri's principle / tail probability form... |
2e85dc80e9d2e48ed7ffddb452db186bd29c4a07 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /src/Lean/Data/Occurrences.lean | 8058c4512cd4b174ba92d795f4f619f67d3ae38a | [
"Apache-2.0"
] | permissive | jcommelin/lean4 | c02dec0cc32c4bccab009285475f265f17d73228 | 2909313475588cc20ac0436e55548a4502050d0a | refs/heads/master | 1,674,129,550,893 | 1,606,415,348,000 | 1,606,415,348,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 813 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
namespace Lean
inductive Occurrences :=
| all
| pos (idxs : List Nat)
| neg (idxs : List Nat)
namespace Occurrences
instance : Inhabited Occurrence... |
2874635abefe5137f0f0ef6168ae6e3918c2312f | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/ordered/monotone_continuity.lean | 8605580df7ae9dd37da7082badc0f7928c7934bc | [
"Apache-2.0"
] | permissive | AntoineChambert-Loir/mathlib | 64aabb896129885f12296a799818061bc90da1ff | 07be904260ab6e36a5769680b6012f03a4727134 | refs/heads/master | 1,693,187,631,771 | 1,636,719,886,000 | 1,636,719,886,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,380 | lean | /-
Copyright (c) 2021 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov, Heather Macbeth
-/
import topology.algebra.ordered.basic
import topology.algebra.ordered.left_right
/-!
# Continuity of monotone functions
In this file we pro... |
cf20f03cc5fb55d44f6f19eef65b15439b593d65 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/simpIssue.lean | 9c52466a5b26dabfb8ca3a6d4dac60f9941685d4 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 49 | lean | example {a: Nat} (h: a = a): True := by simp_all
|
d63790b88654a27bb942ee026bb93499c0508361 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/path_connected_auto.lean | 25ccfa3495ee45bf52e02b7705b06acbcd4c1205 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,692 | lean | /-
Copyright (c) 2020 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.instances.real
import Mathlib.topology.algebra.ordered.proj_Icc
import Mathlib.Pos... |
70cfa26034e2d1808d9aa129b5028ba936a71cc5 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/ordered_monoid.lean | 0948ec3262286283b581d561463a1d00a35d9f2c | [
"Apache-2.0"
] | permissive | hikari0108/mathlib | b7ea2b7350497ab1a0b87a09d093ecc025a50dfa | a9e7d333b0cfd45f13a20f7b96b7d52e19fa2901 | refs/heads/master | 1,690,483,608,260 | 1,631,541,580,000 | 1,631,541,580,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 39,061 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro, Johannes Hölzl
-/
import algebra.group.with_one
import algebra.group.type_tags
import algebra.group.prod
import algebra.order_functions... |
fc8b4c750ba7c5d4a80be2d1ebe00865739f65a5 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/module/basic.lean | b7e07cf660abfab421112bc05114061b2ddd5bcd | [
"Apache-2.0"
] | permissive | urkud/mathlib | eab80095e1b9f1513bfb7f25b4fa82fa4fd02989 | 6379d39e6b5b279df9715f8011369a301b634e41 | refs/heads/master | 1,658,425,342,662 | 1,658,078,703,000 | 1,658,078,703,000 | 186,910,338 | 0 | 0 | Apache-2.0 | 1,568,512,083,000 | 1,557,958,709,000 | Lean | UTF-8 | Lean | false | false | 25,226 | lean | /-
Copyright (c) 2015 Nathaniel Thomas. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nathaniel Thomas, Jeremy Avigad, Johannes Hölzl, Mario Carneiro
-/
import algebra.big_operators.basic
import algebra.smul_with_zero
import group_theory.group_action.big_operators
imp... |
ac9bd57a2a8ceaf791eb21cf7f8302eb1c59fd12 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/aops/1989-USAMO-Problem_3.lean | e3f3202d40ea60caf14fa43087f83b85fca036fd | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 346 | lean | import data.real.basic
import topology.continuous_function.polynomial
import data.polynomial.basic
import data.polynomial.ring_division
import data.complex.basic
theorem USAMO_Problem_3_1989 (P : polynomial ℂ) :
complex.abs(P.eval complex.I) < 1 →
∃ a b : ℝ, (P.eval (a+b*complex.I : ℂ) = 0 ∧ (a^2+b^2+1)^2 < 4*b^2+1)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.