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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3486e050256b444d9e1baac914b43a638f80cb45 | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/nat/exp.lean | c0d1cc177eb77a361bf7252e13d9d583d5cf533e | [
"Apache-2.0"
] | permissive | digama0/lean-protocol-support | eaa7e6f8b8e0d5bbfff1f7f52bfb79a3b11b0f59 | cabfa3abedbdd6fdca6e2da6fbbf91a13ed48dda | refs/heads/master | 1,625,421,450,627 | 1,506,035,462,000 | 1,506,035,462,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,792 | lean | /-
This module defines an exponentiation function where the exponent
is a natural number, and the base is a monoid.
It uses an efficient sum of squares method to support large exponents.
-/
import .simplify_eq
universe u
namespace nat
section exp
parameter {α : Type u}
parameter [inst : monoid α]
include inst
d... |
daa5c1b2dca7121cd6ed0e8292caa9d1901628d3 | 500f65bb93c499cd35c3254d894d762208cae042 | /src/category/traversable/basic.lean | ea0860feee26638ea9f00c0eb1cd9cf01ea10b07 | [
"Apache-2.0"
] | permissive | PatrickMassot/mathlib | c39dc0ff18bbde42f1c93a1642f6e429adad538c | 45df75b3c9da159fe3192fa7f769dfbec0bd6bda | refs/heads/master | 1,623,168,646,390 | 1,566,940,765,000 | 1,566,940,765,000 | 115,220,590 | 0 | 1 | null | 1,514,061,524,000 | 1,514,061,524,000 | null | UTF-8 | Lean | false | false | 5,608 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Simon Hudon
-/
import tactic.cache
import category.applicative
/-!
# Traversable type class
Type classes for traversing collections. The concepts and laws are taken from
http://hackage.... |
d73ee30ffdddef6fc360dd01ca4cb71cc099f0ff | 86f6f4f8d827a196a32bfc646234b73328aeb306 | /examples/logic/unnamed_1405.lean | 47d54b7c915a42cc9201e31801d8b2053ec31eb1 | [] | no_license | jamescheuk91/mathematics_in_lean | 09f1f87d2b0dce53464ff0cbe592c568ff59cf5e | 4452499264e2975bca2f42565c0925506ba5dda3 | refs/heads/master | 1,679,716,410,967 | 1,613,957,947,000 | 1,613,957,947,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 418 | lean | import data.real.basic
def fn_ub (f : ℝ → ℝ) (a : ℝ) : Prop := ∀ x, f x ≤ a
def fn_has_ub (f : ℝ → ℝ) := ∃ a, fn_ub f a
open_locale classical
variable (f : ℝ → ℝ)
-- BEGIN
example (h : ¬ fn_has_ub f) : ∀ a, ∃ x, f x > a :=
begin
contrapose! h,
exact h
end
example (x : ℝ) (h : ∀ ε > 0, x ≤ ε) : x ≤ 0 :=
begin
... |
48e3fdf1f47cb36cc713b42f53d945d58ed18e62 | 43390109ab88557e6090f3245c47479c123ee500 | /src/M1P2/sheet_8.lean | 5dec8c9ce02836be5b27f0f4d17e24bb3ddf23b7 | [
"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 | 2,113 | lean | import algebra.ring algebra.group_power data.nat.prime data.nat.prime data.nat.basic data.int.modeq algebra.group_power group_theory.subgroup algebra.group data.set.basic
open nat
variables {R : Type*} [ring R]
-- 1. (a) Suppose n > 1 is a power of a prime number. Give a formula for the number of elements in the group... |
defd7fac953b79b11dde7a86021a8b5f6eed0c77 | 367134ba5a65885e863bdc4507601606690974c1 | /src/algebra/category/Module/abelian.lean | 39d78be0584d1981c2e203a2ada3563e73e64e4a | [
"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 | 3,318 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import algebra.category.Module.kernels
import algebra.category.Module.limits
import category_theory.abelian.exact
/-!
# The category of left R-modules is abelian.
Add... |
40b6d0d00666c59190730abcab48d909a9a7cdbf | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /stage0/src/Lean/Parser/Basic.lean | 791ed6a18c5f2d4fb5b6622e70c3f5d64a777cc3 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 70,098 | 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
-/
/-!
# Basic Lean parser infrastructure
The Lean parser was developed with the following primary goals in mind:
* flexibility: Lean's g... |
803ea9f81fc1ae5fc84728c12b0933445930c6c8 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/ring_theory/witt_vector/basic.lean | 92143c761e0e82fda82f4c6cc55a0be81dcbfc1d | [
"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,409 | lean | /-
Copyright (c) 2020 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin, Robert Y. Lewis
-/
import data.mv_polynomial.counit
import data.mv_polynomial.invertible
import ring_theory.witt_vector.defs
/-!
# Witt vectors
This file verifies th... |
4079f90fb18847bca1174609b4a87b39eaa957a9 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/run/match2.lean | 493a05216e30683b17b7243aa5f5b08c6cee3c24 | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 280 | lean | inductive imf (f : nat → nat) : nat → Type
| mk1 : ∀ (a : nat), imf (f a)
| mk2 : imf (f 0 + 1)
definition inv_2 (f : nat → nat) : ∀ (b : nat), imf f b → {x : nat // x > b} → nat
| .(f a) (imf.mk1 .(f) a) x := a
| .(f 0 + 1) (imf.mk2 .(f)) x := subtype.val x
|
eabd8f4876cfa3ac56b2d31aba62d623bd7e4b72 | fe25de614feb5587799621c41487aaee0d083b08 | /src/Lean/Parser/Command.lean | fc49da29437ee75b1bfc4bed46d06cb72d35b03a | [
"Apache-2.0"
] | permissive | pollend/lean4 | e8469c2f5fb8779b773618c3267883cf21fb9fac | c913886938c4b3b83238a3f99673c6c5a9cec270 | refs/heads/master | 1,687,973,251,481 | 1,628,039,739,000 | 1,628,039,739,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 9,862 | 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.Parser.Term
import Lean.Parser.Do
namespace Lean
namespace Parser
/--
Syntax quotation for terms and (lists of) commands.... |
2509bbe66762db3399cb9f58cfef7e2900e36d33 | 88fb7558b0636ec6b181f2a548ac11ad3919f8a5 | /tests/lean/run/eval_constant.lean | 3a27af08d3376693e041a17b1e4747d279c60d16 | [
"Apache-2.0"
] | permissive | moritayasuaki/lean | 9f666c323cb6fa1f31ac597d777914aed41e3b7a | ae96ebf6ee953088c235ff7ae0e8c95066ba8001 | refs/heads/master | 1,611,135,440,814 | 1,493,852,869,000 | 1,493,852,869,000 | 90,269,903 | 0 | 0 | null | 1,493,906,291,000 | 1,493,906,291,000 | null | UTF-8 | Lean | false | false | 242 | lean | open tactic
run_cmd do
e ← to_expr `(nat.add),
fn ← eval_expr (nat → nat → nat) e,
trace (fn 10 20)
run_cmd do
e ← to_expr `(λ x y : nat, x + x + y),
fn ← eval_expr (nat → nat → nat) e,
trace (fn 10 20)
|
cd0db63568b34c1dc7e5b3637ea020af2a569d36 | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/data/set/intervals/basic.lean | acd0f4d3f4e7f969f372db261ebf9516edd4cf00 | [
"Apache-2.0"
] | permissive | dupuisf/mathlib | 62de4ec6544bf3b79086afd27b6529acfaf2c1bb | 8582b06b0a5d06c33ee07d0bdf7c646cae22cf36 | refs/heads/master | 1,669,494,854,016 | 1,595,692,409,000 | 1,595,692,409,000 | 272,046,630 | 0 | 0 | Apache-2.0 | 1,592,066,143,000 | 1,592,066,142,000 | null | UTF-8 | Lean | false | false | 30,916 | 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, Patrick Massot, Yury Kudryashov
-/
import algebra.order_functions
import data.set.basic
/-!
# Intervals
In any preorder `α`, we define intervals (whic... |
88bbd021ddc89a7de8679552b1ec9183181c45c5 | 9ee042bf34eebe0464f0f80c0db14ceb048dab10 | /src/Lean/Elab/PreDefinition/WF/PackMutual.lean | 5cba177731bcf8f6e51a8a3c6c9188c5aefd0176 | [
"Apache-2.0"
] | permissive | dexmagic/lean4 | 7507e7b07dc9f49db45df5ebd011886367dc2a6c | 48764b60d5bac337eaff4bf8a3d63a216e1d9e03 | refs/heads/master | 1,692,156,265,016 | 1,633,276,980,000 | 1,633,339,480,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 6,284 | 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.PreDefinition.Basic
namespace Lean.Elab.WF
open Meta
private def getDomains (preDefs : Array PreDefinition) : Array Expr :=
preDefs.map... |
86db4d83ef1c1e0d110dfa9cf94e9ab20ce624ff | c31182a012eec69da0a1f6c05f42b0f0717d212d | /src/polyhedral_lattice/int.lean | ba5ebeb1dd97bb5d68ecd9af34bd5f285827124f | [] | 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 | 1,145 | lean | import analysis.normed_space.int
import polyhedral_lattice.basic
/-!
# The integers are a polyhedral lattice.
The integers, with its usual norm, are a polyhedral lattice.
-/
noncomputable theory
open_locale big_operators
lemma int.sum_units_to_nat_smul (n : ℤ) :
∑ (i : units ℤ), int.to_nat (i * n) • (i : ℤ) = ... |
318f23a69eff63460a2b673937cb3be3b730ac74 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/matchunit.lean | bfed4ce66f3200c9ae3d5359504882ce21609ac8 | [
"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 | 149 | lean | def f (a : Unit) : Nat :=
match a with
| PUnit.unit => 10
#print f
def g (a : Unit) : Unit :=
match a with
| b@(PUnit.unit) => b
#print g
|
e17fe7a472dbc6c5618a184cc5a0a4f79896d839 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/blast_back2.lean | 50924336cc51243bff25101f69b349d5e0719ee7 | [
"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 | 457 | lean | constant r : nat → Prop
constant s : nat → Prop
constant p : nat → Prop
definition q (a : nat) := p a
lemma rq₁ [intro] [priority 20] : ∀ a, r a → q a :=
sorry
lemma rq₂ [intro] [priority 10] : ∀ a, s a → q a :=
sorry
attribute q [reducible]
definition lemma1 (a : nat) : r a → s a → p a :=
by blast
print lemma1
... |
5c1cc979eef91538e45dd3bc81f3eb6831140bae | 646fc4b41ca4adb82b3f7fbae3ea3c58ff496b4c | /Example.lean | 6fd16f2c1557f98e27a1e6e9b125d4f0a44098ca | [] | no_license | cpehle/lean4-plugin-example | 82e63420463483381c91de0705b5626a336863fa | d32d3b310645cfecf4c33acafe996755f67cf30b | refs/heads/main | 1,690,367,192,612 | 1,631,531,751,000 | 1,631,531,751,000 | 405,148,785 | 2 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 21 | lean | import Example.Basic
|
3a0064d141e53fa8cd99d5bc801081046bd45ea3 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/group/type_tags.lean | d03b666e93413d51f54eebe3bc4801168ce7bda7 | [
"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,202 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import algebra.hom.group
import logic.equiv.defs
import data.finite.defs
/-!
# Type tags that turn additive structures into multiplicative, and vice versa
We define ... |
205ab2082955c2f074c88ff6aca22029d7e49345 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/algebra/category/Mon/limits_auto.lean | ba50161d465332527105a4bf53dbeae4b6403a1b | [] | 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 | 8,859 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.algebra.group.pi
import Mathlib.algebra.category.Mon.basic
import Mathlib.group_theory.subm... |
f5b0f91c263ed6be9508e83f6b5ebbd1dd7aaa91 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/matchErrorLocation.lean | 671b9c10475d3470c594e07da451213b9623c10d | [
"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 | cipher1024/lean4 | 6e1f98bb58e7a92b28f5364eb38a14c8d0aae393 | 69114d3b50806264ef35b57394391c3e738a9822 | refs/heads/master | 1,642,227,983,603 | 1,642,011,696,000 | 1,642,011,696,000 | 228,607,691 | 0 | 0 | Apache-2.0 | 1,576,584,269,000 | 1,576,584,268,000 | null | UTF-8 | Lean | false | false | 107 | lean |
def head {α} (xs : List α) (h : xs = [] → False) : α :=
match he:xs with
| [] => h he
| x::_ => x
|
b1e20804d1b37e3372d2c3d8348009ee4d763a35 | 8b9f17008684d796c8022dab552e42f0cb6fb347 | /library/data/subtype.lean | 314a76deb87d0b2926e4dde136568f8dfa116b0a | [
"Apache-2.0"
] | permissive | chubbymaggie/lean | 0d06ae25f9dd396306fb02190e89422ea94afd7b | d2c7b5c31928c98f545b16420d37842c43b4ae9a | refs/heads/master | 1,611,313,622,901 | 1,430,266,839,000 | 1,430,267,083,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,279 | lean | /-
Copyright (c) 2014 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Module: data.subtype
Author: Leonardo de Moura, Jeremy Avigad
-/
open decidable
set_option structure.proj_mk_thm true
structure subtype {A : Type} (P : A → Prop) :=
tag :: (elt_of : ... |
f5eec24b389dc4f1ff2fb5c42ffa3120620563e5 | a721fe7446524f18ba361625fc01033d9c8b7a78 | /src/principia/real/cau_seq.lean | cbe27102f9721e01ab311d2df5acba84c2c09c18 | [] | no_license | Sterrs/leaning | 8fd80d1f0a6117a220bb2e57ece639b9a63deadc | 3901cc953694b33adda86cb88ca30ba99594db31 | refs/heads/master | 1,627,023,822,744 | 1,616,515,221,000 | 1,616,515,221,000 | 245,512,190 | 2 | 0 | null | 1,616,429,050,000 | 1,583,527,118,000 | Lean | UTF-8 | Lean | false | false | 6,638 | lean | import ..myrat.le
import ..myring.order
import ..mynat.max
import ..sequence
namespace hidden
open myring
open ordered_myring
open myfield
open ordered_myfield
def is_cau_seq (f : sequence myrat) : Prop :=
∀ ε : myrat, 0 < ε → ∃ N : mynat, ∀ n m : mynat,
N ≤ n → N ≤ m → abs (f m - f n) < ε
-- Create the type of Cau... |
a12be41b29e9b5d9943c7aab8dcba03936f8eebf | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/try_for_heap.lean | 85db58b7d580cc28bb7d534980a146c28b53c00e | [
"Apache-2.0"
] | permissive | GaloisInc/lean | aa1e64d604051e602fcf4610061314b9a37ab8cd | f1ec117a24459b59c6ff9e56a1d09d9e9e60a6c0 | refs/heads/master | 1,592,202,909,807 | 1,504,624,387,000 | 1,504,624,387,000 | 75,319,626 | 2 | 1 | Apache-2.0 | 1,539,290,164,000 | 1,480,616,104,000 | C++ | UTF-8 | Lean | false | false | 2,067 | lean | constant heap : Type
constant ptr : Type
constant val : Type
constant pt : ptr → val → heap
constant hunion : heap → heap → heap
constant is_def : heap → Prop
infix `∙`:60 := hunion
infix `↣`:70 := pt
/-
constant hunion_is_assoc : is_associative heap hunion
constant hunion_is_comm : is_commutative heap h... |
4a159b7c447ec57e272ddef908543cc54b7e2704 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/group_theory/monoid_localization.lean | 348acf2a15e55bac933d7f1f1d70d4740662a0ed | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 54,848 | lean | /-
Copyright (c) 2019 Amelia Livingston. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Amelia Livingston
-/
import group_theory.congruence
import algebra.group.units
import algebra.punit_instances
/-!
# Localizations of commutative monoids
Localizing a commutative r... |
e647c86f3a9df0a518dd524517529283994e5e75 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/letRecMissingAnnotation.lean | f9e466efe2bb332e35924bb805394dcd36f878e8 | [
"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 | 234 | lean | def sum (as : Array Nat) : Nat :=
let rec go (i : Nat) (s : Nat) : Nat :=
if h : i < as.size then
go (i+2) (s + as.get ⟨i, h⟩) -- Error
else
s
go 0 0
termination_by' measure (fun ⟨i, _⟩ => as.size - i)
|
d216eca4e753bac0f8c913da850202e9e5c01013 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/conditionally_complete_lattice/group.lean | b9c5bcef8ad2c5ac90958a1fad04a37eeff578db | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 1,991 | lean | /-
Copyright (c) 2018 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 order.conditionally_complete_lattice.basic
import algebra.order.group.type_tags
/-!
# Conditionally complete lattices and groups.
> THIS FILE IS SYNCHR... |
18e1233246a074832d899e21c7b45c7b89180ad0 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /11_Tactic-Style_Proofs.org.30.lean | 1e476254d4749bddd51fff1fac8cf254325153e1 | [] | 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 | 236 | lean | import standard
import data.nat
open nat
check nat.sub_self
example (m n : nat) : m - n = 0 ∨ m ≠ n :=
begin
cases (decidable.em (m = n)) with [Heq, Hne],
{ apply eq.subst Heq,
exact or.inl (sub_self m)},
{ apply or.inr Hne }
end
|
fd32a32fabb5c6a7af1b5de2bbb27d016f8de9f7 | 50b3917f95cf9fe84639812ea0461b38f8f0dbe1 | /Examples/mario_glueing.lean | 77188f501c955c83bab9c7f72dee572f44ab5e21 | [] | no_license | roro47/xena | 6389bcd7dcf395656a2c85cfc90a4366e9b825bb | 237910190de38d6ff43694ffe3a9b68f79363e6c | refs/heads/master | 1,598,570,061,948 | 1,570,052,567,000 | 1,570,052,567,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 10,614 | lean | import mario_sheaf -- Mario's gist
universes u v
open lattice
variables {α : Type u} [semilattice_inf α]
variable (U : α)
--#print notation →⊓
--#check @semilattice_inf_hom
/-
class semilattice_inf (α : Type u) extends has_inf α, partial_order α :=
(inf_le_left : ∀ a b : α, a ⊓ b ≤ a)
(inf_le_right : ∀ a b : α, a... |
e0b1743f1733c50494f78be6861933909d92b581 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/deprecated/subgroup.lean | e1cd324e1a5f923f7a08a1563adb14d78399b09b | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 28,098 | 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, Mitchell Rowett, Scott Morrison, Johan Commelin, Mario Carneiro,
Michael Howes
-/
import group_theory.subgroup
import deprecated.submonoid
open set function
variabl... |
931734c33925f28fea8b4b646279fd9ff2d41543 | ca1ad81c8733787aba30f7a8d63f418508e12812 | /clfrags/src/hilbert/wr/ka_bot.lean | 0b6ce0aa83221d3c6f077ad2f1409e59f13f652d | [] | no_license | greati/hilbert-classical-fragments | 5cdbe07851e979c8a03c621a5efd4d24bbfa333a | 18a21ac6b2e890060eb4ae65752fc0245394d226 | refs/heads/master | 1,591,973,117,184 | 1,573,822,710,000 | 1,573,822,710,000 | 194,334,439 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 277 | lean | import core.connectives
import hilbert.wr.ka
namespace clfrags
namespace hilbert
namespace wr
namespace ka_bot
axiom kab₁ : Π {a b c : Prop}, ka b a bot → ka b a c
end ka_bot
end wr
end hilbert
end clfrags
|
129cc4767f35dcc94fbc527821445d7fc818262a | 246309748072bf9f8da313401699689ebbecd94d | /src/ring_theory/localization.lean | 0e4ffa72f881625a42a73b2b28f033ddf95e1840 | [
"Apache-2.0"
] | permissive | YJMD/mathlib | b703a641e5f32a996f7842f7c0043bab2b462ee2 | 7310eab9fa8c1b1229dca42682f1fa6bfb7dbbf9 | refs/heads/master | 1,670,714,479,314 | 1,599,035,445,000 | 1,599,035,445,000 | 292,279,930 | 0 | 0 | null | 1,599,050,561,000 | 1,599,050,560,000 | null | UTF-8 | Lean | false | false | 59,280 | lean | /-
Copyright (c) 2018 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Mario Carneiro, Johan Commelin, Amelia Livingston
-/
import data.equiv.ring
import group_theory.monoid_localization
import ring_theory.algebraic
/-!
# Localizations of commutat... |
dd4f02c1da5e208ab7a48f3b64cbda686f3b8e7b | c777c32c8e484e195053731103c5e52af26a25d1 | /src/measure_theory/function/lp_order.lean | fa528399bfcf18eeea301cf7b83bcb8721774522 | [
"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,466 | 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 analysis.normed.order.lattice
import measure_theory.function.lp_space
/-!
# Order related properties of Lp spaces
### Results
- `Lp E p μ` is an `ordered_add_co... |
270d8a1db32bf70700065f6c865f9cff2691994b | a6b711a4e8db20755026231f7ed529a9014b2b6d | /ZZ_IGNORE/RAW/dm_rat/dm_rat.lean | f02718f518324efbf6662af6916e1d817b4425be | [] | no_license | chaseboettner/cs-dm-1 | b67d4a7e86f56bce59d2af115503769749d423b2 | 80b35f2957ffaa45b8b7a4479a3570a2d6eb4db0 | refs/heads/master | 1,585,367,603,488 | 1,536,235,675,000 | 1,536,235,675,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 394 | lean | --fix imports, code is good
import .natural
import .integer
open natural
open integer
structure rational := mk_rational ::
(num : integer)
(denom : natural)
(pos : ¬ denom = O)
open rational
def zero_over_one := mk_rational (of_nat O) (S O) (by contradiction)
def one_half := mk_rational (of_nat (S O)) (S (S O)) (... |
91f20fbf5c7dc065207c7a08607d0c18bcb63ede | 491068d2ad28831e7dade8d6dff871c3e49d9431 | /hott/init/num.hlean | a38e9dd9369e4dca75ef432af7be6cd6171b0654 | [
"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 | 3,346 | 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 init.bool
open bool
definition pos_num.is_inhabited [instance] : inhabited pos_num :=
inhabited.mk pos_num.one
namespace pos_nu... |
5890828a7e33ecd55c00f4fc8438dac681a39eb7 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/monoidal/functor.lean | 9211029b454f992b7f5dfcf1cb50a99444e68da8 | [
"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 | 14,497 | lean | /-
Copyright (c) 2018 Michael Jendrusch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Michael Jendrusch, Scott Morrison, Bhavik Mehta
-/
import category_theory.monoidal.category
import category_theory.adjunction.basic
/-!
# (Lax) monoidal functors
A lax monoidal fu... |
ec1f2c53e51a9c50bcde2768c50400b12a7145be | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/linear_algebra/matrix/to_lin.lean | 45e7a9858988946e6e7bf184e5b25eb19dd0dfe8 | [
"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 | 35,453 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import data.matrix.block
import data.matrix.notation
import linear_algebra.matrix.finite_dimensional
import linear_algebra.s... |
b0cdeb4765b1281f922a77a2700293db5440b67b | 96e0c08045ccd89f1e6556c1437c2ba0f560218b | /src/main.lean | 183231d4bd743d03a0c8e770491b38ed73eb829c | [] | no_license | JasonKYi/bilinear_sesquilinear_forms | 8fc78ea6716cc4b884c9ff7e27ddaa77bbd1f3f0 | d54ff4537426e180473c8091375df2e3e528693d | refs/heads/master | 1,678,081,159,270 | 1,613,904,502,000 | 1,613,904,502,000 | 329,987,442 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 17,418 | lean | import linear_algebra.bilinear_form
import algebra.invertible
import annihilator
-- import linear_algebra.direct_sum_module
open_locale classical
universes u v w
namespace bilin_form
variables {M : Type u} {R : Type v} [add_comm_group M] [ring R] [module R M]
/-- The perpendicular submodule of a submodule `N` is t... |
c3d3715ee234ca2073e19556acee505a15d51f36 | b70031c8e2c5337b91d7e70f1e0c5f528f7b0e77 | /src/analysis/normed_space/operator_norm.lean | ccac54a8e0d09a600686bfe37d9135dec3c453c9 | [
"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 | 42,876 | 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.riesz_lemma
import analysis.asymptotics
/-!
# Operator norm o... |
07a7aee9efed7251a6ba2518ab107f6894f3bb24 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/tactic/rewrite_search/explain.lean | 3eb86118bfb108b1e7caf9780ecdaaaede676bba | [
"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,769 | lean | /-
Copyright (c) 2020 Kevin Lacker, Keeley Hoek, Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Lacker, Keeley Hoek, Scott Morrison
-/
import tactic.rewrite_search.types
import tactic.converter.interactive -- Required for us to emit more compact ... |
320809795508ae686a2ec614575511424593c079 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/wfEqns4.lean | f2104eadab4b76c7848aed20ab9dbc60b7939154 | [
"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 | 985 | lean | import Lean
open Lean
open Lean.Meta
def tst (declName : Name) : MetaM Unit := do
IO.println (← getUnfoldEqnFor? declName)
mutual
def f : Nat → α → α → α
| 0, a, b => a
| n, a, b => g a n b |>.1
def g : α → Nat → α → (α × α)
| a, 0, b => (a, b)
| a, n, b => (h a b n, a)
def h : α → α → Nat →... |
a736cc2bce6c5836d1fc262d036557e21cd9fee5 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/set_theory/ordinal/arithmetic.lean | 5bfc553e3f012cf79d0b6c75c376e5fba33683ac | [
"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 | 97,796 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn, Violeta Hernández Palacios
-/
import set_theory.ordinal.basic
import tactic.by_contra
/-!
# Ordinal arithmetic
Ordinals have an addition (correspond... |
14d7df71920969e932948332b82d2030a4e98a09 | 367134ba5a65885e863bdc4507601606690974c1 | /src/ring_theory/tensor_product.lean | 5b90fad0faae3045fd6a57415a4ef4b4031248bc | [
"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 | 16,523 | 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 linear_algebra.tensor_product
import algebra.algebra.basic
/-!
# The tensor product of R-algebras
We construct the R-algebra structure on `A ⊗[R] B`, when `... |
e21cec66e12eabf88dcc380cd5cc32e74d0f9f04 | 4950bf76e5ae40ba9f8491647d0b6f228ddce173 | /src/data/polynomial/degree/definitions.lean | ec3620b7fdebda92750e0414fd22339d38bc2c69 | [
"Apache-2.0"
] | permissive | ntzwq/mathlib | ca50b21079b0a7c6781c34b62199a396dd00cee2 | 36eec1a98f22df82eaccd354a758ef8576af2a7f | refs/heads/master | 1,675,193,391,478 | 1,607,822,996,000 | 1,607,822,996,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36,084 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import data.polynomial.coeff
import data.nat.with_bot
/-!
# Theory of univariate polynomials
The definitions include
`de... |
0512185b6c7b5d27245a336825442f6714079b89 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/data/real/pi.lean | b1bd8148353ded908d1aa17a977700a04253fe4d | [
"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 | 19,463 | lean | /-
Copyright (c) 2019 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn, Benjamin Davidson
-/
import analysis.special_functions.integrals
/-!
# Pi
This file contains lemmas which establish bounds on or approximations of `real.pi`. Notab... |
a549303756d9f6cf90d090b18e41878a59778953 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/analysis/calculus/parametric_interval_integral.lean | 03a19aa2a3649cbb2125ba0eb1780aedab8dbf51 | [
"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 | 6,550 | lean | /-
Copyright (c) 2021 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.calculus.parametric_integral
import measure_theory.integral.interval_integral
/-!
# Derivatives of interval integrals depending on parameters
In t... |
2a822ecf4c3b376091089f13d7e8ee5afb42dcd2 | d450724ba99f5b50b57d244eb41fef9f6789db81 | /src/instructor/lectures/lecture_20.lean | 2983d542d9f002068ccc5952c92c65fef59a5af4 | [] | 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 | 8,871 | lean | import data.set
/-
The preceding import statement imports
definitions for set theory beyond those
that are included in the libraries that
are loaded by default when Lean starts.
-/
/-
We've now seen how sets correspond in
very close ways) to one-place predicates.
This correspondence allows us to "reduce"
the language... |
a52dcbbdd193ff27e065f28beefed669cc16907c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/structured_arrow.lean | 29df20ca72fdcdc58b09c8782fc1887a949c2a48 | [
"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 | 16,844 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam Topaz, Scott Morrison
-/
import category_theory.punit
import category_theory.comma
import category_theory.limits.shapes.terminal
import category_theory.essentially_small
/-!
# Th... |
af9d7aa61f3359971c3e9a5b0f5720b42d53b684 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/order/bounded_lattice.lean | 5026a6bca355ff8adceb0ebfcf9330731a973203 | [
"Apache-2.0"
] | permissive | kmill/mathlib | ea5a007b67ae4e9e18dd50d31d8aa60f650425ee | 1a419a9fea7b959317eddd556e1bb9639f4dcc05 | refs/heads/master | 1,668,578,197,719 | 1,593,629,163,000 | 1,593,629,163,000 | 276,482,939 | 0 | 0 | null | 1,593,637,960,000 | 1,593,637,959,000 | null | UTF-8 | Lean | false | false | 35,897 | 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
Defines bounded lattice type class hierarchy.
Includes the Prop and fun instances.
-/
import order.lattice
import data.option.basic
import tactic.pi_instances
import t... |
4dc2406915a67d35235bcb53bfd52c921613d95c | c1a29ca460720df88ab68dc42d9a1a02e029d505 | /examples/logic/unnamed_510.lean | 635ba594580fd9641eecc9afea436d1727f478f1 | [] | no_license | agusakov/mathematics_in_lean | acb5b3d659e4522ae4b4836ea550527f03f6546c | 2539562e4d91c858c73dbecb5b282ce1a7d38b6d | refs/heads/master | 1,665,963,365,241 | 1,592,080,022,000 | 1,592,080,022,000 | 272,078,062 | 0 | 0 | null | 1,592,078,772,000 | 1,592,078,772,000 | null | UTF-8 | Lean | false | false | 275 | lean | open function
-- BEGIN
variables {α : Type*} {β : Type*} {γ : Type*}
variables {g : β → γ} {f : α → β}
example (injg : injective g) (injf : injective f) :
injective (λ x, g (f x)) :=
begin
intros x₁ x₂ h,
apply injf,
apply injg,
apply h
end
-- END |
3201d78869ccc9fcf497dbb02a9cbfbd0be4789d | 0c1546a496eccfb56620165cad015f88d56190c5 | /library/init/meta/name.lean | 672658c79c7567acb4dc17f3a528d522528c3415 | [
"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 | 2,707 | 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.data.ordering init.coe
/- Reflect a C++ name object. The VM replaces it with the C++ implementation. -/
inductive name
| anonymous : n... |
2a61fa2989ca4709a1d865af965540d934e64974 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /tests/lean/run/bin_tree.lean | a3b75d664b2c40596dd4fd1e67fea4cfa807922e | [
"Apache-2.0"
] | permissive | jcarlson23/lean | b00098763291397e0ac76b37a2dd96bc013bd247 | 8de88701247f54d325edd46c0eed57aeacb64baf | refs/heads/master | 1,611,571,813,719 | 1,497,020,963,000 | 1,497,021,515,000 | 93,882,536 | 1 | 0 | null | 1,497,029,896,000 | 1,497,029,896,000 | null | UTF-8 | Lean | false | false | 966 | lean | def pairs_with_sum' : Π (m n) {d}, m + n = d → list {p : ℕ × ℕ // p.1 + p.2 = d}
| 0 n d h := [⟨(0, n), h⟩]
| (m+1) n d h := ⟨(m+1, n), h⟩ :: pairs_with_sum' m (n+1) (by simp at h; simp [h])
def pairs_with_sum (n) : list {p : ℕ × ℕ // p.1 + p.2 = n} :=
pairs_with_sum' n 0 rfl
inductive bin_tree
| leaf : bin_tree
... |
551a25e6523f51b240518d6ca2c35e87c100b4cd | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/sheaves/forget.lean | eaee0d1cd251178a10d84e7ccf716f52362a4079 | [] | 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 | 4,359 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.sheaves.sheaf
import Mathlib.category_theory.limits.preserves.shapes.products
impo... |
e1137dd6a85cff733c01eeeb77e3bfa2918ce83e | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/geometry/euclidean/oriented_angle.lean | 495b2159f92fa9e481271f515bea63746677c3ef | [
"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 | 59,778 | lean | /-
Copyright (c) 2022 Joseph Myers. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Joseph Myers
-/
import analysis.inner_product_space.orientation
import analysis.inner_product_space.pi_L2
import analysis.special_functions.complex.circle
import geometry.euclidean.basic... |
734dd45f49bf57a3f03998c4d03d06f8edfff4d3 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /tests/lean/run/tactic16.lean | 9afd251038746d2096f4668d7538e02938f78f32 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 317 | lean | import standard
using tactic
variable A : Type.{1}
variable f : A → A → A
theorem tst {a b c : A} (H1 : a = b) (H2 : b = c) : f a (f b b) = f b (f c c)
:= by discard (apply (subst H1)) 3; -- discard the first 3 solutions produced by apply
trace "after subst H1";
apply (subst H2);
apply refl
|
5014555580bad0c11c1f81bf37e3bb59d16b62fd | 076f5040b63237c6dd928c6401329ed5adcb0e44 | /assignments/hw9_extra_credit_exam_prep.lean | 21aa6aea14cc8871fb5f0ec52ef9f3f746855560 | [] | no_license | kevinsullivan/uva-cs-dm-f19 | 0f123689cf6cb078f263950b18382a7086bf30be | 09a950752884bd7ade4be33e9e89a2c4b1927167 | refs/heads/master | 1,594,771,841,541 | 1,575,853,850,000 | 1,575,853,850,000 | 205,433,890 | 4 | 9 | null | 1,571,592,121,000 | 1,567,188,539,000 | Lean | UTF-8 | Lean | false | false | 5,434 | lean | namespace hidden -- you can ignore this
/-
1a. Define a polymorphic tree type. A tree of objects of type α
is either empty or it is a value of type α along with two
smaller trees of the same kind. You can call them left and right
respectively.
-/
/-
1b.
Define a polymorphic function, is_empty, that takes a ... |
751638288482d93485846425873129b46c705367 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/preadditive/projective.lean | 9c6098ab570f83dd4fed9790385e1d97248380da | [
"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,568 | lean | /-
Copyright (c) 2020 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel, Scott Morrison
-/
import algebra.homology.exact
import category_theory.limits.shapes.biproducts
import category_theory.adjunction.limits
import category_theory.limits.pre... |
fe5fa967f6c27d67b070ba64c37b97a7d3470b05 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/algebra/uniform_ring.lean | bcda3bbbc3c498c122364cd4ffd558a00c6b5305 | [
"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,685 | 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
Theory of topological rings with uniform structure.
-/
import topology.algebra.group_completion
import topology.algebra.ring
open classical set filter ... |
bf033d9d96a46fe9d5d8fa03724eed71b01b49c2 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/algebra/char_p/algebra.lean | fa243cb834192a1b0f73588d2c15a2f7e7bd8d1f | [
"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 | 3,440 | lean | /-
Copyright (c) 2021 Jon Eugster. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jon Eugster, Eric Wieser
-/
import algebra.char_p.basic
import ring_theory.localization
import algebra.free_algebra
/-!
# Characteristics of algebras
In this file we describe the chara... |
088e6925208c154df6775dd4770756a667777a2a | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/algebra/continued_fractions/computation/translations.lean | eb859444ed2841ae324ef075e9f4b95aff9e87c3 | [
"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 | 10,521 | lean | /-
Copyright (c) 2020 Kevin Kappelmann. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Kappelmann
-/
import algebra.continued_fractions.computation.basic
import algebra.continued_fractions.translations
/-!
# Basic Translation Lemmas Between Structures Defined for... |
7f872153aaf652f9540d1a1888d35e2832cb299a | 4727251e0cd73359b15b664c3170e5d754078599 | /src/category_theory/monoidal/rigid/of_equivalence.lean | 567fa184962d70623557e2d54272e0f1da6e6a0b | [
"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 | 3,302 | lean | /-
Copyright (c) 2022 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.monoidal.rigid.basic
/-!
# Transport rigid structures over a monoidal equivalence.
-/
noncomputable theory
namespace category_theory
variab... |
1b3960aba203348194f70cc204e9431ed442486a | 07c6143268cfb72beccd1cc35735d424ebcb187b | /src/meta/expr.lean | 487ad61557cde5a30eb7843946c6db544bb471e0 | [
"Apache-2.0"
] | permissive | khoek/mathlib | bc49a842910af13a3c372748310e86467d1dc766 | aa55f8b50354b3e11ba64792dcb06cccb2d8ee28 | refs/heads/master | 1,588,232,063,837 | 1,587,304,803,000 | 1,587,304,803,000 | 176,688,517 | 0 | 0 | Apache-2.0 | 1,553,070,585,000 | 1,553,070,585,000 | null | UTF-8 | Lean | false | false | 27,674 | lean | /-
Copyright (c) 2019 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Simon Hudon, Scott Morrison, Keeley Hoek, Robert Y. Lewis
-/
import data.string.defs tactic.derive_inhabited
/-!
# Additional operations on expr and related types
Thi... |
2eacb46e2167b9fe9896fbe126f6d8f27b4f7b46 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/model_theory/types.lean | bcc49d9b00d113a00d805fdce1bf1b9ddb714037 | [
"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 | 7,745 | lean | /-
Copyright (c) 2022 Aaron Anderson. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Aaron Anderson
-/
import model_theory.satisfiability
/-!
# Type Spaces
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
T... |
d37c27de50852e39dd5c7bdcd0ad31b1cfa51c93 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/wfrecUnary.lean | a6c49a9bbe25080dd32b2539cfeb6884689db7ba | [
"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 | 192 | lean | def f (n : Nat) : Nat :=
if h : n = 0 then
1
else
2 * f (n-1)
termination_by' measure id
decreasing_by
simp [measure, id, invImage, InvImage, Nat.lt_wfRel]
apply Nat.pred_lt h
|
5425f32b90e72f79b938d95211a8ba189fafb8cb | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/run/fun.lean | bc27d5df658010eb2c70a54634da87f5e91d0d33 | [
"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 | 327 | lean | import logic
open function bool
constant f : num → bool
constant g : num → num
check f ∘ g ∘ g
check (id : num → num)
constant h : num → bool → num
check swap h
check swap h ff num.zero
check (swap h ff num.zero : num)
constant f1 : num → num → bool
constant f2 : bool → num
check (f1 on f2) ff tt
|
b024ce061d396bbb8e0901b66c81e042b3d7a561 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/linear_algebra/matrix/dual.lean | 46fc198a3949838d3af7fd97158c3044237dc425 | [
"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 | 1,593 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Patrick Massot, Casper Putz, Anne Baanen
-/
import linear_algebra.dual
import linear_algebra.matrix.to_lin
/-!
# Dual space, linear maps and matrices.
This file contai... |
29f26cdea307124ca6c50d265e5484774223ca46 | e5169dbb8b1bea3ec2a32737442bc91a4a94b46a | /hott/cubical/cube.hlean | 16e6824e324f034758cb6f6084f1a7faa491d42e | [
"Apache-2.0"
] | permissive | pazthor/lean | 733b775e3123f6bbd2c4f7ccb5b560b467b76800 | c923120db54276a22a75b12c69765765608a8e76 | refs/heads/master | 1,610,703,744,289 | 1,448,419,395,000 | 1,448,419,703,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,977 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Floris van Doorn
Cubes
-/
import .square
open equiv is_equiv
namespace eq
inductive cube {A : Type} {a₀₀₀ : A}
: Π{a₂₀₀ a₀₂₀ a₂₂₀ a₀₀₂ a₂₀₂ a₀₂₂ a₂₂₂ : A}
{p₁₀₀ : a₀... |
cfb2d9f382695a9bf352ff679851afb0018a02de | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Init/ShareCommon.lean | 7754d07f87cabfb8c6fe38e5f779caffe0ecdb0d | [
"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 | 4,416 | 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, Mario Carneiro
-/
prelude
import Init.Util
namespace ShareCommon
/-
The max sharing primitives are implemented internally.
They use maps and sets of Lean... |
9aca107f4685cc6384186050de0a752e01f732b1 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/Lean3Lib/init/meta/backward_auto.lean | 8b74a8164cab142ec1bbedcd5bc9f566ee2aa61a | [] | 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 | 335 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.meta.tactic
import Mathlib.Lean3Lib.init.meta.set_get_option_tactics
namespace Mathlib
namespace tacti... |
8e0cf5f9ef9403c236893f85636657c9aef23b89 | ae1e94c332e17c7dc7051ce976d5a9eebe7ab8a5 | /src/Lean/Elab/SyntheticMVars.lean | 9b1367ecc7486ca2da6a7b1486c60eedee3fd1c9 | [
"Apache-2.0"
] | permissive | dupuisf/lean4 | d082d13b01243e1de29ae680eefb476961221eef | 6a39c65bd28eb0e28c3870188f348c8914502718 | refs/heads/master | 1,676,948,755,391 | 1,610,665,114,000 | 1,610,665,114,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,493 | 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... |
81930e491a4750b176ff9a77c80ec0cbedcd9a12 | 4a092885406df4e441e9bb9065d9405dacb94cd8 | /src/for_mathlib/topological_groups.lean | f1505ec5f1988c280a9707acd85795ecf765bf53 | [
"Apache-2.0"
] | permissive | semorrison/lean-perfectoid-spaces | 78c1572cedbfae9c3e460d8aaf91de38616904d8 | bb4311dff45791170bcb1b6a983e2591bee88a19 | refs/heads/master | 1,588,841,765,494 | 1,554,805,620,000 | 1,554,805,620,000 | 180,353,546 | 0 | 1 | null | 1,554,809,880,000 | 1,554,809,880,000 | null | UTF-8 | Lean | false | false | 11,622 | lean | import tactic.abel
import topology.algebra.group
--import topology.algebra.uniform_ring
import for_mathlib.uniform_space.ring
import ring_theory.subring
import for_mathlib.topology
import for_mathlib.filter
universes u v
open filter set
section
variables {G : Type u} [add_comm_group G]
def prod_map {α₁ : Type*} {α... |
aaa582a0ff0d440540b0d91861c258d75aa343a7 | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/extra/616a.hlean | 0f6869261b740dc6913c7c23e3743d8c15bd3850 | [
"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 | 34 | hlean | attribute quotient.rec [recursor]
|
509235bd5c844261636c70fd740530e0cea5ebc0 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/complex/basic.lean | 315c45b7e0a8812c8a9db317680fea468eb91918 | [
"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 | 25,902 | lean | /-
Copyright (c) 2017 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Mario Carneiro
-/
import data.real.sqrt
/-!
# The complex numbers
The complex numbers are modelled as ℝ^2 in the obvious way and it is shown that they form a field
of c... |
59eeb06b74a29e9583c67434d5d3c3f4fde1ec49 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/big_operators/ring.lean | 6fee335bcd610654b6883ac19354535391b4d177 | [
"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,153 | 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.basic
import data.finset.pi
import data.finset.powerset
/-!
# Results about big operators with values in a (semi)ring
We prove results... |
1799cc250e7241aa1b65e418cfcf475d0ec5b348 | 5412d79aa1dc0b521605c38bef9f0d4557b5a29d | /src/Lean/Data/Position.lean | f351dcd5c1f31cd2d387cc00e27aa0c7925465a9 | [
"Apache-2.0"
] | permissive | smunix/lean4 | a450ec0927dc1c74816a1bf2818bf8600c9fc9bf | 3407202436c141e3243eafbecb4b8720599b970a | refs/heads/master | 1,676,334,875,188 | 1,610,128,510,000 | 1,610,128,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,233 | 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, Sebastian Ullrich
-/
import Lean.Data.Format
namespace Lean
structure Position where
line : Nat
column : Nat
deriving Inhabited, DecidableEq
namesp... |
c29ff701135000baa4ede83ef84655432297d76a | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/kdepends_on.lean | 6e77ab20a8378dd245658b44d3e9490c231ed72f | [
"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 | 301 | lean | open tactic
example (f : nat → nat) (a : nat) : f (f (a + 0)) = a → true :=
by do
t ← target,
s ← to_expr ```(f a),
b ← kdepends_on t s, guard ¬b,
b ← kdepends_on t s semireducible, guard b,
s ← to_expr ```(f (a + 0)),
b ← kdepends_on t s, guard b,
intros, constructor
|
8303ed670f7ac588020d0f0accbae8c0b1f4ee76 | 77c5b91fae1b966ddd1db969ba37b6f0e4901e88 | /src/data/nat/interval.lean | d6ffe65ca9d05dffc6520a698cfaec01e0e32bdf | [
"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 | 3,279 | lean | /-
Copyright (c) 2021 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import data.finset.interval
/-!
# Finite intervals of naturals
This file proves that `ℕ` is a `locally_finite_order` and calculates the cardinality of its
intervals as ... |
7d34a347776ebd6ed0f82496b633326571e43310 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/data/polynomial/field_division.lean | ee0ea3672e9e1fac115ac7d52c10eaa5da0d165c | [
"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 | 21,153 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Johannes Hölzl, Scott Morrison, Jens Wagemaker
-/
import algebra.gcd_monoid.basic
import data.polynomial.derivative
import data.polynomial.ring_division
import data.set.pai... |
638fdb9c2818e29a4fc64904d2a26688ccab3c9f | b2fe74b11b57d362c13326bc5651244f111fa6f4 | /src/topology/basic.lean | 01c8e68f017c4a293acf16fea0505e94a95d362c | [
"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 | 52,167 | 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, Jeremy Avigad
-/
import order.filter.ultrafilter
import order.filter.partial
noncomputable theory
/-!
# Basic theory of topological spaces.
The main ... |
f27ffa972edf8a6a292e8c7ab9272f9bf19e8273 | 3dd1b66af77106badae6edb1c4dea91a146ead30 | /library/standard/unit.lean | 46ecfc63f9c0fa89fbebadde020d122bf6e46dc3 | [
"Apache-2.0"
] | permissive | silky/lean | 79c20c15c93feef47bb659a2cc139b26f3614642 | df8b88dca2f8da1a422cb618cd476ef5be730546 | refs/heads/master | 1,610,737,587,697 | 1,406,574,534,000 | 1,406,574,534,000 | 22,362,176 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 545 | 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
import logic decidable
using decidable
namespace unit
inductive unit : Type :=
| star : unit
notation `⋆`:max := star
theorem unit_eq (a b : unit) : a ... |
0f846d41f4609eb581d4c1f547b3f4e297a8018e | 88892181780ff536a81e794003fe058062f06758 | /src/advent_of_code_2019/day1.lean | 066cc36101d4bdcb25c2939f57b32ea53bc5e9ac | [] | no_license | AtnNn/lean-sandbox | fe2c44280444e8bb8146ab8ac391c82b480c0a2e | 8c68afbdc09213173aef1be195da7a9a86060a97 | refs/heads/master | 1,623,004,395,876 | 1,579,969,507,000 | 1,579,969,507,000 | 146,666,368 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,003 | lean | import advent_of_code_2019.common
import tactic.norm_num
import tactic.suggest
import tactic.linarith
namespace day1
def fuel_required (mass : ℤ) : ℤ := (mass / 3) - 2
example : fuel_required 12 = 2 := by refl
example : fuel_required 14 = 2 := by refl
--example : fuel_required 1969 = 654 := by norm_num
--example : f... |
c4a692d946b9254cb2e0ee11a2f39e6e8890e19f | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /src/Init/Util.lean | 3584dba2118a9a06bc47bf6aad641e073b9577f6 | [
"Apache-2.0"
] | permissive | mhuisi/lean4 | 28d35a4febc2e251c7f05492e13f3b05d6f9b7af | dda44bc47f3e5d024508060dac2bcb59fd12e4c0 | refs/heads/master | 1,621,225,489,283 | 1,585,142,689,000 | 1,585,142,689,000 | 250,590,438 | 0 | 2 | Apache-2.0 | 1,602,443,220,000 | 1,585,327,814,000 | C | UTF-8 | Lean | false | false | 3,125 | 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.Data.String.Basic
import Init.Data.ToString
universes u v
/- debugging helper functions -/
@[neverExtract, extern "lean_dbg_trace"]
def... |
f26df0b279cbdbc5cb3598d43e63e70c1c6def13 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/data/finset.lean | 9b6e4383b86e4d559019d2dcf0494a7f7ef50617 | [
"Apache-2.0"
] | permissive | rspencer01/mathlib | b1e3afa5c121362ef0881012cc116513ab09f18c | c7d36292c6b9234dc40143c16288932ae38fdc12 | refs/heads/master | 1,595,010,346,708 | 1,567,511,503,000 | 1,567,511,503,000 | 206,071,681 | 0 | 0 | Apache-2.0 | 1,567,513,643,000 | 1,567,513,643,000 | null | UTF-8 | Lean | false | false | 87,057 | lean | /-
Copyright (c) 2015 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura, Jeremy Avigad, Minchao Wu, Mario Carneiro
Finite sets.
-/
import logic.embedding algebra.order_functions
data.multiset data.sigma.basic data.set.lattice
op... |
ba03e709ae69b6daf392203c470164113d0c3b2e | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/set/intervals/infinite.lean | 2851bcffdf423b0899b6da50aa970e3021be4ca8 | [
"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,664 | lean | /-
Copyright (c) 2020 Reid Barton. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton
-/
import data.set.finite
/-!
# Infinitude of intervals
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a corresponding PR to mathlib4.
Bounde... |
3bfd59569976eab1661cea0e2c29f8abc6d41117 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/category_theory/limits/limits.lean | 65b02fb46843c7135fa4f8f3ceeeb4980da394b4 | [
"Apache-2.0"
] | permissive | lacker/mathlib | f2439c743c4f8eb413ec589430c82d0f73b2d539 | ddf7563ac69d42cfa4a1bfe41db1fed521bd795f | refs/heads/master | 1,671,948,326,773 | 1,601,479,268,000 | 1,601,479,268,000 | 298,686,743 | 0 | 0 | Apache-2.0 | 1,601,070,794,000 | 1,601,070,794,000 | null | UTF-8 | Lean | false | false | 64,548 | lean | /-
Copyright (c) 2018 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Reid Barton, Mario Carneiro, Scott Morrison, Floris van Doorn
-/
import category_theory.adjunction.basic
import category_theory.limits.cones
import category_theory.reflects_isomorphism... |
3dffaab4e78c3db8c0a2f721873f65753403d65c | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/1878.lean | 2c981b354da3e0c9e033fa250ce1240b1bb8d723 | [
"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 | 404 | lean | import Lean
inductive Foo where
| a | b | c
namespace Foo
scoped instance (priority := 10) inst1 : Inhabited Foo :=
⟨.a⟩
instance inst2 : Inhabited Foo :=
⟨.b⟩
open Lean Meta
def test (declName : Name) : CoreM Unit := do
IO.println s!"{declName}, priority: {← getInstancePriority? declName}, kind: {← getIn... |
1e16ab95a6c1f21c959447a434df7749207b4e06 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/data/lazy_list/basic.lean | 639475b8fd0154d92ba6e679f6bdc59460551d5e | [
"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 | 7,745 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Traversable instance for lazy_lists.
-/
import control.traversable.equiv
import control.traversable.instances
import data.lazy_list
/-!
## Definitions on lazy lists
This fi... |
f5fee9ea01d69c02d6d4958d60e19eb08f08a653 | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/measure_theory/measure/haar_lebesgue.lean | 96aa919bff515fcee84289dc5bf55e9f09983195 | [
"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 | 1,161 | lean | /-
Copyright (c) 2021 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.measure.lebesgue
import measure_theory.measure.haar
/-!
# Relationship between the Haar and Lebesgue measures
We prove that the Haar measu... |
9f73eada5366cfcbdfadb411469e7d167163fa64 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/lean/run/deriv.lean | 660c5097655c8d9a10e9041f9598f730065e8ea6 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,756 | lean | /- Benchmark for new code generator -/
import Init.System.IO
new_frontend
inductive Expr
| Val : Int → Expr
| Var : String → Expr
| Add : Expr → Expr → Expr
| Mul : Expr → Expr → Expr
| Pow : Expr → Expr → Expr
| Ln : Expr → Expr
open Expr
unsafe def pown : Int → Int → Int
| a, 0 => 1
| a, 1 => a
| a, n =>
let b ... |
ccb22e96521f55d815b20882d4c742b0a0b551c7 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/data/nat/sub.lean | 1624b43c52f801645325227d2bfbd688eb82461d | [
"Apache-2.0"
] | permissive | codyroux/lean | 7f8dff750722c5382bdd0a9a9275dc4bb2c58dd3 | 0cca265db19f7296531e339192e9b9bae4a31f8b | refs/heads/master | 1,610,909,964,159 | 1,407,084,399,000 | 1,416,857,075,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,615 | 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
-- data.nat.sub
-- ============
--
-- Subtraction on the natural numbers, as well as min, max, and distance.
import .order
import tools.fake_simplifier
op... |
849409f88c12ac3af974f7d36d6f8fc411dd1fe0 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/phashmap_inst_coherence.lean | 5d04564780b815f4a417d5dea3886a8c8d76d95b | [
"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 | 368 | lean | import Std.Data.PersistentHashMap
open Std
def m : PersistentHashMap Nat Nat :=
let m : PersistentHashMap Nat Nat := {};
m.insert 1 1
def natDiffHash : Hashable Nat :=
⟨fun n => USize.ofNat $ n+10⟩
-- The following example should fail since the `Hashable` instance used to create `m` is not `natDiffHash`
#eval @Persis... |
70e68cdf82faec4bb7b24060e5fec71f2c8d1974 | 947b78d97130d56365ae2ec264df196ce769371a | /tests/compiler/expr.lean | bc0c7f18d5760e9ed52a5134eb7e75a98252efb3 | [
"Apache-2.0"
] | permissive | shyamalschandra/lean4 | 27044812be8698f0c79147615b1d5090b9f4b037 | 6e7a883b21eaf62831e8111b251dc9b18f40e604 | refs/heads/master | 1,671,417,126,371 | 1,601,859,995,000 | 1,601,860,020,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 194 | lean | import Lean
open Lean
def main : IO UInt32 :=
do
let e := mkAppN (mkConst `f) #[mkConst `a, mkConst `b];
IO.println e;
IO.println ("hash: " ++ toString e.hash);
IO.println e.getAppArgs;
pure 0
|
41c25777bd111740f1d96d1b36a2b973cc2bcb75 | d1bbf1801b3dcb214451d48214589f511061da63 | /src/analysis/normed_space/inner_product.lean | dc2d00d3473a0392630e250c405e05a834ef42d4 | [
"Apache-2.0"
] | permissive | cheraghchi/mathlib | 5c366f8c4f8e66973b60c37881889da8390cab86 | f29d1c3038422168fbbdb2526abf7c0ff13e86db | refs/heads/master | 1,676,577,831,283 | 1,610,894,638,000 | 1,610,894,638,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 100,615 | lean | /-
Copyright (c) 2019 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou, Sébastien Gouëzel, Frédéric Dupuis, Heather Macbeth
-/
import linear_algebra.bilinear_form
import linear_algebra.sesquilinear_form
import topology.metric_space.pi_Lp
imp... |
7502349b3078867753cf713bd315145be9de4ef7 | e0f9ba56b7fedc16ef8697f6caeef5898b435143 | /src/data/nat/sqrt.lean | ae45a7495c55d2dc1e40cbdb1166d5efa62804f5 | [
"Apache-2.0"
] | permissive | anrddh/mathlib | 6a374da53c7e3a35cb0298b0cd67824efef362b4 | a4266a01d2dcb10de19369307c986d038c7bb6a6 | refs/heads/master | 1,656,710,827,909 | 1,589,560,456,000 | 1,589,560,456,000 | 264,271,800 | 0 | 0 | Apache-2.0 | 1,589,568,062,000 | 1,589,568,061,000 | null | UTF-8 | Lean | false | false | 6,939 | 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, Johannes Hölzl, Mario Carneiro
An efficient binary implementation of a (sqrt n) function that
returns s s.t.
s*s ≤ n ≤ s*s + s + s
-/
import data.nat.bas... |
8d2a2153638cf1e4d2470c778f83e011d9a98d2e | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/monad/equiv_mon.lean | e812f78f1eda5d25022c9b919010eced6ade3299 | [
"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 | 3,583 | 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.bundled
import category_theory.monoidal.End
import category_theory.monoidal.Mon_
import category_theory.category.Cat
/-!
# The equivalence betw... |
34792bdf84a693e4ec94334bc611675833cbe7db | 137c667471a40116a7afd7261f030b30180468c2 | /src/category_theory/abelian/basic.lean | faa86294b7f38e0420adbd1cdfb1cc73ce275047 | [
"Apache-2.0"
] | permissive | bragadeesh153/mathlib | 46bf814cfb1eecb34b5d1549b9117dc60f657792 | b577bb2cd1f96eb47031878256856020b76f73cd | refs/heads/master | 1,687,435,188,334 | 1,626,384,207,000 | 1,626,384,207,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 25,527 | 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.limits.constructions.pullbacks
import category_theory.limits.shapes.biproducts
import category_theory.limits.shapes.images
import category_theor... |
2d6cd7c15bf40b8bb84d702ec768e2203964d977 | a45212b1526d532e6e83c44ddca6a05795113ddc | /src/linear_algebra/finsupp.lean | 7b40fd542207f45d9b8ba937fd424256066ae6fd | [
"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 | 14,107 | 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
Linear structures on function with finit support `α →₀ β` and multivariate polynomials.
-/
import data.finsupp data.mv_polynomial
import linear_algebra.dimension
noncomp... |
13e2345aa976f57a889a3af290a71c982d89f616 | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/analysis/analytic/basic.lean | 72e87bae62483acb46df3488e6fd2c349826b7fa | [
"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 | 51,320 | 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, Yury Kudryashov
-/
import analysis.calculus.formal_multilinear_series
import data.equiv.fin
/-!
# Analytic functions
A function is analytic in one dimension aro... |
3bb80fdf044f47d3bd3744c9eebbe3c6b6b636f2 | 2d34dfb0a1cc250584282618dc10ea03d3fa858e | /src/breen_deligne.lean | 78b985fe37a27b1b3303ff5463e42d1ee9a27502 | [] | no_license | zeta1999/lean-liquid | 61e294ec5adae959d8ee1b65d015775484ff58c2 | 96bb0fa3afc3b451bcd1fb7d974348de2f290541 | refs/heads/master | 1,676,579,150,248 | 1,610,771,445,000 | 1,610,771,445,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 12,222 | lean | import linear_algebra.matrix
import group_theory.free_abelian_group
import algebra.direct_sum
import algebra.big_operators.finsupp
import prereqs
import type_pow
/-!
# Breen-Deligne resolutions
Reference:
https://www.math.uni-bonn.de/people/scholze/Condensed.pdf#section*.4
("Appendix to Lecture IV", p. 28)
We forma... |
3dfc6f9972c33d777a0f36e02f0fe7b379b8ab67 | 969dbdfed67fda40a6f5a2b4f8c4a3c7dc01e0fb | /src/topology/metric_space/gromov_hausdorff_realized.lean | bdce8c37b26fa83dcb65da3e45acf058e450663d | [
"Apache-2.0"
] | permissive | SAAluthwela/mathlib | 62044349d72dd63983a8500214736aa7779634d3 | 83a4b8b990907291421de54a78988c024dc8a552 | refs/heads/master | 1,679,433,873,417 | 1,615,998,031,000 | 1,615,998,031,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 26,253 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sébastien Gouëzel
Construction of a good coupling between nonempty compact metric spaces, minimizing
their Hausdorff distance. This construction is instrumental to study the Gromov-... |
d95dfc5b0fb4624281f5d5c90b12a2d8b52c810d | 2d787ac9a5ab28a7d164cd13cee8a3cdc1e4680a | /src/my_exercises/07bis_abstract_negations.lean | 3f9d02c20ed299ebcf68491a8605a8393d52635c | [
"Apache-2.0"
] | permissive | paulzfm/lean3-tutorials | 8c113ec2c9494d401c8a877f094db93e5a631fd6 | f41baf1c62c251976ec8dd9ccae9e85ec4c4d336 | refs/heads/master | 1,679,267,488,532 | 1,614,782,461,000 | 1,614,782,461,000 | 344,157,026 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,445 | lean | import data.real.basic
open_locale classical
/-
Theoretical negations.
This file is for people interested in logic who want to fully understand
negations.
Here we don't use `contrapose` or `push_neg`. The goal is to prove lemmas
that are used by those tactics. Of course we can use
`exfalso`, `by_contradiction` and ... |
8ff8141725ad9db33ea571b6d7023f415b11437d | 2eab05920d6eeb06665e1a6df77b3157354316ad | /src/algebra/lie/basic.lean | c0be2e4fea34a611ae46d736199842b8a9eb4fe2 | [
"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 | 27,628 | lean | /-
Copyright (c) 2019 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.bracket
import algebra.algebra.basic
import tactic.noncomm_ring
/-!
# Lie algebras
This file defines Lie rings and Lie algebras over a commutative ring togeth... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.