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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
70241cce72f24ba369a5c26abd6d2e1f4fde004b | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed/order/upper_lower.lean | c834d2d671ddc7cb2207b78baede262196385999 | [
"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,416 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import algebra.order.field.pi
import analysis.normed.group.pointwise
import analysis.normed.order.basic
import topology.algebra.order.upper_lower
/-!
# Upper/lower/order... |
83be8cc25bd21a475fa38a51139529072b9bc5b4 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /tests/lean/binsearch.lean | b4b41f0cf0db998b54e38f131565cbe31619c792 | [
"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 | 448 | lean |
partial def mkAssocArray : Nat → Array (Nat × Bool) → Array (Nat × Bool)
| 0, as => as
| i+1, as => mkAssocArray i (as.push (i, i % 2 == 0))
def tst (n : Nat) : IO Unit :=
do
let as := mkAssocArray n Array.empty;
IO.println as;
let as := as.qsort (fun a b => a.1 < b.1);
(2*n).forM $ fun i => do
let entry := as.b... |
061d199c8625df12ce2bf424eb156a8584399473 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/logic/embedding.lean | d134cd7c41eca0ba3a1ad79703de9f1102713db9 | [
"Apache-2.0"
] | permissive | EdAyers/mathlib | 9ecfb2f14bd6caad748b64c9c131befbff0fb4e0 | ca5d4c1f16f9c451cf7170b10105d0051db79e1b | refs/heads/master | 1,626,189,395,845 | 1,555,284,396,000 | 1,555,284,396,000 | 144,004,030 | 0 | 0 | Apache-2.0 | 1,533,727,664,000 | 1,533,727,663,000 | null | UTF-8 | Lean | false | false | 5,865 | 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, Mario Carneiro
Injective functions.
-/
import data.equiv.basic data.option.basic
universes u v w x
namespace function
structure embedding (α : Sort*) (β : Sort*) :=... |
4dfe75930d06a4aba6e6959722302639ac4f63a9 | ef47cc39429c8f578004338bf040c9c309b26766 | /src/for_mathlib/category_theory/limits/shapes/kernels.lean | 422bb23388aac70147ab7eaa17abbd6ebe8fa6f0 | [] | no_license | farmanb/lftcm2020 | 29f1c646437a8f8b00ee2e07c8b663ca04bfa16f | 1948bfaf58e3b340b39cd9b8366aa4f13e5ffa7d | refs/heads/master | 1,669,697,152,764 | 1,595,275,412,000 | 1,595,275,412,000 | 285,654,242 | 0 | 0 | null | 1,596,742,086,000 | 1,596,742,085,000 | null | UTF-8 | Lean | false | false | 3,983 | lean | import category_theory.limits.shapes.kernels
open category_theory
namespace category_theory.limits
universes v u
variables {C : Type u} [category.{v} C] [has_zero_morphisms C]
@[simps]
def cokernel_comp_is_iso {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z)
[has_cokernel (f ≫ g)] [has_cokernel f] [is_iso g] :
cokernel (f ... |
cbda939a20961be0a39283044a2e8dbbbf50eace | aa5a655c05e5359a70646b7154e7cac59f0b4132 | /src/Lean/Elab/SyntheticMVars.lean | dab641a8faf8b9bde020ef69fae55578cb0ceec5 | [
"Apache-2.0"
] | permissive | lambdaxymox/lean4 | ae943c960a42247e06eff25c35338268d07454cb | 278d47c77270664ef29715faab467feac8a0f446 | refs/heads/master | 1,677,891,867,340 | 1,612,500,005,000 | 1,612,500,005,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,736 | 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, Sebastian Ullrich
-/
import Lean.Util.ForEachExpr
import Lean.Elab.Term
import Lean.Elab.Tactic.Basic
namespace Lean.Elab.Term
open Tactic (TacticM evalTacti... |
8f9b2e017b2e7d123bcf57587aa1d5ad72a635bd | 2fbe653e4bc441efde5e5d250566e65538709888 | /src/analysis/calculus/tangent_cone.lean | a1de6d5aab419aa6bba0d75e8f70f6ffaaf2191b | [
"Apache-2.0"
] | permissive | aceg00/mathlib | 5e15e79a8af87ff7eb8c17e2629c442ef24e746b | 8786ea6d6d46d6969ac9a869eb818bf100802882 | refs/heads/master | 1,649,202,698,930 | 1,580,924,783,000 | 1,580,924,783,000 | 149,197,272 | 0 | 0 | Apache-2.0 | 1,537,224,208,000 | 1,537,224,207,000 | null | UTF-8 | Lean | false | false | 18,836 | lean | /-
Copyright (c) 2019 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 analysis.convex.basic analysis.normed_space.bounded_linear_maps analysis.specific_limits
/-!
# Tangent cone
In this file, we define two predicates `un... |
fcb753f05c0817ec025bd7ba46dd41178f1435ee | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/group_theory/schreier.lean | 8cc1440ee1d67f9431768573b2bea3184f6de91a | [
"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 | 10,469 | lean | /-
Copyright (c) 2022 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import group_theory.abelianization
import group_theory.exponent
import group_theory.transfer
/-!
# Schreier's Lemma
In this file we prove Schreier's lemma.
## M... |
886bb80e5d05916ec6d6c98246c2a3ae1eb8ed83 | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/topology/list.lean | e3c32d28735804cd5e6913c0563bd4b8bb33d044 | [
"Apache-2.0"
] | permissive | midfield/mathlib | c4db5fa898b5ac8f2f80ae0d00c95eb6f745f4c7 | 775edc615ecec631d65b6180dbcc7bc26c3abc26 | refs/heads/master | 1,675,330,551,921 | 1,608,304,514,000 | 1,608,304,514,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,889 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl
-/
import topology.constructions
import topology.algebra.group
/-!
# Topology on lists and vectors
-/
open topological_space set filter
open_locale topological_space filte... |
f5309461e81ee7de002cbeb7ae550d56c2db97a8 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/playground/moddata.lean | 0badfdfd8a2a7181eec2d37bb6b0bbbb62a5a3cc | [
"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 | 478 | lean | import init.lean.environment
open Lean
def saveTestFile (fn : String) : IO Unit :=
saveModuleData fn {
imports := [`foo, `bla].toArray,
constants := Array.empty,
entries := Array.empty,
serialized := [1, 2, 3, 4].toByteArray
}
def openTestFile (fn : String) : IO Unit :=
do m ← readModuleData fn,
IO.... |
2cb9d6f869c188b04b675fdae6484c6c32b6235d | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/data/finsupp/antidiagonal.lean | 098888c0e40d73769c6b5bcdca970e0446e8977f | [
"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 | 4,499 | 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, Yury Kudryashov
-/
import data.finsupp.basic
import data.multiset.antidiagonal
/-!
# The `finsupp` counterpart of `multiset.antidiagonal`.
The antidiagonal of `s : α ... |
fb9d1ee73de003d7138b3af5fb14a50569664706 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /test/rcases.lean | 07c159e5bdc429f08ab91907a300f37a94daa137 | [
"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 | 4,195 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import tactic.rcases
universe u
variables {α β γ : Type u}
example (x : α × β × γ) : true :=
begin
rcases x with ⟨a, b, c⟩,
{ guard_hyp a : α,
guard_hyp b : β,
... |
716fc8c134fee17afa28862b37ce1b55b9d08155 | a0e23cfdd129a671bf3154ee1a8a3a72bf4c7940 | /src/Lean/Elab/Frontend.lean | c2b85a511e14aee7574078e5adbccb0811b8b114 | [
"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 | 4,718 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Elab.Import
import Lean.Elab.Command
import Lean.Util.Profile
namespace Lean.Elab.Frontend
structure State where
commandS... |
fd87ded03421cdc6a1e04eeed484fb5d0c79615a | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/list/big_operators/lemmas.lean | e42d4982a4244278b45a2707ccd8dcffeddc97ec | [
"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,717 | 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, Floris van Doorn, Sébastien Gouëzel, Alex J. Best
-/
import data.list.big_operators.basic
import algebra.group.opposite
import algebra.group_power.basic
import algebra.... |
3b1cef67e760d85d4a09fd90ad0a704911cace11 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/algebra/char_p.lean | 8320afb50877c8ab0eaeaad35e7fb65e49957693 | [
"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 | 14,447 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Kenny Lau, Joey van Langen, Casper Putz
-/
import data.fintype.basic
import data.nat.choose
import data.int.modeq
import algebra.module.basic
import algebra.iterate_hom
import group_theory.... |
d56babb07efd3fc2d58cff5215bd4960e209ca1a | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/uniform_space/absolute_value.lean | 6232d4f0bc56116b88d872d6be1a73dae500ddbf | [] | 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 | 2,108 | lean | /-
Copyright (c) 2019 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.data.real.cau_seq
import Mathlib.topology.uniform_space.basic
import Mathlib.PostPort
univ... |
d75f7b92752ff230b3fc9ad01818d29d99e9f789 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/category_theory/Fintype.lean | 437e171a4c9bcd9a7b08b4077b435ba5b8ed4292 | [
"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 | 4,304 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Adam Topaz
-/
import data.fintype.basic
import data.fin.basic
import category_theory.concrete_category.bundled
import category_theory.concrete_category
import category_theor... |
32e6c6e180de6240bb10cf549aa79af98e023d4a | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/logic/embedding.lean | ceb1442030beb51296089a7837bf9e8855c3fb1d | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,772 | 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, Mario Carneiro
-/
import data.equiv.basic
import data.sigma.basic
import algebra.group.defs
/-!
# Injective functions
-/
universes u v w x
namespace function
/-- `α... |
f1383d9dc8f9c16ec33a8925110d67ae7c3581fd | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/unification_hints.lean | 968d0a057dc7be42f265a6eb3a08f0aac370f852 | [
"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 | 990 | lean | open list nat
namespace toy
constants (A : Type.{1}) (f h : A → A) (x y z : A)
attribute [irreducible]
noncomputable definition g (x y : A) : A := f z
@[unify]
noncomputable definition toy_hint (x y : A) : unification_hint :=
{ pattern := g x y ≟ f z,
constraints := [] }
open tactic
set_option trace.type_cont... |
058a84ce774746e03351db4e35be0c6a11ff8da8 | 37a833c924892ee3ecb911484775a6d6ebb8984d | /src/category_theory/small.lean | c9536b78c4bf6d3299c7a5b60de70e7d571a0e01 | [] | no_license | silky/lean-category-theory | 28126e80564a1f99e9c322d86b3f7d750da0afa1 | 0f029a2364975f56ac727d31d867a18c95c22fd8 | refs/heads/master | 1,589,555,811,646 | 1,554,673,665,000 | 1,554,673,665,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 740 | lean | /- Categories which are small relative to a cardinal κ.
κ-filtered categories.
Normally we care about these concepts for categories which are
used to index (co)limits, so we work with small_categories. -/
import category_theory.category
import category_theory.functor
import category_theory.limits.cones
import... |
2867e422cf47c6cd2d94237e229a9fa0a3eeed8e | 367134ba5a65885e863bdc4507601606690974c1 | /src/linear_algebra/char_poly/coeff.lean | 0a43c46648814562dc1ce130a065914383e05dd4 | [
"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 | 8,992 | lean | /-
Copyright (c) 2020 Aaron Anderson, Jalex Stark. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Aaron Anderson, Jalex Stark.
-/
import data.matrix.char_p
import linear_algebra.char_poly.basic
import linear_algebra.matrix
import ring_theory.polynomial.basic
import alg... |
22bfe62c0fb1470037087df78bd51374fedd0d67 | 36938939954e91f23dec66a02728db08a7acfcf9 | /lean4/deps/galois_stdlib/src/Galois/Init/Io.lean | b9b8b8ada53c58a19092e930bc79cfffe9483a25 | [] | 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 | 1,445 | lean |
/- Low-level API doing file IO -/
namespace Galois
/- c.f. Prim.Fs.handle in library/init/io.lean -/
inductive Fs.Mode
| read | write | readWrite | append
inductive Fs.Whence
| set | cur | seek_end | hole | data
constant Fs.handle : Type := Unit
namespace IO
namespace Prim
open Fs
@[extern 4 "galois_io_prim_ha... |
429c5c127f79b56181c78a339b80b29c1c168b4a | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/testing/slim_check/gen.lean | 21d5c68e8d04289ffa6f9c3785a6993821308615 | [
"Apache-2.0"
] | permissive | dexmagic/mathlib | ff48eefc56e2412429b31d4fddd41a976eb287ce | 7a5d15a955a92a90e1d398b2281916b9c41270b2 | refs/heads/master | 1,693,481,322,046 | 1,633,360,193,000 | 1,633,360,193,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,715 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import control.uliftable
import system.random
import system.random.basic
/-!
# `gen` Monad
This monad is used to formulate randomized computations with a parameter
to sp... |
e86c7c1a198eb24a0980d2c3f6b1bc41cb6af433 | 367134ba5a65885e863bdc4507601606690974c1 | /src/linear_algebra/basis.lean | cbea01ccea537b5cc6707f574fd6823390a223db | [
"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 | 21,639 | 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, Mario Carneiro, Alexander Bentkamp
-/
import linear_algebra.linear_independent
import linear_algebra.projection
import linear_algebra.linear_pmap
import data.fintype.ca... |
8c3e876c166a3103d5163d4ed9e144316386912d | 77b92c2594ee6c8822c41bc409f414deb757b28b | /src/week04.lean | 669091ace63c76e3cb47127d4ca9f4259769ae6e | [] | no_license | UVM-M52/week04-fgdorais | 93165eda8d65b0f726025317bfdb9520a2cc062c | 92271a8cd22a3654b1a2833dfa86a8de21e0d2d3 | refs/heads/master | 1,609,158,415,360 | 1,580,860,763,000 | 1,580,860,763,000 | 238,332,133 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,276 | lean | -- Math 52: Week 4
import .utils.int_refl
-- Lakins Definition 1.2.1:
definition is_even (n : ℤ) := ∃ (k : ℤ), n = 2 * k
definition is_odd (n : ℤ) := ∃ (k : ℤ), n = 2 * k + 1
-- Lakins Definition 2.1.1: Let a, b ∈ Z.
-- a divides b if there exists n ∈ ℤ such that b = an.
-- We write a ∣ b for "a divides b" and say t... |
50a019333ee71bebb731e86aab550aaeb168344c | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/compiler/phashmap3.lean | 481b7b0944664f69ddcd57fd52c0459a502419a7 | [
"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 | 1,830 | lean | import Std.Data.PersistentHashMap
import Lean.Data.Format
open Lean Std Std.PersistentHashMap
abbrev Map := PersistentHashMap Nat Nat
partial def formatMap : Node Nat Nat → Format
| Node.collision keys vals _ => Format.sbracket $
keys.size.fold
(fun i fmt =>
let k := keys.get! i;
let v := vals.get... |
68d5dbff3913b49449140315cda79eff6b056bda | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1426.lean | 0fda8ca1efa5a26ec158c4a5df8975e400b96067 | [
"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 | 365 | lean | theorem ex1 : a * 2 = 2 * a := by
have h : ∀ (a b : Nat), a * b = a * b := by
intros; rfl
conv at h =>
intro a b; lhs; rw [Nat.mul_comm]
exact h 2 a
#print ex1
theorem ex2 : a * 2 = 2 * a := by
have h : (fun x y => x * y) = Nat.mul := by
rfl
conv at h =>
lhs; intro x y; rw [Nat.mul_comm]
e... |
34880f432709f21966dc94d73865f09cbdf471cc | 522405df6e2c9cbc59a292c30fe49b32bc7f2781 | /src/hahn.lean | b9315dfd2f20b09b9bedf37bfe9cf6a3348e0ac2 | [] | no_license | Ruben-VandeVelde/premathlib | 539735aa9ac073cd62f979bdbe61ea8056d282d2 | c126ad6fdbd04a225e4e4f76520ce711846cca23 | refs/heads/master | 1,662,351,323,440 | 1,590,959,549,000 | 1,590,959,549,000 | 267,713,324 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,132 | lean | import analysis.complex.basic
import analysis.normed_space.operator_norm
import analysis.normed_space.hahn_banach
import .extend
open complex
variables {F : Type*} [normed_group F] [normed_space ℂ F]
noncomputable def restrict_scalars (p: subspace ℂ F) : subspace ℝ F := p.restrict_scalars ℝ
private lemma apply_real... |
3040d6025877e92b7a6b629760e2ba33c46e461d | f9a7d3a53167ab6bc77459dc7157a73c60f8aa5c | /grid.lean | 9eb5a27a95f245d9c6cd4228fcdec3744eacb477 | [] | no_license | Leangrids/grids | 4ab67d0eaade70992ecf8eeea497ccaecfef881e | 7ccc15b3051465c9cceedfbc57a3e06ddb1c8209 | refs/heads/master | 1,585,185,592,980 | 1,533,970,440,000 | 1,533,970,440,000 | 144,362,506 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 31,823 | lean | import utils
import data.vector data.list
open utils
section grids
class relative_grid (α : Type*) :=
(carrier : Type)
(rows : α → ℕ)
(cols : α → ℕ)
(unempty : Πg, rows g * cols g > 0)
(data : Πg, bounded 0 (rows g) → bounded 0 (cols g) → carrier)
class grid (α : Type*) extends rela... |
1a38dea13e1b0cc1df1e2ac0e640011e6b238100 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/game_add.lean | 443a2df46ee4530c4cb42556cf7250ca9b6fdbb3 | [
"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 | 9,582 | lean | /-
Copyright (c) 2022 Junyan Xu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Junyan Xu
-/
import data.sym.sym2
import logic.relation
/-!
# Game addition relation
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to ma... |
7d368eebfca72a20852b7893b74e33fd0c20bb44 | 86d328c7fd9114507f3e8380e2b3d2f83ef6c647 | /lambda/types.lean | 4a4e6fe5f13726c4158d83694b92e955c7186b4f | [] | no_license | forked-from-1kasper/lambda | 05ada15e7abdaa5f453bfe3792c086f04f363f76 | 696363514f3730951a90e86474940135a2339c0b | refs/heads/master | 1,623,388,766,920 | 1,607,249,080,000 | 1,607,249,080,000 | 128,524,636 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 2,104 | lean | namespace types
inductive term : Type
| var : string → term
| app : term → term → term
| lam : string → term → term
open term
def multi_lam (names : list string) (body : term) : term :=
list.foldr lam body names
def multi_app (t : term) (b : list term) : term :=
list.foldl app t b
def term_to_string : term → string... |
669ac9aae1876f3e5d1d8c59f7797391d608ee20 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/lint/default.lean | a3669a5862a11a72c4fcab9d40da713f35602358 | [
"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 | 4,348 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Robert Y. Lewis, Gabriel Ebner
-/
import tactic.lint.frontend
import tactic.lint.simp
import tactic.lint.type_classes
import tactic.lint.misc
open tactic
add_tact... |
6f9b52fd164b54ebafea639727ef89dc97ac1ff5 | 13133fade54057ee588bc056e4eaa14a24773d23 | /report/fibonacci_succ.lean | 427ebf855267e5df788139c4a82e20482ee271bc | [] | no_license | lkloh/lean-project-15815 | 444cbdca1d1a2dfa258c76c41a6ff846392e13d1 | 2cb657c0e41baa318193f7dce85974ff37d80883 | refs/heads/master | 1,611,402,038,933 | 1,432,020,760,000 | 1,432,020,760,000 | 33,372,120 | 0 | 0 | null | 1,431,932,928,000 | 1,428,078,840,000 | Lean | UTF-8 | Lean | false | false | 2,816 | lean | import data.nat
open nat
-- source: the official tutorial for lean
definition fib : nat → nat
| fib 0 := 0
| fib (succ 0) := 1
| fib (succ (succ n)) := fib n + fib (succ n)
eval fib(5)
-- ****************************************************************** --
-- 0 <= fib(n)
theorem fib_pos : ∀ n, 0 ≤ fib n,... |
bdc2acfd8d3d6100a1414ebd8663f6b21456f2e8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/logic/pairwise.lean | 4835ef323ddfcc6d65acace90d69edf19c9f13f7 | [
"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 | 2,632 | 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
-/
import logic.function.basic
import tactic.basic
/-!
# Relations holding pairwise
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a cor... |
d404f9d14edc3655a2a8088a7c682de6201e3635 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/geometry/manifold/algebra/left_invariant_derivation.lean | d25e5845f7cd4973ee7cffd80644ad248c908753 | [
"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 | 8,749 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import geometry.manifold.derivation_bundle
/-!
# Left invariant derivations
In this file we define the concept of left invariant derivation for a Lie group. The... |
a117aabb0bf2c09ca551f957b32a0c3f5fea2ea4 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/group_theory/submonoid/center.lean | b14fc116cda81becbb3a03a786e32b2fca229707 | [
"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 | 4,480 | 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
/-!
# Centers of magmas and monoids
## Main definitions
* `set.center`: the center of a magma
* `submonoid.center`: the center o... |
026e89586c05770c768aae3d86af940146c67757 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/algebra/module/submodule/pointwise.lean | 3fba1a558e6584a37cbac3f3ef62d7f9b2549a1a | [
"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 | 7,354 | 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.subgroup.pointwise
import linear_algebra.span
/-! # Pointwise instances on `submodule`s
This file provides:
* `submodule.has_pointwise_neg`
and the ... |
6fa810094efe9c4f6c0755f32594871b9f3ea0f9 | 46125763b4dbf50619e8846a1371029346f4c3db | /src/category_theory/limits/shapes/zero.lean | 85c77410a3db30bb2905fc9a45152ca0a5a3ef37 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 3,913 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.limits.shapes.terminal
/-!
# Zero morphisms and zero objects
A category "has zero morphisms" if there is a designated "zero morphism" in each... |
62fc83bbafc51fa6ef4b6e857dccfd7dbcfe96d5 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /src/Lean/Data/JsonRpc.lean | 45b61ea434b57b309f34a1dfc7cca92c43594444 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,232 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Init.Control
import Init.System.IO
import Std.Data.RBTree
import Lean.Data.Json
/-! Implementation of JSON-RPC 2.0 (https://www.jsonrpc.org/... |
b4c6a58436c7bffe0c2392d011c586c17aa92696 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/order/partial_sups.lean | fa4a0a5b400b3f0d71ace76c7af6277cf583d8a5 | [
"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,744 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.finset.lattice
import order.hom.basic
/-!
# The monotone sequence of partial supremums of a sequence
We define `partial_sups : (ℕ → α) → ℕ →o α` inducti... |
59ab21a4bc4e83a82a346e42aeb80a4b5b38f728 | bd12a817ba941113eb7fdb7ddf0979d9ed9386a0 | /src/order/filter/basic.lean | ba5975f3a605d49acc0868382d2d76357510adf3 | [
"Apache-2.0"
] | permissive | flypitch/mathlib | 563d9c3356c2885eb6cefaa704d8d86b89b74b15 | 70cd00bc20ad304f2ac0886b2291b44261787607 | refs/heads/master | 1,590,167,818,658 | 1,557,762,121,000 | 1,557,762,121,000 | 186,450,076 | 0 | 0 | Apache-2.0 | 1,557,762,289,000 | 1,557,762,288,000 | null | UTF-8 | Lean | false | false | 82,064 | 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, Jeremy Avigad
Theory of filters on sets.
-/
import order.galois_connection order.zorn
import data.set.finite data.list data.pfun
import algebra.pi_instances
import cat... |
aaf125deb237851c0f7feccc3689fbc4d19d13ad | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed_space/matrix_exponential.lean | 1a1aea1e5afa50d2bbc18f15c5f3604f11576839 | [
"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 | 9,062 | lean | /-
Copyright (c) 2022 Eric Wieser. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Eric Wieser
-/
import analysis.normed_space.exponential
import analysis.matrix
import linear_algebra.matrix.zpow
import topology.uniform_space.matrix
/-!
# Lemmas about the matrix expon... |
ff7c3571ccf4ceb542bb2de1cb6c030ff17911b2 | d4df7c538bbc0b06771d7b7a6f46fbadebb8c5eb | /src/comonad_transformers/env_t.lean | 77b6b93539246ad5f53a353babe2f4ee6482df1b | [] | no_license | breakerzirconia/LeanTransformers | 11bb924b59ac589d0c6b39586d27cccc8f9e939c | 3c52441b8990bab7d8cf1817df6e04f657a14e1c | refs/heads/main | 1,682,610,526,027 | 1,620,477,129,000 | 1,620,477,129,000 | 365,507,838 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,010 | lean | import comonad_transformers.comonad
import comonad_transformers.comonad_trans
----------------------------
-- Definition + instances --
----------------------------
structure EnvT (e : Type) (w : Type → Type) (a : Type) := (env : e) (val : w a)
open EnvT
instance {e : Type} {w : Type → Type} [functor w] : functor (... |
4d286082d2831b654f09404681fa96c1d69511ac | b7f22e51856f4989b970961f794f1c435f9b8f78 | /library/theories/topology/continuous.lean | b4966213784f70a63079226b74bdf973415e8cd1 | [
"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 | 14,363 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jacob Gross, Jeremy Avigad
Continuous functions.
-/
import theories.topology.basic algebra.category ..move .limit
open algebra eq.ops set topology function category sigma.ops
namespac... |
1257afb1e5f1357fdaa63df5f61eff8aea72d5d4 | 02fbe05a45fda5abde7583464416db4366eedfbf | /library/init/meta/tactic.lean | 1b84109e93f62aa6b90e4f0f9ebce5f75334e129 | [
"Apache-2.0"
] | permissive | jasonrute/lean | cc12807e11f9ac6b01b8951a8bfb9c2eb35a0154 | 4be962c167ca442a0ec5e84472d7ff9f5302788f | refs/heads/master | 1,672,036,664,637 | 1,601,642,826,000 | 1,601,642,826,000 | 260,777,966 | 0 | 0 | Apache-2.0 | 1,588,454,819,000 | 1,588,454,818,000 | null | UTF-8 | Lean | false | false | 74,709 | 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.function init.data.option.basic init.util
import init.control.combinators init.control.monad init.control.alternative init.control.monad... |
0edc99e189842691339fb75126e3bfe30221b3b7 | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world8/level1.lean | 87d3829d0beac1555285e53efef439cb00da31da | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 1,823 | lean | import mynat.definition -- hide
import mynat.add -- hide
import game.world2.level6 -- hide
namespace mynat -- hide
/- Axiom : succ_inj {a b : mynat} :
succ(a) = succ(b) → a = b
-/
/-
# Advanced Addition World
## Level 1: `succ_inj`. A function.
Peano's original collection of axioms for the natural numbers contai... |
c777b0d26b5cfb2a1e13b2c7f85cf4b6a8c89622 | 13133fade54057ee588bc056e4eaa14a24773d23 | /Definitions/fibonacci_def.lean | bc7d24c6a91c6fea26a4dacb1799c937267cc33a | [] | no_license | lkloh/lean-project-15815 | 444cbdca1d1a2dfa258c76c41a6ff846392e13d1 | 2cb657c0e41baa318193f7dce85974ff37d80883 | refs/heads/master | 1,611,402,038,933 | 1,432,020,760,000 | 1,432,020,760,000 | 33,372,120 | 0 | 0 | null | 1,431,932,928,000 | 1,428,078,840,000 | Lean | UTF-8 | Lean | false | false | 714 | lean | import data.nat
open nat
-- source: the official tutorial for lean
definition fib : nat → nat
| fib 0 := 1
| fib 1 := 1
| fib (a+2) := fib (a+1) + fib a
-- The defining equations hold definitionally
example : fib 0 = 1 :=
rfl
example : fib 1 = 1 :=
rfl
example (a : nat) : fib (a+2) = fib (a+1) + fib a :=
... |
54e49c43a9c238366092903c66ff2b583deed2f5 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/simp_except.lean | c53f70dbbcf51578e4a91a8ac7350b3701e49717 | [
"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 | 848 | lean | constant f : nat → nat
namespace foo
axiom fax : ∀ x, f x = x
end foo
attribute [simp] foo.fax
example (a : nat) : f a = a :=
by simp -- works
example (a : nat) : f a = a :=
by simp [-fax] -- Error: unknown identifier 'fax'
example (a : nat) : f a = a :=
by simp [-foo.fax] -- Error: simplify failed to simplify
se... |
97e5952397fa0594360170fa01b5ecf19c799312 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/ring_theory/subring_auto.lean | a0f70ed496a31144cefcf3bcf183226b89bd596f | [] | 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 | 32,682 | lean | /-
Copyright (c) 2020 Ashvni Narayanan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors : Ashvni Narayanan
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.deprecated.subring
import Mathlib.group_theory.subgroup
import Mathlib.ring_theory.sub... |
60d6c27342da7833eb2a9d904b21200501f46681 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /09_Type_Classes.org.17.lean | c170a9855fe653304d6969971afb2b06b192447c | [] | no_license | cjmazey/lean-tutorial | ba559a49f82aa6c5848b9bf17b7389bf7f4ba645 | 381f61c9fcac56d01d959ae0fa6e376f2c4e3b34 | refs/heads/master | 1,610,286,098,832 | 1,447,124,923,000 | 1,447,124,923,000 | 43,082,433 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 214 | lean | import standard
import standard
inductive has_add [class] (A : Type) : Type :=
mk : (A → A → A) → has_add A
definition add {A : Type} [s : has_add A] :=
has_add.rec (λ x, x) s
notation a `+` b := add a b
|
9ec398b8d5946a58fa7c4e3b621c2219b9a7bfd5 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/measure_theory/group/measurable_equiv.lean | 1b508cc59c573143ed84bedd91ef213ab40ba48c | [
"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 | 7,588 | 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
-/
import measure_theory.group.arithmetic
/-!
# (Scalar) multiplication and (vector) addition as measurable equivalences
In this file we define the following m... |
acd0917c1c6c7376bd197181c2436062059c005d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/mk_slim_check_test.lean | a34cebdf0f34afa8d389d5da6778f291e701e6db | [
"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 | 494 | lean | import tactic.slim_check
section
open tactic
@[interactive]
meta def mk_slim_check_test : tactic unit := do
tgt ← target,
msg ← (λ s, match interactive.slim_check { random_seed := some 257 } s with
| result.success x _ := fail "expecting error" s
| result.exception msg _ _ := result.success (msg.iget ()).... |
aaa6d031a0ddd18b31aa422eb0e375dd1406d122 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/model_theory/substructures.lean | 8228ffe11dfbfd7211848b7606c4523bc0ab5211 | [
"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 | 29,578 | lean | /-
Copyright (c) 2021 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import order.closure
import model_theory.semantics
import model_theory.encoding
/-!
# First-Order Substructures
This file defines substructures of first-order struc... |
ac77badc5b3d2414f24e50936fecd28a6d96e5ca | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/omit.lean | db426fa19283e5e1a9316b9140830ca1d50f2b1b | [
"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 | 293 | lean | prelude section
variable A : Type
variable a : A
variable c : A
omit A
include A
include A
omit A
variable B : Type
variable b : B
variable d : B
include A
include a
include c
definition foo := b
inductive tst (C : Type) :=
mk : tst C
end
check foo
check tst
|
df593a541bc92b3bcf4f3791450285adfc1d699a | e967488e2008f07b0aa7b6b18d4398d02c7460e2 | /src/game/sup_inf/02temp.lean | febff3b72c273c4d1b422c1de267b1d0df08bc4c | [] | no_license | thyrgle/real-number-game | 5c53eefaa815051f3d70ca5782e41d2adb76fd6e | a420eecef62209b729c910c2170d1dd27b74bc9f | refs/heads/master | 1,606,405,407,612 | 1,574,956,743,000 | 1,574,956,743,000 | 229,126,103 | 0 | 0 | null | 1,576,784,273,000 | 1,576,784,272,000 | null | UTF-8 | Lean | false | false | 1,543 | lean | import data.real.basic -- imports the real numbers ℝ
namespace xena -- hide
-- World name : Sup and Inf
/-
# Chapter 1 : Sup and Inf
# Level 1 : Introduction to sets of reals.
Let $X$ be a set of real numbers.
We say a real number $b$ is an *upper bound* for $X$ if every $x\in X$ is at most $b$.
-/
def is_upper_bo... |
35ce60704709451ae7a5ab191acd70f58bf05505 | 4727251e0cd73359b15b664c3170e5d754078599 | /test/lint_coe_t.lean | 49c51e08fb61bea92143e1a8d2c043a2e4dc46ad | [
"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 | 1,081 | lean | import tactic.lint
open tactic
-- bad, because every iteration of tc search will loop, generating nested quotients
section
local attribute [instance]
def a_to_quot {α} (R : setoid α) : has_coe α (quotient R) := ⟨quotient.mk⟩
run_cmd do
d ← get_decl ``a_to_quot,
some _ ← linter.has_coe_variable.test d,
d ← get_d... |
7ebd7303225ad0476bb189aaf517e83684cc4d39 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/support.lean | fa9525752543c439751475d86bbf35d51c3fb407 | [
"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 | 10,734 | 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 order.conditionally_complete_lattice
import algebra.big_operators.basic
import algebra.group.prod
import algebra.group.pi
import algebra.module.pi
/-!
# Sup... |
2fd624901e028d1c888e0ad8d36e0adfa61ec12d | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/analysis/normed_space/bounded_linear_maps.lean | c3952efd434ddb23a7cb7d786ae967d816c151a1 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 22,049 | 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 analysis.normed_space.multilinear
/-!
# Continuous linear maps
This file defines a class stating that a map between normed vector spaces is (... |
99592485be878cc9621b2f91e280a584622b0034 | 07c76fbd96ea1786cc6392fa834be62643cea420 | /hott/prop_trunc.hlean | a470d4d59205f6b3c6da5f549e0465880e7537be | [
"Apache-2.0"
] | permissive | fpvandoorn/lean2 | 5a430a153b570bf70dc8526d06f18fc000a60ad9 | 0889cf65b7b3cebfb8831b8731d89c2453dd1e9f | refs/heads/master | 1,592,036,508,364 | 1,545,093,958,000 | 1,545,093,958,000 | 75,436,854 | 0 | 0 | null | 1,480,718,780,000 | 1,480,718,780,000 | null | UTF-8 | Lean | false | false | 1,869 | hlean | /-
Copyright (c) 2015 Jakob von Raumer. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jakob von Raumer, Floris van Doorn
Proof of the theorem that (is_trunc n A) is a mere proposition
We prove this here to avoid circular dependency of files
We want to use this in .eq... |
350df7a3949cbe1c007223734692523c8d81e8cf | e4d500be102d7cc2cf7c341f360db71d9125c19b | /src/data/nat/cast.lean | 70ddfbd739b826f76de48da70878b897194e9c46 | [
"Apache-2.0"
] | permissive | mgrabovsky/mathlib | 3cbc6c54dab5f277f0abf4195a1b0e6e39b9971f | e397b4c1266ee241e9412e17b1dd8724f56fba09 | refs/heads/master | 1,664,687,987,155 | 1,591,255,329,000 | 1,591,255,329,000 | 269,361,264 | 0 | 0 | Apache-2.0 | 1,591,275,784,000 | 1,591,275,783,000 | null | UTF-8 | Lean | false | false | 8,555 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Natural homomorphism from the natural numbers into a monoid with one.
-/
import algebra.ordered_field
import data.nat.basic
namespace nat
variables {α : Type*}
sectio... |
970bfd74ca1dbaad8d83419c88ffa36ab1165cc0 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/algebra/char_zero.lean | b4272aec60632947dc65cd92d42d2e418ef499d8 | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 3,187 | lean | /-
Copyright (c) 2014 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
Natural homomorphism from the natural numbers into a monoid with one.
-/
import data.nat.cast algebra.group algebra.field
/-- Typeclass for monoids with characteristic... |
1ba056c7d6ffd899ab583ad32a25bad15204f5c1 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/analysis/normed/group/SemiNormedGroup.lean | cb87e2c2ba58f99af16515e0c557607d173bc6b8 | [
"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 | 6,891 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Riccardo Brasca
-/
import analysis.normed.group.hom
import category_theory.limits.shapes.zero_morphisms
import category_theory.concrete_category.bundled_hom
import cate... |
be45d6847710fbdf279946bd0a1ecf56f28d7474 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/Tactic/Conv/Delta.lean | 55b0a5e9d76e8caeb7768b24dfceeb918781cd37 | [
"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 | 584 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Lean.Elab.Tactic.Delta
import Lean.Elab.Tactic.Conv.Basic
namespace Lean.Elab.Tactic.Conv
open Meta
@[builtin_tactic Lean.Parser.Tactic.Conv.delta]... |
0839585523e09dc7053f98bf5ee713229b48bffc | dd4e652c749fea9ac77e404005cb3470e5f75469 | /src/alex_playground/uncurr.lean | 70fdeaf3530a42c3daf380f51de096597cb98248 | [] | no_license | skbaek/cvx | e32822ad5943541539966a37dee162b0a5495f55 | c50c790c9116f9fac8dfe742903a62bdd7292c15 | refs/heads/master | 1,623,803,010,339 | 1,618,058,958,000 | 1,618,058,958,000 | 176,293,135 | 3 | 2 | null | null | null | null | UTF-8 | Lean | false | false | 1,399 | lean | import data.real.basic
import tactic.interactive
import order.liminf_limsup
-- copied from current mathlib
section uncurry
variables {α β γ δ : Type*}
/-- Records a way to turn an element of `α` into a function from `β` to `γ`. The most generic use
is to recursively uncurry. For instance `f : α → β → γ → δ` will be... |
63c098e3c7866aee1ef6aaa31cf346cdcf182ea0 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/limits/shapes/regular_mono.lean | 5713672ddc2bcb0852f54fc24f3487edf56b2ea3 | [
"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,076 | 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.shapes.pullbacks
import category_theory.limits.shapes.strong_epi
import category_theory.limits.shapes.equalizers
/-!
# De... |
155276d603674e77cba1699bb2866e5f0e46f079 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/interactive/simple3.lean | 0168fee1a9315f7342aa7c87b7ec427657d05ba6 | [
"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 | 189 | lean | import logic
namespace tst
definition foo {A B : Type} (a : A) (b : B) := a
definition boo {A : Type} (a : A) := foo a a
end tst
theorem tst {A : Type} (a b : A) : tst.foo a b = a :=
rfl
|
421f8f79043798eb3b21a23a7d69c0558f81c2d7 | 76ce87faa6bc3c2aa9af5962009e01e04f2a074a | /HW/HW4.lean | 77395a781a11cdc1052fc112af2729f3db0e7a76 | [] | no_license | Mnormansell/Discrete-Notes | db423dd9206bbe7080aecb84b4c2d275b758af97 | 61f13b98be590269fc4822be7b47924a6ddc1261 | refs/heads/master | 1,585,412,435,424 | 1,540,919,483,000 | 1,540,919,483,000 | 148,684,638 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,964 | lean |
/-
THIS ASSIGNMENT IS DUE BEFORE NEXT CLASS.
WE WILL THEN REVIEW IT IN CLASS. FOLLOWING
THAT REVIEW WE WILL GIVE A BRIEF IN-CLASS,
GRADED EXERCISE TO TEST YOUR UNDERSTANDING.
This file comes in two parts. The first
part presents an example that you are to
read and understand. It's an example of
a proof of a bi-impli... |
51400210745e407d716d87b306d60fae4c99cc88 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/matrix/char_p.lean | 85e4b06549949306f7aa62c586f53dc4c982fdca | [
"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 | 697 | lean | /-
Copyright (c) 2020 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import data.matrix.basic
import algebra.char_p.basic
/-!
# Matrices in prime characteristic
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file req... |
d18aa01594c46559acb8c376b540dac8825ff0a8 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/deprecated/group.lean | 92263d10de9abe5cbb160cb2c73ca8fd0f1bd536 | [
"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 | 13,641 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import algebra.group.type_tags
import algebra.group.units_hom
import algebra.ring.basic
import data.equiv.mul_add
/-!
# Unbundled monoid and group homomorphisms (d... |
8569386b37150a758b3ce2e938d4bcfb480abcb7 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/order/rel_iso.lean | 7e41a4dfa95bdc4b8104a0178833299982aac105 | [
"Apache-2.0"
] | permissive | molodiuc/mathlib | cae2ba3ef1601c1f42ca0b625c79b061b63fef5b | 98ebe5a6739fbe254f9ee9d401882d4388f91035 | refs/heads/master | 1,674,237,127,059 | 1,606,353,533,000 | 1,606,353,533,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,917 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import logic.embedding
import order.rel_classes
import data.fin
open function
universes u v w
variables {α : Type*} {β : Type*} {γ : Type*}
{r : α → α → Prop} {s ... |
4e0c5c49d6a1503f9817a956e581ec50f0a2c4b2 | 90bd8c2a52dbaaba588bdab57b155a7ec1532de0 | /src/homotopy/tactic.lean | 348688e35786c7c140e9d587de745b92edeabf5c | [
"Apache-2.0"
] | permissive | shingtaklam1324/alg-top | fd434f1478925a232af45f18f370ee3a22811c54 | 4c88e28df6f0a329f26eab32bae023789193990e | refs/heads/master | 1,689,447,024,947 | 1,630,073,400,000 | 1,630,073,400,000 | 381,528,689 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 794 | lean | import homotopy.path
/-!
# Tactics
In this file we define some basic tactics which make constructing `path_homotopy`s easier.
-/
namespace path_homotopy.tactic
/-- Associate the left hand side of a homotopy to the left -/
meta def assocl : tactic unit := `[refine homotopy_with.trans path_homotopy.assoc _]
/-- Assoc... |
cd4006fb2bf5e24968b175fbf0c3ef405fc4bab3 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/group_theory/coset.lean | 51c2e0bbc248c0cd7e337412704c38fa9b7e38aa | [
"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 | 9,169 | 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... |
58860c16fda93c2163502e98a93765109167c25c | bf532e3e865883a676110e756f800e0ddeb465be | /data/seq/parallel.lean | da926c6ffa6efb50352388e94921adf4ee05c4b8 | [
"Apache-2.0"
] | permissive | aqjune/mathlib | da42a97d9e6670d2efaa7d2aa53ed3585dafc289 | f7977ff5a6bcf7e5c54eec908364ceb40dafc795 | refs/heads/master | 1,631,213,225,595 | 1,521,089,840,000 | 1,521,089,840,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,208 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Parallel computation of a computable sequence of computations by
a diagonal enumeration.
The important theorems of this operation are proven as
terminates_paralle... |
6d3e639c6c9c0d2ab8ac4e9acf8469f23bd871d0 | d642a6b1261b2cbe691e53561ac777b924751b63 | /src/order/filter/pointwise.lean | fbc5faeb53df26b24ee16171ae2d072de8fdab11 | [
"Apache-2.0"
] | permissive | cipher1024/mathlib | fee56b9954e969721715e45fea8bcb95f9dc03fe | d077887141000fefa5a264e30fa57520e9f03522 | refs/heads/master | 1,651,806,490,504 | 1,573,508,694,000 | 1,573,508,694,000 | 107,216,176 | 0 | 0 | Apache-2.0 | 1,647,363,136,000 | 1,508,213,014,000 | Lean | UTF-8 | Lean | false | false | 7,682 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
The pointwise operations on filters have nice properties, such as
• map m (f₁ * f₂) = map m f₁ * map m f₂
• nhds x * nhds y = nhds (x * y)
-/
import algebra.pointwi... |
f5a7f4ee1affc547df5e6c46631011905a5a7e7b | 995658a556256a6694fe5c98b91f7f6f6c11bb77 | /src/dirichlet_eta.lean | 0865e1003b228b5a3bb5eacc40757918edfbc87c | [
"MIT"
] | permissive | bhgomes/lean-riemann-hypothesis | d803047f27ea21f03414bbfb59395608ed0bc05f | c36b744a2dc4a7a50c7de770096bd9a051f42ab9 | refs/heads/master | 1,678,533,614,591 | 1,614,755,910,000 | 1,614,755,910,000 | 275,204,877 | 16 | 3 | null | null | null | null | UTF-8 | Lean | false | false | 13,906 | lean | /- ------------------------------------------------------------------------- -|
| @project: riemann_hypothesis |
| @file: dirichlet_eta.lean |
| @authors: Brandon H. Gomes, Alex Kontorovich |
... |
90263afd95a98eb2e21aa701fc3a239755d7ce97 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/linear_algebra/projection.lean | 5d6657a36b8fe3292c9760c911e4e7dc1699d321 | [
"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 | 13,656 | 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 linear_algebra.quotient
import linear_algebra.prod
/-!
# Projection to a subspace
In this file we define
* `linear_proj_of_is_compl (p q : submodule R E) (... |
a73580685c980bd30eaa5e778a1f9c5cab7233c7 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /hott/homotopy/susp.hlean | 6d27a32f3e808c4ecacb37e691daab12d4af79ee | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 7,550 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Declaration of suspension
-/
import hit.pushout types.pointed cubical.square
open pushout unit eq equiv equiv.ops
definition susp (A : Type) : Type := pushout (λ... |
cfb7fdf5978acc143727b177ad12ebab2769f127 | f5373ccdc976e6390397d9f4220a74c76f706f4a | /src/examples/parser_entry.lean | 638d208b183d4390411d6d381a8d5bece73f3710 | [] | no_license | jasonrute/lean_gym_prototype | fcd91fdc454f9e351bbe258c765f50276407547e | ab29624d14e4e069e15afe0b1d90248b5b394b86 | refs/heads/master | 1,682,628,526,780 | 1,590,539,315,000 | 1,590,539,315,000 | 264,938,525 | 3 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 795 | lean | import lean_gym.server
open lean.parser
open interactive
-- set up server
meta def json_config : json_server lean_server_request lean_server_response := {
read_write := io_streams.stdin_stdout_streams,
get_json := json_server.get_custom_json, -- use custom format since faster
put_json := json_server.put_standa... |
32da94ba9106b2a956533137827a0a64311abbaf | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/order/rel_iso.lean | f2e505a5dba56942c67c428a849227e502b7562a | [
"Apache-2.0"
] | permissive | ilitzroth/mathlib | ea647e67f1fdfd19a0f7bdc5504e8acec6180011 | 5254ef14e3465f6504306132fe3ba9cec9ffff16 | refs/heads/master | 1,680,086,661,182 | 1,617,715,647,000 | 1,617,715,647,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 31,277 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import logic.embedding
import order.rel_classes
import data.set.intervals.basic
open function
universes u v w
variables {α : Type*} {β : Type*} {γ : Type*}
{r : α... |
a36291e2bf05e1ffa8e917074edb1ecf7748922b | 6a0e083a886c678aa3899e8704b88613bb310ad0 | /src/commutative_monad.lean | a387cf6be61e09a6212a49449bd916c870c6ce15 | [] | no_license | adamtopaz/hyperalgebra-experiments | 96566821cd32eda13602a06cf5657e7805127492 | 54a0dd63d3a5c59576441671c9ad2e7ba12b9a2e | refs/heads/master | 1,686,042,050,049 | 1,625,018,844,000 | 1,625,018,844,000 | 381,545,014 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 510 | lean | import control.monad.basic
import data.set.constructions
class commutative_monad (M : Type* → Type*) [monad M] [is_lawful_monad M] :=
(commutative : Π {α β γ} (ma : M α) (mb : M β) (f : α → β → M γ),
(do { a ← ma, b ← mb, f a b }) = (do { b ← mb, a ← ma, f a b }) . obviously)
-- For regular operations
instance : co... |
5ce7d43610857b4128ca1cebd39290bdb712eb36 | 1dd482be3f611941db7801003235dc84147ec60a | /src/algebra/group.lean | 4f5acace902ac73337e67f129b448e3a91469707 | [
"Apache-2.0"
] | permissive | sanderdahmen/mathlib | 479039302bd66434bb5672c2a4cecf8d69981458 | 8f0eae75cd2d8b7a083cf935666fcce4565df076 | refs/heads/master | 1,587,491,322,775 | 1,549,672,060,000 | 1,549,672,060,000 | 169,748,224 | 0 | 0 | Apache-2.0 | 1,549,636,694,000 | 1,549,636,694,000 | null | UTF-8 | Lean | false | false | 31,103 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
Various multiplicative and additive structures.
-/
import tactic.interactive data.option.defs
section pending_1857
/- Transport multiplicative to add... |
24338526250c263986c084c8a4843dbd0ab0f4d4 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/interactive/run.lean | b640fe3399e95793ca0cb59d7494a28c5ddf3010 | [
"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 | 7,482 | lean | import Lean.Data.Lsp
import Lean.Widget
open Lean
open Lean.Lsp
open Lean.JsonRpc
namespace Client
/- Client-side types for showing interactive goals. -/
structure SubexprInfo where
subexprPos : String
diffStatus? : Option String
deriving FromJson, Repr
structure Hyp where
type : Widget.TaggedText SubexprIn... |
2236ecd89a9d8add43673d3d31affea025641a9f | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/instructor/lectures/lecture_5.lean | 8d85ec164a16afee88bbd4c48436785704810322 | [] | no_license | jakekauff/CS2120F21 | 4f009adeb4ce4a148442b562196d66cc6c04530c | e69529ec6f5d47a554291c4241a3d8ec4fe8f5ad | refs/heads/main | 1,693,841,880,030 | 1,637,604,848,000 | 1,637,604,848,000 | 399,946,698 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,509 | lean | /-
INTRODUCTION and ELIMINATION RULES
-/
/-
For ∀ x, P x (every x has property P)
- introduction rule: assume arbitrary x, then show P x
- elimination rule: *apply* a proof of ∀ x, P x, as a
kind of function to a specific value of x, say k, to
produce a proof of P k.
-/
/-
Now we need a short detour, so as ... |
c40ef8b50e8a924efe84389c6452a25ab4116c27 | 592ee40978ac7604005a4e0d35bbc4b467389241 | /Library/generated/mathscheme-lean/RingoidWithAddAntiDistrib.lean | 03a4b80f8160c8f18c6d31f0a2c510894ca90674 | [] | no_license | ysharoda/Deriving-Definitions | 3e149e6641fae440badd35ac110a0bd705a49ad2 | dfecb27572022de3d4aa702cae8db19957523a59 | refs/heads/master | 1,679,127,857,700 | 1,615,939,007,000 | 1,615,939,007,000 | 229,785,731 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,905 | lean | import init.data.nat.basic
import init.data.fin.basic
import data.vector
import .Prelude
open Staged
open nat
open fin
open vector
section RingoidWithAddAntiDistrib
structure RingoidWithAddAntiDistrib (A : Type) : Type :=
(plus : (A → (A → A)))
(prim : (A → A))
(antidis_prim_plus : (∀ {x y :... |
69a672c9a8166155d820ab0407940f0f9116f50c | 626e312b5c1cb2d88fca108f5933076012633192 | /src/data/option/basic.lean | 81e50356db688fb3373b2ba7b5e7570a3575b3b6 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,165 | lean | /-
Copyright (c) 2017 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.basic
import logic.is_empty
/-!
# Option of a type
This file develops the basic theory of option types.
If `α` is a type, then `option α` can be unde... |
2bd1b032d6a5cff6b9a79472fc2ad705002cb905 | 9dd3f3912f7321eb58ee9aa8f21778ad6221f87c | /tests/lean/run/basic.lean | 63c25112ae4e37da7e9379bf89f60a7e8ba9eddc | [
"Apache-2.0"
] | permissive | bre7k30/lean | de893411bcfa7b3c5572e61b9e1c52951b310aa4 | 5a924699d076dab1bd5af23a8f910b433e598d7a | refs/heads/master | 1,610,900,145,817 | 1,488,006,845,000 | 1,488,006,845,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,793 | lean | prelude
constant {l1 l2} A : Type l1 → Type l2
check A
definition {l} tst (A : Type*) (B : Type*) (C : Type l) : Type* := A → B → C
check tst
constant {l} group : Type (l+1)
constant {l} carrier : group.{l} → Type l
noncomputable definition to_carrier (g : group) := carrier g
check to_carrier.{1}
section
variable ... |
bab149057916bf63b08eab85811070bb8e785ab5 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/nestedrec.lean | 0f7f1b500c20f1e259ce1d653aca5b5510695d29 | [
"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 | 261 | lean |
def f : Nat → Nat → Nat
| 0, b => b+1
| a+1, b => f a (f a b)
theorem ex1 (b) : f 0 b = b+1 := rfl
theorem ex2 (b) : f 1 b = (b+1)+1 := rfl
theorem ex3 (b) : f 2 b = b+1+1+1+1 := rfl
theorem ex4 (a b) : f (a+1) b = f a (f a b) := rfl
#eval f 2 5
|
672b846aeab8fcdbce485f8e002293bac06cece5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/char_p/pi_auto.lean | f987ed9c6e7f43a0855ce9e40aab68e1c09d7975 | [] | 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 | 742 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.char_p.basic
import Mathlib.algebra.ring.pi
import Mathlib.PostPort
universes u v
namespac... |
04f8c494dfea832398db0b5a612382e7e2a5229c | 41ebf3cb010344adfa84907b3304db00e02db0a6 | /uexp/src/uexp/rules/transitiveInferenceConstantEquiPredicate.lean | 79a82b647c59a0e8468ac83ceaaa566e839996f3 | [
"BSD-2-Clause"
] | permissive | ReinierKoops/Cosette | e061b2ba58b26f4eddf4cd052dcf7abd16dfe8fb | eb8dadd06ee05fe7b6b99de431dd7c4faef5cb29 | refs/heads/master | 1,686,483,953,198 | 1,624,293,498,000 | 1,624,293,498,000 | 378,997,885 | 0 | 0 | BSD-2-Clause | 1,624,293,485,000 | 1,624,293,484,000 | null | UTF-8 | Lean | false | false | 1,908 | lean | import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..meta.ucongr
import ..meta.TDP
set_option profiler true
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
variable integer_1: const datatypes.int
theorem rule:
forall ( Γ scm_t scm_account scm_bonus s... |
d72edfad81372da1e4c97765cab93a342411d163 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/tactic/where.lean | ab9b7086603d56f032330ba12977042fa73b23f1 | [
"Apache-2.0"
] | permissive | fpvandoorn/mathlib | b21ab4068db079cbb8590b58fda9cc4bc1f35df4 | b3433a51ea8bc07c4159c1073838fc0ee9b8f227 | refs/heads/master | 1,624,791,089,608 | 1,556,715,231,000 | 1,556,715,231,000 | 165,722,980 | 5 | 0 | Apache-2.0 | 1,552,657,455,000 | 1,547,494,646,000 | Lean | UTF-8 | Lean | false | false | 7,504 | lean | import data.list.defs tactic.basic
open lean.parser tactic
namespace where
meta def mk_flag (let_var : option name := none) : lean.parser (name × ℕ) :=
do n ← mk_user_fresh_name,
emit_code_here $ match let_var with
| none := sformat!"def {n} := ()"
| some v := sformat!"def {n} := let {v} := {v} in ()"
... |
78380df0c554079e32b1ffd6f47dc3377bf7661b | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /tests/lean/run/860.lean | f19f89173fbf9a0e4b38635794f8ffb387dec407 | [
"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 | 996 | lean | def evenq (n: Nat) : Bool := Nat.mod n 2 = 0
private theorem pack_loop_terminates : (n : Nat) → n / 2 < n.succ
| 0 => by decide
| 1 => by decide
| n+2 => by
rw [Nat.div_eq]
split
· rw [Nat.add_sub_self_right]
have := pack_loop_terminates n
calc n/2 + 1 < Nat.succ n + 1 := Nat.add_le... |
76d10b07ec6c4c1d116d00be1b0a3f4f3687b068 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/measure_theory/function/conditional_expectation.lean | 88fc746125b3990650285f0a7fcb57e8e2a335e3 | [
"Apache-2.0"
] | permissive | troyjlee/mathlib | e18d4b8026e32062ab9e89bc3b003a5d1cfec3f5 | 45e7eb8447555247246e3fe91c87066506c14875 | refs/heads/master | 1,689,248,035,046 | 1,629,470,528,000 | 1,629,470,528,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,572 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import measure_theory.function.l2_space
/-! # Conditional expectation
The conditional expectation will be defined for functions in `L²` by an orthogonal projection int... |
8f4766a9da480fc71e5da29c567ccde3fddea200 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /hott/init/relation.hlean | 4cdeee4dfd7ac163085f4ef7ba9fe5136ef422f0 | [
"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 | 1,443 | hlean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.logic
-- TODO(Leo): remove duplication between this file and algebra/relation.lean
-- We need some of the following definitions asap w... |
593ed552a8cb789f16050c08d3a500c154a541fd | 2c41ae31b2b771ad5646ad880201393f5269a7f0 | /Lean/Qualities/Accurate.lean | 59227d30b95273058bfa1256e5d39ea5ef4a6a17 | [] | no_license | kevinsullivan/Boehm | 926f25bc6f1a8b6bd47d333d936fdfc278228312 | 55208395bff20d48a598b7fa33a4d55a2447a9cf | refs/heads/master | 1,586,127,134,302 | 1,488,252,326,000 | 1,488,252,326,000 | 32,836,930 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 660 | lean | -- Accurate
/-
[Accurate] is parameterized by an instance of type [SystemType], and it's a sub-attribute to [MissionEffective].
An instance of type [SystemType] is deemed [Accurate] if and only if all the requirements are satisfied.
-/
import SystemModel.System
inductive Accurate (sys_type: SystemType): Prop... |
b80bd78f80251614d736143dddf8c27a809048d9 | a7602958ab456501ff85db8cf5553f7bcab201d7 | /Assignment7/3.7-homework.lean | 30eecdc31eb650ebe4c76d974e9cf7dc32a47b1b | [] | no_license | enlauren/math-logic | 081e2e737c8afb28dbb337968df95ead47321ba0 | 086b6935543d1841f1db92d0e49add1124054c37 | refs/heads/master | 1,594,506,621,950 | 1,558,634,976,000 | 1,558,634,976,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 949 | lean | -- Assignment 7
-- Dom Farolino, farolidm@mail.uc.edu
-- Math Logic
-- Exercise 1
namespace exercise1
open classical
variable A : Prop
theorem dne (h: ¬¬ A) : A :=
by_contradiction
(assume h1 : ¬ A,
show false, from h h1)
example : A ∨ ¬ A :=
have h1: ¬ (¬ (A ∨ ¬ A)), from
-- Just proving... |
359b1b12ed507baf6add3af1b10f9afe4b7d339f | ecad13897fdb44984cf1968424224d1750040236 | /lean/lean/examples/example02.lean | b9c885d9c213f43533d29fb0ffe6bf0ea04d5c4d | [] | no_license | MetaBorgCube/sdf3-demo | 4899159b1cfb0a95ae3af325035bbba8a1255477 | e831606d5b404eba75b087916a1162923143b98a | refs/heads/master | 1,609,472,086,310 | 1,553,380,857,000 | 1,553,380,857,000 | 59,577,395 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 21 | lean | (a : A)(z : S) -> x
|
c3cbc3ec00148bbbc76abf7fd1be63186228f8ac | 6fca17f8d5025f89be1b2d9d15c9e0c4b4900cbf | /src/game/world6/level2.lean | 14e2bc95ba228198914c873d9c811c55e807a9c4 | [
"Apache-2.0"
] | permissive | arolihas/natural_number_game | 4f0c93feefec93b8824b2b96adff8b702b8b43ce | 8e4f7b4b42888a3b77429f90cce16292bd288138 | refs/heads/master | 1,621,872,426,808 | 1,586,270,467,000 | 1,586,270,467,000 | 253,648,466 | 0 | 0 | null | 1,586,219,694,000 | 1,586,219,694,000 | null | UTF-8 | Lean | false | false | 1,900 | lean | /-
# Proposition world.
## Level 2: `intro`.
Let's prove an implication. Let $P$ be a true/false statement,
and let's prove that $P\implies P$. If you delete the
`sorry` you will see that our goal is `P → P`. Constructing a term
of type `P → P` (which is what solving this goal *means*) in this
case amounts to provin... |
e2c474eb6aa0a9b5655616c33b6229d7f3253c7d | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/measure_theory/conditional_expectation.lean | 15c5fdeda25fef8b961847cc2a2b28d64f0942eb | [
"Apache-2.0"
] | permissive | stjordanis/mathlib | 51e286d19140e3788ef2c470bc7b953e4991f0c9 | 2568d41bca08f5d6bf39d915434c8447e21f42ee | refs/heads/master | 1,631,748,053,501 | 1,627,938,886,000 | 1,627,938,886,000 | 228,728,358 | 0 | 0 | Apache-2.0 | 1,576,630,588,000 | 1,576,630,587,000 | null | UTF-8 | Lean | false | false | 16,109 | lean | /-
Copyright (c) 2021 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
import measure_theory.l2_space
/-! # Conditional expectation
The conditional expectation will be defined for functions in `L²` by an orthogonal projection into
a compl... |
219daa73fc02babf0d9174b1c4cf1efa976034ec | 8c02fed42525b65813b55c064afe2484758d6d09 | /src/langparser.lean | 8204c7f7504ca5d7dc8ebfb6174c96128dcfa47a | [
"LicenseRef-scancode-generic-cla",
"MIT"
] | permissive | microsoft/AliveInLean | 3eac351a34154efedd3ffc4fe2fa4ec01b219e0d | 4b739dd6e4266b26a045613849df221374119871 | refs/heads/master | 1,691,419,737,939 | 1,689,365,567,000 | 1,689,365,568,000 | 131,156,103 | 23 | 18 | NOASSERTION | 1,660,342,040,000 | 1,524,747,538,000 | Lean | UTF-8 | Lean | false | false | 5,566 | lean | -- Copyright (c) Microsoft Corporation. All rights reserved.
-- Licensed under the MIT license.
import .lang
import .lang_tostr
import data.buffer.parser
open parser
-- ReadLinebreaks reads zero or more '\n's.
def ReadLinebreaks: parser unit :=
many' (ch '\n')
-- ReadLine reads a line.
def ReadLine: parser string... |
9c8898f99c733c7c379f00892f3e2741a2bb2e56 | 5ae26df177f810c5006841e9c73dc56e01b978d7 | /src/order/basic.lean | 32d18f7b5e6a29187204c13ddd2161df5f7ee8c4 | [
"Apache-2.0"
] | permissive | ChrisHughes24/mathlib | 98322577c460bc6b1fe5c21f42ce33ad1c3e5558 | a2a867e827c2a6702beb9efc2b9282bd801d5f9a | refs/heads/master | 1,583,848,251,477 | 1,565,164,247,000 | 1,565,164,247,000 | 129,409,993 | 0 | 1 | Apache-2.0 | 1,565,164,817,000 | 1,523,628,059,000 | Lean | UTF-8 | Lean | false | false | 25,742 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import logic.basic data.sum data.set.basic algebra.order
open function
/- TODO: automatic construction of dual definitions / theorems -/
universes u v... |
4c61876cd5cd7e249ae2cde4fe995c23b8df8ad9 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/field_theory/mv_polynomial.lean | e46087b8b61c84461b2fd98c19552074a7ccfaf3 | [
"Apache-2.0"
] | permissive | hjvromen/lewis | 40b035973df7c77ebf927afab7878c76d05ff758 | 105b675f73630f028ad5d890897a51b3c1146fb0 | refs/heads/master | 1,677,944,636,343 | 1,676,555,301,000 | 1,676,555,301,000 | 327,553,599 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,911 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Multivariate functions of the form `α^n → α` are isomorphic to multivariate polynomials in
`n` variables.
-/
import ring_theory.ideal.operations
import linear_algebra.f... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.