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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3af5f440adddf9942bb06453b253fa62140ea315 | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/category_theory/discrete_category.lean | cd7288dc8792f9c8db4ed09455e6d6587adbea35 | [
"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 | 2,957 | 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, Floris van Doorn
-/
import data.ulift
import data.fintype
import category_theory.opposites category_theory.equivalence
namespace category_theory
unive... |
c9354cdf03cc7c8f725e29436250168205c72357 | 3dc4623269159d02a444fe898d33e8c7e7e9461b | /.github/workflows/G.lean | 7a3c4e65bcf8fad1e85876d2b4bd7026a62fc2e7 | [] | 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 | 8,517 | lean | import .groupk
import category_theory.comma
import category_theory.limits.limits
import category_theory.limits.shapes
import category_theory.yoneda
open category_theory
open category_theory.limits
open category_theory.category
universes v u
open Product_stuff
open lem
/-
The goal is define group obj ... |
afcae26ef5c9e55e1129472e5da00ac1ba53f2b8 | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/classical.lean | 94a558f72049ff5385886d37d92c377d8897ca96 | [
"Apache-2.0"
] | permissive | Solertis/lean | 491e0939957486f664498fbfb02546e042699958 | 84188c5aa1673fdf37a082b2de8562dddf53df3f | refs/heads/master | 1,610,174,257,606 | 1,486,263,620,000 | 1,486,263,620,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,470 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
-/
prelude
import init.data.subtype.basic init.funext
open subtype
namespace classical
universe variables u v
/- the axiom -/
-- In the presen... |
9fdbf72481f62d45b3eb179e511870ab9e3dcaca | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/normed_space/operator_norm.lean | bec9b1dc27d0b646dfba1060124c7cec79f9646c | [
"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 | 52,326 | lean | /-
Copyright (c) 2019 Jan-David Salchow. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jan-David Salchow, Sébastien Gouëzel, Jean Lo
-/
import linear_algebra.finite_dimensional
import analysis.normed_space.linear_isometry
import analysis.normed_space.riesz_lemma
impor... |
8cdb4f60c8f1b041d7611194e2b3d222c2000df2 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/polynomial/erase_lead.lean | 079a759d76fbd0605a7aa858fd56fc1edc10d3d5 | [
"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 | 10,571 | lean | /-
Copyright (c) 2020 Damiano Testa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Damiano Testa
-/
import data.polynomial.degree.definitions
/-!
# Erase the leading term of a univariate polynomial
## Definition
* `erase_lead f`: the polynomial `f - leading term of... |
abd9f56eb8dc76dcab71952388b23e9d484bb55c | ec62863c729b7eedee77b86d974f2c529fa79d25 | /13/a.lean | 99480a0d0587861c5a88ab7eac2b64c43cc8a6f0 | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 663 | lean | def List.foldl1 [Inhabited α] (f : α → α → α) : List α → α
| x :: xs => xs.foldl f x
| _ => panic! "empty"
def solve (start : Int) (buses : List Int) : Int :=
let durs := buses.map (λ d => (d, (d - start % d) % d))
let best := durs.foldl1 (λ ⟨d₁, t₁⟩ ⟨d₂, t₂⟩ => if t₁ < t₂ then ⟨d₁, t₁⟩ else ⟨d₂, t₂⟩)
best.1 * best.2
... |
ea1a547e935be000fce59740d433a869e7925b20 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/order/category/FinBddDistLat.lean | 2e04a3deab863d2cb515122c0adc344d8d79d5b0 | [
"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 | 3,230 | 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 data.fintype.order
import order.category.BddDistLat
import order.category.FinPartOrd
/-!
# The category of finite bounded distributive lattices
This file defines... |
af71fdac04bf02455911386bb88a99b356270c03 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/group/with_one.lean | 7a9feae33d333f2449b74df59cbc3e8f9c95b5b9 | [
"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 | 15,756 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Johan Commelin
-/
import algebra.hom.equiv
import algebra.ring.basic
import logic.equiv.basic
import logic.equiv.option
/-!
# Adjoining a zero/one to semigroups and re... |
df5e386546fa31356e7bf867f648e52bb15b9fdc | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/analysis/normed_space/lp_space.lean | f20c1d8efe1bd3bec065af313b04b4ef01fb5deb | [
"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 | 42,904 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import analysis.mean_inequalities
import analysis.mean_inequalities_pow
import analysis.normed.group.pointwise
import topology.algebra.order.liminf_limsup
/-!
# ℓp... |
f634b7dbbc5d706bc9d17cd71e761fb1b5c329ce | 8f209eb34c0c4b9b6be5e518ebfc767a38bed79c | /code/src/internal/R_acc_mem_of_reachable.lean | a87ce0aef5181133ae08c52a3be6f7337001a916 | [] | no_license | hediet/masters-thesis | 13e3bcacb6227f25f7ec4691fb78cb0363f2dfb5 | dc40c14cc4ed073673615412f36b4e386ee7aac9 | refs/heads/master | 1,680,591,056,302 | 1,617,710,887,000 | 1,617,710,887,000 | 311,762,038 | 4 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 8,491 | lean | import tactic
import data.finset
import ..definitions
import .internal_definitions
import .tactics
import .utils
import .phi.utils
import .Ant.main
import .Gdt.main
import .U
import .A
import .R
import .R_red_removable
variable [GuardModule]
open GuardModule
lemma gdt_mark_inactive_rhss_inactive_rhss_of_diverged_or_... |
42de18d045e0d77197989b8ad864f0ed0447fe19 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/analysis/normed_space/riesz_lemma.lean | 6dbb26860e0da3630bcc921a095e06dab08daf96 | [
"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 | 5,463 | lean | /-
Copyright (c) 2019 Jean Lo. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jean Lo, Yury Kudryashov
-/
import analysis.normed_space.basic
import topology.metric_space.hausdorff_distance
/-!
# Applications of the Hausdorff distance in normed spaces
Riesz's lemma, s... |
101c1eea0c05dd0fb72b3936744461ee6c8f8b21 | 64874bd1010548c7f5a6e3e8902efa63baaff785 | /tests/lean/run/whnfinst.lean | ab5a457f7acc804861f27e0c346e88094321ab40 | [
"Apache-2.0"
] | permissive | tjiaqi/lean | 4634d729795c164664d10d093f3545287c76628f | d0ce4cf62f4246b0600c07e074d86e51f2195e30 | refs/heads/master | 1,622,323,796,480 | 1,422,643,069,000 | 1,422,643,069,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 379 | lean | import logic
open decidable
definition decidable_bin_rel {A : Type} (R : A → A → Prop) := Πx y, decidable (R x y)
section
variable {A : Type}
variable (R : A → A → Prop)
theorem tst1 (H : Πx y, decidable (R x y)) (a b c : A) : decidable (R a b ∧ R b a)
theorem tst2 (H : decidable_bin_rel R) (a b c : A) : de... |
79e85a8aaf99397b65de689e201c8255f020f27b | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/algebra/hom/group_action.lean | f0864ee100e0877d14253412c02680083bb23eba | [
"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 | 14,311 | 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 algebra.group_ring_action
import group_theory.group_action.defs
/-!
# Equivariant homomorphisms
## Main definitions
* `mul_action_hom M X Y`, the type of equivariant ... |
680aa73a6d5e721d6d571bcd98e5378e1cbc4de0 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/640a.hlean | 44caf6460455ad0c004e85dc9958e3d05c943ef1 | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 925 | hlean | section
parameter {A : Type}
definition relation : A → A → Type := λa b, a = b
local abbreviation R := relation
local abbreviation S [parsing-only] := relation
variable {a : A}
check relation a a
check R a a
check S a a
end
section
parameter {A : Type}
definition relation' : A → A → Type := λa b, a... |
737cfdac13596f411d5b90ec794a7dd02274b9e5 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/system/io_interface_auto.lean | 12358eac755e3394decbd692ed621f12b8391f0d | [] | 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,036 | lean | /-
Copyright (c) 2018 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.default
import Mathlib.Lean3Lib.data.buffer
import Mathlib.Lean3Lib.system.random
universes l
namespa... |
afc7fde3e0ed889e1a6617599e0b1d9609e7ad63 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/PrettyPrinter/Delaborator/Options.lean | 764bbc008459f426d4953f42bb255e36f3c78a06 | [
"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 | 8,524 | lean | /-
Copyright (c) 2020 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
import Lean.Data.Options
namespace Lean
register_builtin_option pp.all : Bool := {
defValue := false
group := "pp"
descr := "(pretty printer) ... |
77cebd71aadd2463fc19cc8f883021d9826d3a06 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/finsupp/basic.lean | d410cb1815855d081a5e8d13a5e10cce187a753d | [
"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 | 100,090 | 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 data.finset.preimage
import algebra.indicator_function
import algebra.group_action_hom
/-!
# Type of functions with finite support
For any ty... |
e9d2ad419b2f9fbb60f3cca567df23cbd8622959 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/algebra/field_power.lean | fa93ea6acc8116753cb856f61cf09db5ed76c937 | [
"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 | 9,110 | lean | /-
Copyright (c) 2018 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import algebra.group_with_zero.power
import tactic.linarith
/-!
# Integer power operation on fields and division rings
This file collects basic facts about the op... |
6f4b66af685ac08213a785d025ec91275a1ae641 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /12_Axioms.org.15.lean | 1ded05a4162e9b9f375a1fb81b41ce35d67c75a5 | [] | 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 | 255 | lean | import standard
import data.finset
open finset quot list nat
definition s₁ : finset nat := to_finset [1, 2]
definition s₂ : finset nat := to_finset [2, 1]
theorem seq : s₁ = s₂ := dec_trivial
check eq.rec (0 : ℕ) seq
eval eq.rec (0 : ℕ) seq
|
fdc7752ebbcc13830c96f93572b0982b8b9fde94 | f3849be5d845a1cb97680f0bbbe03b85518312f0 | /library/init/data/nat/basic.lean | a36a150b4d15343b7c37a035ef05c90886f8ffae | [
"Apache-2.0"
] | permissive | bjoeris/lean | 0ed95125d762b17bfcb54dad1f9721f953f92eeb | 4e496b78d5e73545fa4f9a807155113d8e6b0561 | refs/heads/master | 1,611,251,218,281 | 1,495,337,658,000 | 1,495,337,658,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,519 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Leonardo de Moura
-/
prelude
import init.logic init.data.num.basic
notation `ℕ` := nat
namespace nat
inductive less_than_or_equal (a : ℕ) : ℕ → Prop
| refl ... |
399aab2d0430944b501f42592324d2f5e58bfde8 | 48f4f349e1bb919d14ab7e5921d0cfe825f4c423 | /fabstract/Roux_C_and_vanDoorn_F_PTSs/fabstract.lean | 94a6cdb5c8c5659116d990de5b63e45eee310d66 | [] | no_license | thalesant/formalabstracts-2017 | fdf4ff90d30ab1dcb6d4cf16a068a997ea5ecc80 | c47181342c9e41954aa8d41f5049965b5f332bca | refs/heads/master | 1,584,610,453,925 | 1,528,277,508,000 | 1,528,277,508,000 | 136,299,625 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,469 | lean | import meta_data
.pure_type_systems
namespace Roux_C_and_vanDoorn_F_PTSs
open pure_type_system sum
def paper : document :=
{ authors := [ {name := "Cody Roux"}, {name := "Floris van Doorn"} ],
title := "The structural theory of pure type systems",
doi := "10.1007/978-3-319-08918-8_25" }
-- noncomputable t... |
932fb3069cc36230bcb3429c1f4c9cb999f4d491 | f0f12a5b81106a798deda31dca238c11997a605e | /Playlean4/Group/Basic.lean | 8a9c8810337d21ac89ac816863a4c73a385fbb0c | [
"MIT"
] | permissive | thejohncrafter/playlean4 | fe7119d492aab07048f78333eeda9862f6471740 | 81df180a71b8d84d0f45bc98db367aad203cf5df | refs/heads/master | 1,683,152,783,765 | 1,621,879,382,000 | 1,621,879,382,000 | 366,563,501 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,100 | lean |
import Playlean4.Basic
set_option quotPrecheck false
section
variable (G : Type) (law : G → G → G)
local infixl:70 " * " => id' law
@[appUnexpander id'] def unexpandMul : Lean.PrettyPrinter.Unexpander
| `(id' law $x $y) => `($x * $y)
| _ => throw ()
class Group where
one' : G -- Name hack
assoc : ∀ g₁ g₂ ... |
17b8600aabecca25016f392db5cecd24a8d66e91 | f5f7e6fae601a5fe3cac7cc3ed353ed781d62419 | /src/category_theory/adjunction.lean | 3d392914d4b42cec07fb95c7b1e288b982f96919 | [
"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 | 14,523 | lean | /-
Copyright (c) 2019 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Johan Commelin
-/
import category_theory.limits.preserves
import category_theory.whiskering
import category_theory.equivalence
namespace category_theory
open category
open ... |
b41807b2a480c34b41c76ac9a24433e3d3de2ff2 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/analysis/complex/basic.lean | 13222c7077f71f01ac0d6a69a5ab1bd89d9a0fb8 | [
"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 | 7,635 | lean | /-
Copyright (c) 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 data.complex.module
import data.complex.is_R_or_C
/-!
# Normed space structure on `ℂ`.
This file gathers basic facts on complex numbers of an analytic natur... |
da44d8880cdc16ac81126afb20eef5a384a4685f | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/ring_theory/derivation.lean | 9de5aa0c0ed3c367c5d60f8d68c71fc18d56aee0 | [
"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 | 9,937 | lean | /-
Copyright © 2020 Nicolò Cavalleri. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolò Cavalleri
-/
import algebra.lie.of_associative
import ring_theory.algebra_tower
/-!
# Derivations
This file defines derivation. A derivation `D` from the `R`-algebra `A` to t... |
f08bd7b3cfc6aada015b1322369ac3376ae4b427 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/ring_theory/coprime/basic.lean | 1a3f23e2a122f935dee055ede418fc361159c995 | [
"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 | 12,468 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Ken Lee, Chris Hughes
-/
import tactic.ring
import group_theory.group_action.units
/-!
# Coprime elements of a ring
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to ... |
93ac94db9065a5ca79ceb443bd2debdd97f06032 | 0f5090f82d527e0df5bf3adac9f9e2e1d81d71e2 | /src/apurva/eigenvalues.lean | ec9dcd8d0fffafaf4d8df4d88c9a5d8248108ef9 | [] | no_license | apurvanakade/mc2020-lean-projects | 36eb42c4baccc37183635c36f8e1b3afa4ec1230 | 02466225aa629ab1232043bcc0a053a099fdb939 | refs/heads/master | 1,688,791,717,534 | 1,597,874,092,000 | 1,597,874,092,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,490 | lean | /-
Define eigenvalues and eigenspaces of matrices and prove new theorems about them.
-/
import data.matrix.basic
import tactic
import linear_algebra.determinant
import .algebraically_closed
import linear_algebra.nonsingular_inverse
import linear_algebra.char_poly
noncomputable theory
open matrix
open_locale matrix
... |
6a3815f469ff8ea983804f2bc41e2d68c2800301 | 2a70b774d16dbdf5a533432ee0ebab6838df0948 | /_target/deps/mathlib/src/ring_theory/jacobson_ideal.lean | 8d42670b91e97f2a9656f18d5363dd9142ca3c91 | [
"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 | 14,048 | lean | /-
Copyright (c) 2020 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Devon Tuma
-/
import ring_theory.ideal.operations
import ring_theory.polynomial.basic
/-!
# Jacobson radical
The Jacobson radical of a ring `R` is defined to be the intersecti... |
52497140bfbb0b7d6e327061d032608efa7f691a | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/lake/examples/deps/foo/lakefile.lean | 6aad5d9332ab61a4b6902e25e3d65aee0b8e5065 | [
"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 | 163 | lean | import Lake
open System Lake DSL
package foo
require a from ".."/"a"
require b from ".."/"b"
lean_lib Foo
@[default_target]
lean_exe foo where
root := `Main
|
39abd6cb915413bb45d25db12b44bef12063fc00 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/run/array1.lean | 5d7f9fe39618c510322f3253c1501f214d9ded9f | [
"Apache-2.0"
] | permissive | walterhu1015/lean4 | b2c71b688975177402758924eaa513475ed6ce72 | 2214d81e84646a905d0b20b032c89caf89c737ad | refs/heads/master | 1,671,342,096,906 | 1,599,695,985,000 | 1,599,695,985,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,250 | lean | #check @Array.mk
def v : Array Nat := @Array.mk Nat 10 (fun ⟨i, _⟩ => i)
def w : Array Nat :=
(mkArray 9 1).push 3
def f : Fin w.sz → Nat :=
Array.casesOn w (fun _ f => f)
def arraySum (a : Array Nat) : Nat :=
a.foldl Nat.add 0
#eval mkArray 4 1
#eval Array.map (fun x => x+10) v
#eval f ⟨1, sorry⟩
#eval f ⟨9, sorr... |
40476db93613d93ad474a66846ed847b1a34a55f | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/algebraic_geometry/stalks.lean | ca6ad38406eced2461cb1f86f3c73f9e33ff3cf7 | [
"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 | 7,241 | 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 algebraic_geometry.presheafed_space
import category_theory.limits.final
import topology.sheaves.stalks
/-!
# Stalks for presheaved spaces
This file lifts con... |
94f5cab677a5687321e2178859daf9be68a5d3d4 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/data/equiv/transfer_instance.lean | dbc63b6fdfd55effcb728520af564266f475f209 | [
"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,614 | 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
-/
import data.equiv.basic algebra.field
/-!
# Transfer algebraic structures across `equiv`s
In this file we prove theorems of the following form: if `β` has a
group ... |
fa1019b8170c6ed002708c3568059729b2986fbb | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/analysis/calculus/fderiv.lean | fbb52cbbd13f520230dcba5c03ec7dd0013206dd | [
"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 | 91,576 | lean | /-
Copyright (c) 2019 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Sébastien Gouëzel, Yury Kudryashov
-/
import analysis.asymptotics analysis.calculus.tangent_cone
/-!
# The Fréchet derivative
Let `E` and `F` be normed spaces, `f : E ... |
d7d74882f64d234755e7e7448b14dfa3f52ab5c7 | 32da3d0f92cab08875472ef6cacc1931c2b3eafa | /src/combinatorics/composition.lean | e7c83b2f353c99b9bd922b0fa4f4de8ac61bde81 | [
"Apache-2.0"
] | permissive | karthiknadig/mathlib | b6073c3748860bfc9a3e55da86afcddba62dc913 | 33a86cfff12d7f200d0010cd03b95e9b69a6c1a5 | refs/heads/master | 1,676,389,371,851 | 1,610,061,127,000 | 1,610,061,127,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 33,828 | 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 data.fintype.card
import data.finset.sort
import tactic.omega
/-!
# Compositions
A composition of a natural number `n` is a decomposition `n = i₀ + ...... |
aee069a35fa0c3f1d9d512cd54d09b9c19cba2f9 | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/elab11.lean | 249dfdcef144da8b18f5de7e9790947873f94820 | [
"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 | 208 | lean | constant boo.f : nat → bool
constant bla.f : nat → nat
open boo bla
check f 1
set_option pp.full_names true
check (f 1 : nat)
check (f 1 : bool)
set_option pp.full_names false
check (f 1 : string)
|
7d4d1b8f1380d4a52e9590a21e15cb617b70cefa | bb31430994044506fa42fd667e2d556327e18dfe | /src/linear_algebra/multilinear/basic.lean | f2df2f37429c207d9047ab6d96ba995395d3bcc9 | [
"Apache-2.0"
] | permissive | sgouezel/mathlib | 0cb4e5335a2ba189fa7af96d83a377f83270e503 | 00638177efd1b2534fc5269363ebf42a7871df9a | refs/heads/master | 1,674,527,483,042 | 1,673,665,568,000 | 1,673,665,568,000 | 119,598,202 | 0 | 0 | null | 1,517,348,647,000 | 1,517,348,646,000 | null | UTF-8 | Lean | false | false | 58,956 | 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 linear_algebra.basic
import algebra.algebra.basic
import algebra.big_operators.order
import algebra.big_operators.ring
import data.list.fin_range
import ... |
2012b694a528326981c4db65e41009cedbf46c12 | 26bff4ed296b8373c92b6b025f5d60cdf02104b9 | /library/data/nat/order.lean | 11595574122421b7e12e08cc3c56ccddfdd6bec9 | [
"Apache-2.0"
] | permissive | guiquanz/lean | b8a878ea24f237b84b0e6f6be2f300e8bf028229 | 242f8ba0486860e53e257c443e965a82ee342db3 | refs/heads/master | 1,526,680,092,098 | 1,427,492,833,000 | 1,427,493,281,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,972 | lean | /-
Copyright (c) 2014 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.nat.order
Authors: Floris van Doorn, Leonardo de Moura, Jeremy Avigad
The order relation on the natural numbers.
-/
import data.nat.basic algebra.ordered_ring
open eq.ops
name... |
b42f4230122d41bba961069624a664cc1ff03233 | 43390109ab88557e6090f3245c47479c123ee500 | /src/Topology/Material/banach_contraction.lean | aa904cbe4ac0debc0c41d835d9a1dd4933678c1b | [
"Apache-2.0"
] | permissive | Ja1941/xena-UROP-2018 | 41f0956519f94d56b8bf6834a8d39473f4923200 | b111fb87f343cf79eca3b886f99ee15c1dd9884b | refs/heads/master | 1,662,355,955,139 | 1,590,577,325,000 | 1,590,577,325,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,343 | lean | /-
Copyright (c) 2018 Rohan Mitta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rohan Mitta
-/
import analysis.topology.topological_space
import analysis.topology.continuity
import analysis.metric_space
import analysis.topology.uniform_space
import order.filter
impor... |
4bfe4181afa1a0df68d4caed73b5c5ce05d8b649 | fe84e287c662151bb313504482b218a503b972f3 | /src/group_theory/burnside_count.lean | a8fd0fa75e5f08ecc6ce28b70517e0b800961038 | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 5,027 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
We prove the orbit counting lemma traditionally attributed to
Burnside: if a finite group G acts on a finite set X, then
|G| × |X/G| is the sum over `t ∈ G` of `|Xᵗ|... |
0a54ec59dd274a29015b236fe14a3cedebc3f5d7 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/data/finset/basic.lean | f019667ca42eb54c14bbf3e31a43503799278fd4 | [
"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 | 122,714 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad, Minchao Wu, Mario Carneiro
-/
import data.multiset.finset_ops
import tactic.monotonicity
import tactic.apply
import tactic.nth_rewrite
/-!
# F... |
ca24a949de4091c759fd4cddbdb91a9d61b9a543 | ee8cdbabf07f77e7be63a449b8483ce308d37218 | /lean/src/test/mathd-algebra-76.lean | 63621658f564cc87f8c3e06e076cf4faf3ff8a56 | [
"MIT",
"Apache-2.0"
] | permissive | zeta1999/miniF2F | 6d66c75d1c18152e224d07d5eed57624f731d4b7 | c1ba9629559c5273c92ec226894baa0c1ce27861 | refs/heads/main | 1,681,897,460,642 | 1,620,646,361,000 | 1,620,646,361,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 436 | lean | /-
Copyright (c) 2021 OpenAI. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kunhao Zheng
-/
import tactic.gptf
import data.real.basic
example (f : ℤ → ℤ) (h₀ : ∀n, odd n → f n = n^2) (h₁ : ∀ n, even n → f n = n^2 - 4*n -1) : f 4 = -1 :=
begin
suffices : f 4 = 4^2 -... |
ea1440c31b2266bc20be32b043b66603b9ed3127 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/set/finite.lean | 072369839a2670d1a8fb603295c8998619e3d371 | [
"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 | 35,747 | 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.finset.sort
/-!
# Finite sets
This file defines predicates `finite : set α → Prop` and `infinite : set α → Prop` and proves some
basic f... |
41d5d4252f8edef76a2f1b0a526b9bc53137afc2 | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Parser/Extension.lean | 2a6bc7fdf7205fc7d2d896ca6b377284cf900017 | [
"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 | 28,129 | 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
-/
/-! Extensible parsing via attributes -/
import Lean.Parser.Basic
import Lean.Parser.StrInterpolation
import Lean.KeyedDeclsAttribute
... |
bb0f3ac6d2acbf9d70338f6e2efc9ba1e3a77eff | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/run/simp_orderings.lean | 337c1b81dff65aca1b0e6596cce70fdd8626958b | [
"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,347 | lean | open tactic
-------------
namespace simp_lemmas
constants (A : Type.{1}) (x y z : A) (Hxy : x = y) (Hxz : x = z)
attribute Hxy [simp]
attribute Hxz [simp]
example : x = z := by simp
end simp_lemmas
-------------
namespace simp_lemmas_args
constants (A : Type.{1}) (x y z : A) (Hxy : x = y) (Hxz : x = z)
attribute ... |
e38c29eb3212c934ee43eb0905977f9ab87843c9 | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/breen_deligne/functorial_map.lean | 666023c810754512b6b0e89ee3c9e37ec7b28d1a | [] | no_license | Ja1941/lean-liquid | fbec3ffc7fc67df1b5ca95b7ee225685ab9ffbdc | 8e80ed0cbdf5145d6814e833a674eaf05a1495c1 | refs/heads/master | 1,689,437,983,362 | 1,628,362,719,000 | 1,628,362,719,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 13,841 | lean | import breen_deligne.universal_map
/-!
# Universality of universal maps
(Note: this file exists as a consistency check, but is not used in the rest of the project.)
A `universal_map m n` in this repo is a finite formal `ℤ`-linear combination
of `m × n` matrices (so-called `basic_universal_map`s). In this file we sh... |
c720db2211bc54e59ab6e90b2e60a8bccb19af94 | 302c785c90d40ad3d6be43d33bc6a558354cc2cf | /src/topology/metric_space/gromov_hausdorff.lean | 19d6b6b9d2924b325c2dfae423be3a4c737fda46 | [
"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 | 55,729 | 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 topology.metric_space.closeds
import set_theory.cardinal
import topology.metric_space.gromov_hausdorff_realized
import topology.metric_space.completion
i... |
5f663a65f263fcb16cac31c1fb0bfb77098e39b0 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/linear_algebra/clifford_algebra/equivs.lean | fbfc724ea7963d2d34262f069b7250d0dbc9af28 | [
"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 | 14,939 | 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 algebra.dual_number
import algebra.quaternion_basis
import data.complex.module
import linear_algebra.clifford_algebra.conjugation
import linear_algebra.clifford_alge... |
6afb81bcf4d51ef916f9ce127ddd543fbef01cb5 | c45b34bfd44d8607a2e8762c926e3cfaa7436201 | /uexp/src/uexp/rules/pullFilterThroughAggregate.lean | 99c882dcbd6f096e532e05825030a7b64aa4b2ae | [
"BSD-2-Clause"
] | permissive | Shamrock-Frost/Cosette | b477c442c07e45082348a145f19ebb35a7f29392 | 24cbc4adebf627f13f5eac878f04ffa20d1209af | refs/heads/master | 1,619,721,304,969 | 1,526,082,841,000 | 1,526,082,841,000 | 121,695,605 | 1 | 0 | null | 1,518,737,210,000 | 1,518,737,210,000 | null | UTF-8 | Lean | false | false | 2,125 | lean |
import ..sql
import ..tactics
import ..u_semiring
import ..extra_constants
import ..cosette_tactics
open Expr
open Proj
open Pred
open SQL
open tree
notation `int` := datatypes.int
constant integer_5000: const int
theorem rule: forall ( Γ scm_t scm_account scm_bonus scm_dept scm_emp: Schema) (rel_t: relation sc... |
89b3aafc4ac69813a14b1760e22a6aef1de29f60 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/analysis/normed_space/hahn_banach.lean | f0d93342c08fc03772ef849b7868082396de8af0 | [
"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 | 7,705 | lean | /-
Copyright (c) 2020 Yury Kudryashov All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth
-/
import analysis.normed_space.operator_norm
import analysis.normed_space.extend
import analysis.convex.cone
/-!
# Hahn-Banach theorem
In this file ... |
bf845cbf724ddaecc3568ef837665e82fea7ebfc | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/group.lean | ae783598494af6452db5695966e752b81aa50ad7 | [
"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 | 3,690 | lean | /-
Copyright (c) 2020. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot
-/
import tactic.ring
import tactic.doc_commands
/-!
# `group`
Normalizes expressions in the language of groups. The basic idea is to use the simplifier
to put everything into a prod... |
84e403e7147c9ad64592366cfae3e241850a2b91 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/topology/sheaves/sheaf_condition/pairwise_intersections.lean | 098a78851bc74925bc631590dd7cacca9fd36ecc | [
"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 | 19,503 | 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 topology.sheaves.sheaf_condition.sites
import category_theory.limits.preserves.basic
import category_theory.category.pairwise
import category_theory.limits.co... |
95033ba65faf8ea0cdd1b21bb9f1d3c33bbadd31 | 26ac254ecb57ffcb886ff709cf018390161a9225 | /src/set_theory/ordinal_notation.lean | 8a358ea48a873ebb2be64f54b2a046ba13ecae97 | [
"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 | 35,892 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Ordinal notations (constructive ordinal arithmetic for ordinals < ε₀).
-/
import set_theory.ordinal
open ordinal
open_locale ordinal -- get notation for `ω`
/-- Recursi... |
7b6cc9a88a5e522ac16bf712893cdbd09f762d5d | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/analysis/asymptotics/superpolynomial_decay.lean | 16cbc65af224a2f2354c1cdaa85933f4e11f7c76 | [
"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 | 14,162 | lean | /-
Copyright (c) 2021 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import analysis.asymptotics.asymptotics
import analysis.asymptotics.specific_asymptotics
import data.polynomial.eval
/-!
# Super-Polynomial Function Decay
This file defines... |
73faf43bd4a6af555f680d2154becfc9dd574402 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/comp_val1.lean | 5770b480041475a3d248db8d5624bbafde75fe6b | [
"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 | 6,378 | lean | open tactic
example : 0 < 1 := by comp_val
example : 0 < 2 := by comp_val
example : 0 < 3 := by comp_val
example : 0 < 4 := by comp_val
example : 0 < 5 := by comp_val
example : 0 < 6 := by comp_val
example : 0 < 1293821 := by comp_val
example : 0 < 1293822 := by comp_val
example : 1 < 2 := by comp_val
example : 1 < 3... |
b60a261a8c0a75218e5f7457cb0f7de23379cb73 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /analysis/real.lean | 4fafbdb496ec2aa7c3afac45faa54a80b8244429 | [
"Apache-2.0"
] | permissive | mjendrusch/mathlib | df3ae884dd5ce38c7edf452bcbfd3baf4e3a6214 | 5c209edb7eb616a26f64efe3500f2b1ba95b8d55 | refs/heads/master | 1,585,663,284,800 | 1,539,062,055,000 | 1,539,062,055,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,731 | 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
The real numbers ℝ.
They are constructed as the topological completion of ℚ. With the following steps:
(1) prove that ℚ forms a uniform space.
(2) subt... |
76f1a9ec253e7560a3304762584a1a9ada9a1d46 | 79cc757e5e5b09c7a522f717a6c490d321d36469 | /src/mywork/sept_27.lean | dba2a1bd2b07bbe9aa00b0829c5612a955450e97 | [] | no_license | LukeMathe/cs2120f21 | 534c3b8868dcfdea98a9d22513180c8a062794c6 | d51940b174569a8782e62ae027b108b5f099a9aa | refs/heads/main | 1,693,418,664,935 | 1,634,585,653,000 | 1,634,585,653,000 | 403,762,076 | 0 | 0 | null | 1,630,963,485,000 | 1,630,963,485,000 | null | UTF-8 | Lean | false | false | 653 | lean | /-
A simple predicate.
-/
def ev (n : ℕ) : Prop := n%2=0
/-
Introduction rule for exists
-/
example : exists (n : ℕ), ev n :=
begin
apply exists.intro ,
end
example : exists n, ev n := _
def pythagorean_triple ( a b c : nat) : Prop := a*a + b*b = c*c
example : pythagorean_triple 3 4 5 :=
begin
unfold pyth... |
368870b795c5ae00a5df20ee0973bdb0ba54f106 | 7571914d3f4d9677288f35ab1a53a2ad70a62bd7 | /tests/lean/run/choice_anon_ctor.lean | 1ea9939210a60557f4894bdb5b6318ff519c4232 | [
"Apache-2.0"
] | permissive | picrin/lean-1 | a395fed5287995f09a15a190bb24609919a0727f | b50597228b42a7eaa01bf8cb7a4fb1a98e7a8aab | refs/heads/master | 1,610,757,735,162 | 1,502,008,413,000 | 1,502,008,413,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 360 | lean | -- constant vector : Type → nat → Type
-- constant vector.nil {α} : vector α 0
-- constant vector.cons {α n} : α → vector α n → vector α (nat.succ n)
-- notation a :: b := vector.cons a b
notation `[` l:(foldr `, ` (h t, vector.cons h t) vector.nil `]`) := l
structure author :=
(name : string)
def f : list author :=... |
f971a2b2a6f883de84876c00adf02b923a5b04d1 | 92b50235facfbc08dfe7f334827d47281471333b | /library/init/reserved_notation.lean | cbe19222ae71381a9f4b871b1d3d4e1c7fbb9039 | [
"Apache-2.0"
] | permissive | htzh/lean | 24f6ed7510ab637379ec31af406d12584d31792c | d70c79f4e30aafecdfc4a60b5d3512199200ab6e | refs/heads/master | 1,607,677,731,270 | 1,437,089,952,000 | 1,437,089,952,000 | 37,078,816 | 0 | 0 | null | 1,433,780,956,000 | 1,433,780,955,000 | null | UTF-8 | Lean | false | false | 2,221 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
-/
prelude
import init.datatypes
notation `assume` binders `,` r:(scoped f, f) := r
notation `take` binders `,` r:(scoped f, f) := r
/-
Gl... |
9a53fdffda9038aa353f4912022b041a67045f02 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/topology/algebra/infinite_sum.lean | 9b7095b1deb9e2ff555fa71c8914f073001ced02 | [
"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 | 65,369 | 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 algebra.big_operators.intervals
import algebra.big_operators.nat_antidiagonal
import logic.encodable.lattice
import topology.algebra.mul_action
import topology... |
a2d27046993701c64200b09311d35825c8b470d9 | e42ba0bcfa11e5be053e2ce1ce1f49f027680525 | /src/separation/specification.lean | 7fad23cc920460b0747211baabe0b3901362a89f | [] | no_license | unitb/separation-logic | 8e17c5b466f86caa143265f4c04c78eec9d3c3b8 | bdde6fc8f16fd43932aea9827d6c63cadd91c2e8 | refs/heads/master | 1,540,936,751,653 | 1,535,050,181,000 | 1,535,056,425,000 | 109,461,809 | 6 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 20,571 | lean | import data.bitvec
import data.dlist
import util.logic
import util.data.option
import util.control.applicative
import util.control.monad.non_termination
import util.control.monad.state
import util.meta.tactic
import util.predicate
import separation.heap
import separation.program
import logic.basic
universes u v w w'
... |
8c1bd7db808a28d97de354518c4a2b9ef189de7e | a047a4718edfa935d17231e9e6ecec8c7b701e05 | /src/analysis/analytic/basic.lean | d7ad208b0523e3c0eeb8beceec0ea7a229c2ec8e | [
"Apache-2.0"
] | permissive | utensil-contrib/mathlib | bae0c9fafe5e2bdb516efc89d6f8c1502ecc9767 | b91909e77e219098a2f8cc031f89d595fe274bd2 | refs/heads/master | 1,668,048,976,965 | 1,592,442,701,000 | 1,592,442,701,000 | 273,197,855 | 0 | 0 | null | 1,592,472,812,000 | 1,592,472,811,000 | null | UTF-8 | Lean | false | false | 37,949 | 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 analysis.calculus.times_cont_diff
import tactic.omega
import analysis.special_functions.pow
/-!
# Analytic functions
A function is analytic in one dime... |
10c27e1b65c7c25e4a61926eeb311217cde7a8c1 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /04_Quantifiers_and_Equality.org.27.lean | e32f1b30e6e74043352160f668db0e6624c6562a | [] | 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 | 266 | lean | /- page 58 -/
import standard
import data.nat
open nat
variable f : ℕ → ℕ
premise H : ∀ x : ℕ, f x ≤ f (x + 1)
example : f 0 ≤ f 3 :=
have f 0 ≤ f 1, from H 0,
have f 0 ≤ f 2, from le.trans this (H 1),
show f 0 ≤ f 3, from le.trans this (H 2)
|
b6f4054d83ff4fc17b9d9469ce8076e8e2a11710 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebraic_geometry/presheafed_space/has_colimits.lean | 11619962ca2ac2f0445fe9f10b82152fa898a7b1 | [
"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 | 14,941 | 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 algebraic_geometry.presheafed_space
import topology.category.Top.limits
import topology.sheaves.limits
/-!
# `PresheafedSpace C` has colimits.
If `C` has lim... |
348a02e705d608806ff5aaa59a35a87ca182695d | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /library/data/nat/bquant.lean | c86b6dac2ef91aec7a7119bd65682aab16b5616b | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,742 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
Show that "bounded" quantifiers: (∃x, x < n ∧ P x) and (∀x, x < n → P x)
are decidable when P is decidable.
This module allow us to write if-then-else express... |
ecb83dc8ee998fa3faf759f19c06e124f0c77d79 | 30b012bb72d640ec30c8fdd4c45fdfa67beb012c | /set_theory/ordinal.lean | 34a040e943630832c329d771d34e4c3503b8d6e1 | [
"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 | 125,114 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Ordinal arithmetic.
Ordinals are defined as equivalences of well-ordered sets by order isomorphism.
-/
import order.order_iso set_theory.cardinal data.sum
noncomputable... |
e28bbb474b274036408dbee5813a905d4ba9b9aa | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /tests/lean/qexpr3.lean | beab6143dd0c0ff8d1dbb25d48fbc92aeecd1151 | [
"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 | 136 | lean | open tactic
example (a b c : nat) (H1 : a = b) (H2 : b = c) : a = c :=
by do
refine `(eq.trans H1 _),
trace_state,
assumption
|
f299ed21298d5c669b21983c33a970879419a340 | 94e33a31faa76775069b071adea97e86e218a8ee | /src/analysis/calculus/inverse.lean | 5f832f1054b31cdaeec821a24a4db01adc21e8db | [
"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 | 37,336 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Heather Macbeth, Sébastien Gouëzel
-/
import analysis.calculus.cont_diff
import tactic.ring_exp
import analysis.normed_space.banach
import topology.local_homeomorph
... |
2a0c8656a81d45e058c1a00a742207d337d060d0 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/limits/filtered_colimit_commutes_finite_limit.lean | 58acc9dc3933c0ddb3ad0ee21504c350df5b22dc | [
"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 | 13,459 | 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 category_theory.limits.colimit_limit
import category_theory.limits.shapes.finite_limits
/-!
# Filtered colimits commute with finite limits.
We show that for ... |
711c1542cf4027a22b7ec7bfc0f506f2212e7039 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/measure_theory/l1_space.lean | 8cf908cbbb55e278c0429a82f9f4a48344af62e4 | [
"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 | 29,451 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import measure_theory.ae_eq_fun
/-!
# Integrable functions and `L¹` space
In the first part of this file, the predicate `integrable` is defined and basic properties o... |
9ebfea0c9a798308b3a85b920e44e852a3ea6709 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/cdotAtSimpArg.lean | e57cb130fdf7e557721f58965174b0fa71b4cb81 | [
"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 | 293 | lean | example : ¬ true = false := by
simp [(¬ ·)]
example (h : y = 0) : x + y = x := by
simp [(.+.)] -- Expands `HAdd.hAdd
trace_state
simp [Add.add]
simp [h, Nat.add]
done
example (h : y = 0) : x + y = x := by
simp [.+.]
trace_state
simp [Add.add]
simp [h, Nat.add]
done
|
1c40467138b565fdd1739ae2d2d248aa16fae312 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/process_get_char.lean | 6c42a4acb73637ac2423f4ddaed0c772523e5a52 | [
"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 | 488 | lean | import system.io
def data := "0123456789012345678901234567890"
meta def main := do
child ← io.proc.spawn {
cmd := "echo",
args := [data],
stdout := io.process.stdio.piped
},
c1 <- io.fs.get_char child.stdout,
c2 <- io.fs.get_char child.stdout,
c3 <- io.fs.get_char child.stdout,
c4 <- io.fs.get_char child.... |
e509b77a44b5f0f5d9b487e8f2c8c7b085903a3e | a4673261e60b025e2c8c825dfa4ab9108246c32e | /stage0/src/Lean/Data/Json/Parser.lean | dedbc92f1cf11b3f633224eb49341ac377fe8268 | [
"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 | 7,700 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Marc Huisinga
-/
import Lean.Data.Json.Basic
namespace Lean
open Std (RBNode RBNode.singleton RBNode.leaf)
inductive Quickparse.Result (α : Type) :=
| success (pos ... |
b449d40ffb091499de1ca0597ddbec13b639e19c | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_981.lean | de004c9203be57f7b7562cd29d73c45ac8255d08 | [] | no_license | gihanmarasingha/mth1001_sphinx | 190a003269ba5e54717b448302a27ca26e31d491 | 05126586cbf5786e521be1ea2ef5b4ba3c44e74a | refs/heads/master | 1,672,913,933,677 | 1,604,516,583,000 | 1,604,516,583,000 | 309,245,750 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 250 | lean | variables a b : Prop
-- BEGIN
theorem and_of_and (p q : Prop) : p ∧ q → q ∧ p :=
begin
intro h,
exact and.intro (h.right) (h.left)
end
example (a b : Prop) : (a → b) ∧ (b ∧ a) → (b ∧ a) ∧ (a → b) :=
by apply and_of_and
-- END |
55c4997a4ff3c1861a52bdb5d36c58d1857df232 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/monad/equiv_mon.lean | 7765dc2798ed7c4bc239373e1e21d4bd165ac520 | [
"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 | 4,324 | lean | /-
Copyright (c) 2020 Adam Topaz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz
-/
import category_theory.monad.basic
import category_theory.monoidal.End
import category_theory.monoidal.Mon_
/-!
# The equivalence between `Monad C` and `Mon_ (C ⥤ C)`.
> T... |
ba5bf422b33e4c6a098f42371f32a6ecca5c339d | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/field_theory/finite/polynomial.lean | 6ebeeecfb3f47838e88ebe0e45f330b3a69095fc | [
"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,557 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import linear_algebra.finite_dimensional
import linear_algebra.basic
import ring_theory.mv_polynomial.basic
import data.mv_polynomial.expand
import field_theory.fini... |
e820951e8843a1d7fa889d08d720e09d7ba27453 | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /tests/lean/slow/nat_bug2.lean | 70b70eabe6be4c56d96f559da79efaf3b7d0cfbd | [
"Apache-2.0"
] | permissive | davidmueller13/lean | 65a3ed141b4088cd0a268e4de80eb6778b21a0e9 | c626e2e3c6f3771e07c32e82ee5b9e030de5b050 | refs/heads/master | 1,611,278,313,401 | 1,444,021,177,000 | 1,444,021,177,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 49,445 | lean | ----------------------------------------------------------------------------------------------------
-- Copyright (c) 2014 Floris van Doorn. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Author: Floris van Doorn
-----------------------------------------------------------... |
855a481cf1af039bdb57c35afe009b92634b16f0 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/algebra/star/chsh.lean | 7b10ca2d6d83c19e95c63f75222f9e9776aaa549 | [
"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 | 11,336 | 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.star.algebra
import algebra.algebra.ordered
import analysis.special_functions.pow
/-!
# The Clauser-Horne-Shimony-Holt inequality and Tsirelson's ineq... |
f7ef60306d1d50e75231bf5724eef09dcd71eba9 | c5b07d17b3c9fb19e4b302465d237fd1d988c14f | /src/category/kan.lean | 92a2b59ab3ac72f75ba44f526aaef3295d32fdf0 | [
"MIT"
] | permissive | skaslev/papers | acaec61602b28c33d6115e53913b2002136aa29b | f15b379f3c43bbd0a37ac7bb75f4278f7e901389 | refs/heads/master | 1,665,505,770,318 | 1,660,378,602,000 | 1,660,378,602,000 | 14,101,547 | 0 | 1 | MIT | 1,595,414,522,000 | 1,383,542,702,000 | Lean | UTF-8 | Lean | false | false | 8,932 | lean | import data.iso
import category.cofunctor
import category.comonad
-- Yoneda lemma can be stated in terms of the right and left Kan extensions
-- along the id functor
-- If f is a functor then for all types A
-- f A ↪ Π B, (A → B) → f B = ran id f A
-- f A ↪ Σ B, (B → A) × f B = lan id f A
-- and similarly for contrava... |
c1292684a6e48b6b556160ab1d422423b1b33909 | 842b7df4a999c5c50bbd215b8617dd705e43c2e1 | /nat_num_game/src/Advanced_Addition_World/adv_add_wrld3.lean | 2c82b5eab02fa75d9838ddc70090cf8f6f8d862f | [] | no_license | Samyak-Surti/LeanCode | 1c245631f74b00057d20483c8ac75916e8643b14 | 944eac3e5f43e2614ed246083b97fbdf24181d83 | refs/heads/master | 1,669,023,730,828 | 1,595,534,784,000 | 1,595,534,784,000 | 282,037,186 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 149 | lean | theorem succ_eq_succ_of_eq {a b : ℕ} : a = b → nat.succ(a) = nat.succ(b) :=
begin
intro h,
repeat {rw nat.succ_eq_add_one},
rw h,
end |
6bff1a2b34b4c63db5619ca7a7a743c06f345d30 | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /analysis/bounded_linear_maps.lean | ada0606a1ffce326afab8dfbf0631b4a1aae58a5 | [
"Apache-2.0"
] | permissive | sebzim4500/mathlib | e0b5a63b1655f910dee30badf09bd7e191d3cf30 | 6997cafbd3a7325af5cb318561768c316ceb7757 | refs/heads/master | 1,585,549,958,618 | 1,538,221,723,000 | 1,538,221,723,000 | 150,869,076 | 0 | 0 | Apache-2.0 | 1,538,229,323,000 | 1,538,229,323,000 | null | UTF-8 | Lean | false | false | 5,743 | 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
Continuous linear functions -- functions between normed vector spaces which are bounded and linear.
-/
import algebra.field
import tactic.norm_num
impor... |
b03b7fb9088e1fb7c8fb726f6c5a6622700c0207 | ed27983dd289b3bcad416f0b1927105d6ef19db8 | /src/assignments/assignment_3/assignment_3.lean | 5cd96449e74c800ddd568b3f79527cfa40aca445 | [] | no_license | liuxin-James/complogic-s21 | 0d55b76dbe25024473d31d98b5b83655c365f811 | 13e03e0114626643b44015c654151fb651603486 | refs/heads/master | 1,681,109,264,463 | 1,618,848,261,000 | 1,618,848,261,000 | 337,599,491 | 0 | 0 | null | 1,613,141,619,000 | 1,612,925,555,000 | null | UTF-8 | Lean | false | false | 6,969 | lean | /-
HIGHER-ORDER FUNCTION WARMUP
-/
/-
1. Write a function, double, that takes
a natural number and returns its double.
Write it using the following recursive
definition:s
- double 0 = 0
- double (n' + 1) = double n' + 2
-/
-- ANSWER HERE
def double : ℕ → ℕ
| 0 := 0
| (n + 1) := double n + 2
#eval double 3
#eval doub... |
273ea63c7c8e1a557ec075db235fad02f6896b0b | 5c5878e769950eabe897ad08485b3ba1a619cea9 | /src/categories/universal/types/default.lean | 2467cfaa6335a98a4f83c63a1f1d1992369cca19 | [
"Apache-2.0"
] | permissive | semorrison/lean-category-theory-pr | 39dc2077fcb41b438e61be1685e4cbca298767ed | 7adc8d91835e883db0fe75aa33661bc1480dbe55 | refs/heads/master | 1,583,748,682,010 | 1,535,111,040,000 | 1,535,111,040,000 | 128,731,071 | 1 | 2 | Apache-2.0 | 1,528,069,880,000 | 1,523,258,452,000 | Lean | UTF-8 | Lean | false | false | 8,328 | lean | import category_theory.types
import ..instances
import tidy.its
import tactic.interactive
open category_theory.universal
namespace category_theory.types
universe u
local attribute [forward] congr_fun
instance Types_has_Products : has_Products (Type u) :=
{ product := λ I φ, { product := Π i : I, φ i,
... |
b354f87253c294228405246165527879706ede2f | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Meta/Match/MatcherInfo.lean | 2aff1764fea02b50185e2ef30f3567f79c8c1431 | [
"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 | 5,907 | 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.Meta.Basic
namespace Lean.Meta
namespace Match
structure DiscrInfo where
/-- `some h` if the discriminant is annotated with `h:` -/
hName?... |
d320d595b5e061877c23023670bdad5943cbec5b | 0845ae2ca02071debcfd4ac24be871236c01784f | /library/init/lean/compiler/ir/emitcpp.lean | 50c7cfb592769b63df0a49707165a506b6ef2d3d | [
"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 | 25,192 | 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
-/
prelude
import init.control.conditional
import init.lean.runtime
import init.lean.compiler.namemangling
import init.lean.compiler.exportattr
import init.lea... |
18b2b19d2f5512cbaf79c0782144e0ebe5e16df4 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/category_theory/limits/cones.lean | 5ca29eff09e1743ed4fbc7ef5e8aacd1a2c5f706 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 16,157 | 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, Floris van Doorn
import category_theory.const
import category_theory.yoneda
import category_theory.concrete_category
import category_theory.equiv... |
fc464ad71dc53450808bc3709d24da040daadae6 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/data/typevec.lean | 818c64bb089ff4e459572b78cc3942c93244dfdd | [
"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 | 24,633 | lean | /-
Copyright (c) 2018 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro, Simon Hudon
-/
import data.fin.fin2
import logic.function.basic
import tactic.basic
/-!
# Tuples of types, and their categorical structure.
## Features... |
0d226afde30ada8cf8ab8f4984e4b60bac1e1721 | 02fbe05a45fda5abde7583464416db4366eedfbf | /library/init/meta/interactive.lean | ead882d365895948c08e2f31c9db80a40ed0c2a8 | [
"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 | 71,766 | 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, Jannis Limperg
-/
prelude
import init.meta.tactic init.meta.type_context init.meta.rewrite_tactic init.meta.simp_tactic
import init.meta.smt.congruence_closur... |
75454fa5116c4b37c6def483d21662cd5f964886 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/group_theory/free_group.lean | 843aaa9b3c7a1eced71cc5123a6bf62d66edc3e7 | [
"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 | 32,611 | 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.fintype.basic
import group_theory.subgroup.basic
/-!
# Free groups
This file defines free groups over a type. Furthermore, it is shown that the free group constru... |
09f0bb1d43c7f18f0d87d7b452e57469744e0741 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/convex/krein_milman.lean | 4619d869f64206650bc4c79f78ea65d562e317d2 | [
"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,273 | 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 analysis.convex.exposed
import analysis.normed_space.hahn_banach.separation
/-!
# The Krein-Milman theorem
This file proves the Krein-Milman lemma and the Krein-... |
42bb44c5fb2ecac236329343f496482c3c72d0b5 | 69b400b14d8b9f598d16e57d334c8a68910f3584 | /prep/alg-geom/src/ca.lean | 3d24d8b114329b2eebff4ac74610d6114e16550b | [] | no_license | TwoFX/partiii | e8cf563d9f7074a45eb35928bf7eb7dfd38ea29e | b949b1f7599ef35a1c1856ba6e9d1fddb245bcd9 | refs/heads/master | 1,683,178,340,068 | 1,622,049,944,000 | 1,622,049,944,000 | 304,524,313 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 877 | lean | import ring_theory.ideal.basic
variables {R : Type*} [comm_ring R]
def mult (S : set R) : Prop :=
(1 : R) ∈ S ∧ ∀ x y, (x ∈ S ∧ y ∈ S) → x * y ∈ S
def saturated (S : set R) : Prop :=
∀ x y, x * y ∈ S → (x ∈ S ∧ y ∈ S)
lemma saturated_iff (S : set R) (h : mult S) :
saturated S ↔ ∃ {ι : Type} (p : ι → ideal R), (∀ ... |
2f53e24a82e6ff92d7c31992d6acda1489f8538e | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/nat/choose/basic_auto.lean | 71b949a5ca8aedc4051a3d905ca14406ae9c3186 | [] | 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 | 3,961 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.nat.factorial
import Mathlib.PostPort
namespace Mathlib
/-!
# Binomial coe... |
12dd7c91580dbb8691e3977925e7f6125c11b167 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /stage0/src/Lean/Data/JsonRpc.lean | 052a021385fdac8de19e61b2e98bc38009238c78 | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,647 | 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/... |
aa336c94e93d86ca4829c4c43fbad59951ce3441 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/abelian/pseudoelements.lean | bdccd6f16fd7606d3c64e5e23996230f83201648 | [
"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 | 20,252 | 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 category_theory.abelian.exact
import category_theory.over
import algebra.category.Module.epi_mono
/-!
# Pseudoelements in abelian categories
> THIS FILE IS SYN... |
698419101d16d2fddd53ea1e4a99306f5f18c481 | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/analysis/normed_space/bounded_linear_maps.lean | 2b5b724321317c23a392cf469c3cfea70f8d0f16 | [
"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 | 24,581 | 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
import analysis.normed_space.units
import analysis.asymptotics.asymptotics
/-!
# Bounded linear maps
This f... |
b88ea80b7db85a748a25d1efefead34e5b38bd25 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /test/assert_exists/test_linter.lean | 3634b88061c4e46bde977ec4d64d082e5166dbd2 | [
"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 | 649 | lean | import tactic.assert_exists
import tactic.lint
/-! ### Test `assert_not_exists` -/
assert_not_exists foo
def foo : nat := 1
assert_not_exists bar
run_cmd do
(_, s) ← lint tt lint_verbosity.medium [`assert_not_exists.linter] tt,
guard $ "/- `bar` does not ever exist -/\n".is_suffix_of s.to_string
/-! ### Test ... |
c7f72e59da1087bff5a31d9ff77fcd3cd2582084 | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /src/game/world5/level5.lean | f0fb10571a6fa9b935fd53573e5350e1bc6e29b0 | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 2,370 | lean | /-
# Function world.
## Level 5 : `P → (Q → P)`.
In this level, our goal is to construct a function, like in level 2.
```
⊢ P → (Q → P)
```
So $P$ and $Q$ are sets, and our goal is to construct a function
which takes an element of $P$ and outputs a function from $Q$ to $P$.
We don't know anything at all about the ... |
9128466a3fc3cedb26d2b6644b28e7a62d9b4ee8 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/measure_theory/function/continuous_map_dense.lean | 2da80841f71db325d6ebbfaaa0a6a60510a9ee92 | [
"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 | 10,169 | lean | /-
Copyright (c) 2021 Heather Macbeth. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Heather Macbeth
-/
import measure_theory.measure.regular
import measure_theory.function.simple_func_dense
import topology.urysohns_lemma
/-!
# Approximation in Lᵖ by continuous func... |
fd9b36836919f2ce1a4ae010d05c1e797ab41c3e | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/interactive/hole5.lean | 1e6bddb0ce7a3dc8af4d7bf81030e85cc02d0cf3 | [
"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 | 234 | lean | @[hole_command] meta def foo : hole_command :=
{ name := "a b", descr := "foobarbaz", action := λ _, failure }
--^ "command": "all_hole_commands"
def x : nat → nat :=
λ a, {! a + a !}
--^ "command": "hole", "action": "a b"
|
7b09b0e82c22cfeccd42970e2f24d0f073f05e17 | 976d2334b51721ddc405deb2e1754016d454286e | /src/game_files/sqrt2/two_div.lean | 5a015cbf7231e6d2d5883b911e6296edc4841c0d | [] | no_license | kbuzzard/lean-at-MC2020 | 11bb6ac9ec38a6caace9d5d9a1705d6794d9f477 | 1f7ca65a7ba5cc17eb49f525c02dc6b0e65d6543 | refs/heads/master | 1,668,496,422,317 | 1,594,131,838,000 | 1,594,131,838,000 | 277,877,735 | 0 | 0 | null | 1,594,142,006,000 | 1,594,142,005,000 | null | UTF-8 | Lean | false | false | 173 | lean | -- Level name : name_of_the_level
/-
Comment here
-/
/- Hint : title_of_the_hint
Content of the hint
-/
/- Lemma
Description of the lemma
-/
lemma ... :=
begin
...
end |
190b947659622d309146bb23e12064908a6bcd2c | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/measure/outer_measure.lean | 7b1077ebef4d001e395f55d84547428bb82be3f7 | [
"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 | 66,025 | 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 analysis.specific_limits.basic
import measure_theory.pi_system
import data.countable.basic
import data.fin.vec_notation
import topology.algebra... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.