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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b28c16363e057e5d87cf7350aaff80b738bc82b8 | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /src/Lean/Elab/Frontend.lean | cd0a193f7c2426b8ce12b5105964050569781352 | [
"Apache-2.0"
] | permissive | gebner/lean4-old | a4129a041af2d4d12afb3a8d4deedabde727719b | ee51cdfaf63ee313c914d83264f91f414a0e3b6e | refs/heads/master | 1,683,628,606,745 | 1,622,651,300,000 | 1,622,654,405,000 | 142,608,821 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 4,708 | lean | /-
Copyright (c) 2019 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
import Lean.Elab.Import
import Lean.Elab.Command
import Lean.Util.Profile
namespace Lean.Elab.Frontend
structure State where
commandS... |
841423be76185c90e6b911b1c753a3a2078bc114 | 3f7026ea8bef0825ca0339a275c03b911baef64d | /src/linear_algebra/basic.lean | 9a2fc76398f71db926e263c9549e69e7b4e0ed2b | [
"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 | 64,391 | 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, Kevin Buzzard
Basics of linear algebra. This sets up the "categorical/lattice structure" of
modules, submodules, and linear maps.
-/
import algebra.pi... |
5a031048c646a0bd8f1dc41c016bfe171a9aba96 | 88892181780ff536a81e794003fe058062f06758 | /src/xena_challenge/challenge07.lean | d38da5d50a218626271b4126f437c1b5d0b8390a | [] | 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 | 260 | lean | import data.rat.basic tactic
-- prove one and delete the other
theorem some_reciprocal_is_zero : ∃ x : ℚ, 1 / x = 0 :=
begin
use 0,
refl -- cf. nat.inv
end
-- theorem no_reciprocal_is_zero : ¬ (∃ x : ℚ, 1 / x = 0) :=
-- begin
-- sorry
-- end
|
e73a78d570afb94cca1b6ba98a76a030342d1e25 | 54d7e71c3616d331b2ec3845d31deb08f3ff1dea | /library/init/native/default.lean | d891f998ac4bc88f08f2c2ee60885db037b4ea6c | [
"Apache-2.0"
] | permissive | pachugupta/lean | 6f3305c4292288311cc4ab4550060b17d49ffb1d | 0d02136a09ac4cf27b5c88361750e38e1f485a1a | refs/heads/master | 1,611,110,653,606 | 1,493,130,117,000 | 1,493,167,649,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 23,768 | lean | /-
Copyright (c) 2016 Jared Roesch. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jared Roesch
-/
prelude
import init.meta.format
import init.meta.expr
import init.category.state
import init.data.string
import init.data.list.instances
import init.native.ir
import in... |
4008b2497ee04ac7eb653feb7a04f76b27f5a154 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/analysis/special_functions/pow.lean | 84707b442a97419cf44a517a7d3da38724130edd | [
"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 | 70,642 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Abhimanyu Pallavi Sudhir, Jean Lo, Calle Sönne, Sébastien Gouëzel,
Rémy Degenne
-/
import analysis.special_functions.trigonometric
import analysis.calculus.extend_deriv
... |
c5c806d9317122d90b2371c50c9fb0d2f99bbc91 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/algebra/order/hom/ring.lean | 7fbd7a488e2c577f65ad9a2cf3f094446b41ccae | [
"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 | 15,265 | lean | /-
Copyright (c) 2022 Alex J. Best, Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alex J. Best, Yaël Dillies
-/
import algebra.order.archimedean
import algebra.order.hom.monoid
import algebra.order.ring
import algebra.ring.equiv
/-!
# Ordered ring homom... |
869261d87a7c7137e0d1d2be4382bb61e9adebe7 | 367134ba5a65885e863bdc4507601606690974c1 | /src/category_theory/limits/shapes/terminal.lean | 2053f1ed29d117b716b1c3bc22e463a759408806 | [
"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 | 9,842 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Bhavik Mehta
-/
import category_theory.pempty
import category_theory.limits.limits
/-!
# Initial and terminal objects in a category.
## References
* [Stacks: Initial ... |
e3fb47a235d57bd73d31ef56d71c50107efc81b3 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/measure_theory/interval_integral.lean | 2f12112b76ef3cec6fa7f7f1b3c02e1604b1064f | [] | 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 | 99,554 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Yury G. Kudryashov
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.measure_theory.set_integral
import Mathlib.measure_theory.lebesgue_measure
import Ma... |
7de291b912da7f06f97e3ce775db71d6561b0e12 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/Ord.lean | 0874cf0b20414e09427f42b3ef64eadbc590c6a8 | [
"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 | 663 | lean |
inductive SimpleInd
| A
| B
deriving Ord
mutual
inductive Foo
| A : Int → (3 = 3) → String → Foo
| B : Bar → Foo
deriving Ord
inductive Bar
| C
| D : Foo → Bar
deriving Ord
end
inductive ManyConstructors | A | B | C | D | E | F | G | H | I | J | K | L
| M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
derivi... |
f13df48e1ba9cd9df366acc6df6d25c06caaedda | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/data/sym/sym2.lean | 8e8f7af2839685791381b0e25018d217d2e07130 | [
"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 | 22,684 | lean | /-
Copyright (c) 2020 Kyle Miller All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kyle Miller
-/
import data.finset.prod
import data.sym.basic
import data.set_like.basic
import tactic.linarith
/-!
# The symmetric square
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any... |
901538e3f2e4737acda73c45c1b7757a830a2a51 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/analysis/normed_space/basic.lean | 6b5da2ca732c5d683a746b4adab7ed4768714807 | [
"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 | 27,021 | 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 algebra.algebra.pi
import algebra.algebra.restrict_scalars
import analysis.normed.field.basic
import analysis.normed.mul_action
import data.rea... |
77bb6c1049a61fb8f4845e0708316da698247d41 | 947b78d97130d56365ae2ec264df196ce769371a | /src/Lean/Compiler/IR/CompilerM.lean | e823679f11e33d2e969506dbf811be86eba66412 | [
"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 | 4,852 | 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
-/
import Lean.Environment
import Lean.Compiler.IR.Basic
import Lean.Compiler.IR.Format
namespace Lean
namespace IR
inductive LogEntry
| step (cls : Name) (d... |
3b2a514ede8361e821d8b57a20e8acaae3814dbc | ad0c7d243dc1bd563419e2767ed42fb323d7beea | /order/conditionally_complete_lattice.lean | 75b6a115ea519d6b90c56de7ed25fe5c43838694 | [
"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 | 28,035 | 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
Adapted from the corresponding theory for complete lattices.
Theory of conditionally complete lattices.
A conditionally complete lattice is a lattice in which ev... |
b474382ccfd828f69633fe2a2a0c469eceed4a51 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/equiv/fin.lean | 65a9c27eaab2e95ce0c8eac98baf7df8cfc96190 | [
"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 | 13,842 | 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.fin.vec_notation
import data.equiv.basic
import tactic.norm_num
/-!
# Equivalences for `fin n`
-/
universes u
variables {m n : ℕ}
/-- Equivalence between `fin 0... |
0a49aaadff749fb0542cdda756ea08dbe090f134 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/nat/multiplicity.lean | 4d40db0694f4a6b5ff0ce953f5b8118fc38d7bcf | [
"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 | 10,973 | lean | /-
Copyright (c) 2019 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import algebra.big_operators.intervals
import algebra.geom_sum
import data.nat.bitwise
import data.nat.log
import data.nat.parity
import ring_theory.multiplicity
/-!
# N... |
b105f54cb7211313c6691f4e7af60d598a52c985 | 54d7e71c3616d331b2ec3845d31deb08f3ff1dea | /library/tools/super/prover_state.lean | e0ab48e852885c35f2cf60c4e76ebad264678888 | [
"Apache-2.0"
] | permissive | pachugupta/lean | 6f3305c4292288311cc4ab4550060b17d49ffb1d | 0d02136a09ac4cf27b5c88361750e38e1f485a1a | refs/heads/master | 1,611,110,653,606 | 1,493,130,117,000 | 1,493,167,649,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 15,490 | lean | /-
Copyright (c) 2016 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner
-/
import .clause .lpo .cdcl_solver
open tactic functor monad expr
namespace super
structure score :=
(priority : ℕ)
(in_sos : bool)
(cost : ℕ)
(age : ℕ)
namespace scor... |
0d92d2cabaedb641575776397c14151620720362 | 5d76f062116fa5bd22eda20d6fd74da58dba65bb | /src/polynomial_tactic.lean | dd705491d98bb2e104d486d78b0d723157e56acf | [] | no_license | brando90/formal_baby_snark | 59e4732dfb43f97776a3643f2731262f58d2bb81 | 4732da237784bd461ff949729cc011db83917907 | refs/heads/master | 1,682,650,246,414 | 1,621,103,975,000 | 1,621,103,975,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,000 | lean |
import data.mv_polynomial.basic
import .general_lemmas.mv_X_mul
-- import tactic.basic
-- TODO remove these practice tactics
meta def my_first_tactic : tactic unit :=
do
tactic.trace "Hello,",
tactic.trace "World."
meta def my_fail_tactic : tactic unit :=
tactic.fail "This tactic failed, we apologize for the ... |
96b98d82b4dbd80a16323aec25612979ea0b3fc2 | efa51dd2edbbbbd6c34bd0ce436415eb405832e7 | /20161026_ICTAC_Tutorial/ex28.lean | eb97b0b285d9946ac212b2b407201b7b39b8303e | [
"Apache-2.0"
] | permissive | leanprover/presentations | dd031a05bcb12c8855676c77e52ed84246bd889a | 3ce2d132d299409f1de269fa8e95afa1333d644e | refs/heads/master | 1,688,703,388,796 | 1,686,838,383,000 | 1,687,465,742,000 | 29,750,158 | 12 | 9 | Apache-2.0 | 1,540,211,670,000 | 1,422,042,683,000 | Lean | UTF-8 | Lean | false | false | 1,044 | lean | namespace hide
/- Prop, to represent propositions,
and constructors to build new propositions from others. -/
constant and : Prop → Prop → Prop
constant or : Prop → Prop → Prop
constant not : Prop → Prop
constant implies : Prop → Prop → Prop
/- Proof p, for the type of proofs of p -/
constant Proof : Prop → Type
... |
45f178e4c93eaf4c86c009d49f807d3b4b9fd7c6 | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /stage0/src/Lean/MetavarContext.lean | 6ea0508d6f84e1ca2cf342a438bfab4260f624dc | [
"Apache-2.0"
] | permissive | collares/lean4 | 861a9269c4592bce49b71059e232ff0bfe4594cc | 52a4f535d853a2c7c7eea5fee8a4fa04c682c1ee | refs/heads/master | 1,691,419,031,324 | 1,618,678,138,000 | 1,618,678,138,000 | 358,989,750 | 0 | 0 | Apache-2.0 | 1,618,696,333,000 | 1,618,696,333,000 | null | UTF-8 | Lean | false | false | 53,572 | 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
-/
import Lean.Util.MonadCache
import Lean.LocalContext
namespace Lean
/-
The metavariable context stores metavariable declarations and their
assignments. It... |
85857dc8fbdba72df7cd2c33a2b31e144f766dbd | e58fe8dce8abdb027029831196eef44ecb90a19a | /Imperial/prop_example.lean | 803c2b79fa6ac5961288b4d6a600d130521df5e2 | [] | no_license | hieule3004/Imperial | 89fc066eded43cf6015e19f6f83677411013b47c | 829d0d96603ff3e68ede818873db4931b8d854da | refs/heads/master | 1,584,834,346,353 | 1,531,250,018,000 | 1,531,250,018,000 | 139,205,362 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,646 | lean | open classical
variables p q r s : Prop
-- commutativity of ∧ and ∨
example : p ∧ q ↔ q ∧ p :=
⟨λh, ⟨h.right, h.left⟩, λh, ⟨h.right, h.left⟩⟩
example : p ∨ q ↔ q ∨ p :=
⟨λh, h.elim (λh₁, or.inr h₁) (λh₁, or.inl h₁),
λh, h.elim (λh₁, or.inr h₁) (λh₁, or.inl h₁)⟩
-- associativity of ∧ and ∨
example : (p ∧ q) ∧ r ↔ ... |
0592ecca0128ca67312546a26301a9261f222d99 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/category_theory/endomorphism.lean | d65377635225f2b9563897204330d236bf92e32b | [
"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,121 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov, Scott Morrison, Simon Hudon
-/
import algebra.hom.equiv.basic
import category_theory.groupoid
import category_theory.opposites
import group_theory.group_action.defs
... |
36a7bdcb48c9eeac546ff9955b3e471c7c9d0b92 | d642a6b1261b2cbe691e53561ac777b924751b63 | /src/category_theory/single_obj.lean | 43102336c6a82a282b762a098cc8fc7de9f65c04 | [
"Apache-2.0"
] | permissive | cipher1024/mathlib | fee56b9954e969721715e45fea8bcb95f9dc03fe | d077887141000fefa5a264e30fa57520e9f03522 | refs/heads/master | 1,651,806,490,504 | 1,573,508,694,000 | 1,573,508,694,000 | 107,216,176 | 0 | 0 | Apache-2.0 | 1,647,363,136,000 | 1,508,213,014,000 | Lean | UTF-8 | Lean | false | false | 5,198 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.endomorphism
import category_theory.groupoid
import category_theory.category.Cat
import data.equiv.algebra
import algebra.category.Mon.basic... |
b8ef7ad6f6dc675c673015087d75070cf275ab84 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/algebra/module/locally_convex.lean | 11ea2c947006b830b8a8e4d05629971e3eeb713c | [
"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 | 8,702 | lean | /-
Copyright (c) 2022 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import analysis.convex.topology
/-!
# Locally convex topological modules
A `locally_convex_space` is a topological semimodule over an ordered semiring in which a... |
b3ac5c43a2a4bd7d46b4f721e6922b0c4de907ed | 556aeb81a103e9e0ac4e1fe0ce1bc6e6161c3c5e | /src/starkware/cairo/common/cairo_secp/verification/verification/signature_recover_public_key_verify_zero_soundness.lean | ce8a4ade8f0ef8b858f304ce99701bc6b5253338 | [] | permissive | starkware-libs/formal-proofs | d6b731604461bf99e6ba820e68acca62a21709e8 | f5fa4ba6a471357fd171175183203d0b437f6527 | refs/heads/master | 1,691,085,444,753 | 1,690,507,386,000 | 1,690,507,386,000 | 410,476,629 | 32 | 9 | Apache-2.0 | 1,690,506,773,000 | 1,632,639,790,000 | Lean | UTF-8 | Lean | false | false | 9,136 | lean | /-
File: signature_recover_public_key_verify_zero_soundness.lean
Autogenerated file.
-/
import starkware.cairo.lean.semantics.soundness.hoare
import .signature_recover_public_key_code
import ..signature_recover_public_key_spec
open tactic
open starkware.cairo.common.cairo_secp.field
open starkware.cairo.common.cairo_... |
5f61f411cb5c14e350ee605af21be926ede32300 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/solvable.lean | 8169f21daf71c109b042a66c6e5103c47fccddbc | [
"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,757 | lean | /-
Copyright (c) 2021 Jordan Brown, Thomas Browning, Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jordan Brown, Thomas Browning, Patrick Lutz
-/
import data.fin.vec_notation
import group_theory.abelianization
import group_theory.perm.via_embedding
impo... |
c3fc53b3f15705dc1a87cf58496b83baec67cb23 | f20db13587f4dd28a4b1fbd31953afd491691fa0 | /tests/lean/run/tc_inout1.lean | 616c749956331e33025303029c79cd9b698f042f | [
"Apache-2.0"
] | permissive | AHartNtkn/lean | 9a971edfc6857c63edcbf96bea6841b9a84cf916 | 0d83a74b26541421fc1aa33044c35b03759710ed | refs/heads/master | 1,620,592,591,236 | 1,516,749,881,000 | 1,516,749,881,000 | 118,697,288 | 1 | 0 | null | 1,516,759,470,000 | 1,516,759,470,000 | null | UTF-8 | Lean | false | false | 2,143 | lean | universe variables u v
/-
Type class parameter can be annotated with out_param.
Given (C a_1 ... a_n), we replace a_i with a temporary metavariable ?m_i IF
1- a_i is an out_param and it contains metavariables.
3- a_i depends on a_j for j < i, and a_j was replaced with a temporary metavariable ?m_j.
This case is ne... |
fbd6b2dce24c7dca5b6047eabb9928f8954d58d9 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/Dorais1.lean | 6c0ae7ea6289bed93cb8b7d275174a6e145c2f3f | [
"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 | 1,109 | lean | inductive Tree (α : Type _) : Type _
| leaf : α → Tree α
| branch : Tree α → Tree α → Tree α
inductive Path {α : Type _} : Tree α → Type _
| term (x : α) : Path (Tree.leaf x)
| left (tl tr : Tree α) : Path tl → Path (Tree.branch tl tr)
| right (tl tr : Tree α) : Path tr → Path (Tree.branch tl tr)
section map
variabl... |
fa4803c977ee2600fdeaa6a355937ba65d36a281 | ce89339993655da64b6ccb555c837ce6c10f9ef4 | /bluejam/chap4_exercise6.lean | 18f7332d8d3e3dbf7949ad3fd145d8c793bb54b6 | [] | no_license | zeptometer/LearnLean | ef32dc36a22119f18d843f548d0bb42f907bff5d | bb84d5dbe521127ba134d4dbf9559b294a80b9f7 | refs/heads/master | 1,625,710,824,322 | 1,601,382,570,000 | 1,601,382,570,000 | 195,228,870 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 853 | lean | variables (real : Type) [ordered_ring real]
variables (log exp : real → real)
variable log_exp_eq : ∀ x, log (exp x) = x
variable exp_log_eq : ∀ {x}, x > 0 → exp (log x) = x
variable exp_pos : ∀ x, exp x > 0
variable exp_add : ∀ x y, exp (x + y) = exp x * exp y
-- this ensures the assumptions are available i... |
657edd27dfa851bd46a2dd897aa22d74a7bc55af | d9ed0fce1c218297bcba93e046cb4e79c83c3af8 | /library/init/meta/comp_value_tactics.lean | 65019e327640999ad744b7a4e678271f48420254 | [
"Apache-2.0"
] | permissive | leodemoura/lean_clone | 005c63aa892a6492f2d4741ee3c2cb07a6be9d7f | cc077554b584d39bab55c360bc12a6fe7957afe6 | refs/heads/master | 1,610,506,475,484 | 1,482,348,354,000 | 1,482,348,543,000 | 77,091,586 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,050 | lean | /-
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura
-/
prelude
import init.meta.tactic
meta constant mk_nat_val_ne_proof : expr → expr → option expr
meta constant mk_nat_val_lt_proof : expr → expr → option expr... |
13d6821a3cf7bb87da3c5d3dd05da35e74278a91 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/category_theory/limits/opposites.lean | 0f9d17a092e4dff8ab764067193664f400cab1a7 | [
"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 | 5,517 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Floris van Doorn
-/
import category_theory.limits.shapes.finite_products
import category_theory.discrete_category
/-!
# Limits in `C` give colimits in `Cᵒᵖ`.
We also ... |
1b4350fc763b4cab7d644f6898bb6032d0a122e4 | 626e312b5c1cb2d88fca108f5933076012633192 | /src/linear_algebra/free_module_pid.lean | 874ace4eca4d9f27b2629281a0d781138d175e04 | [
"Apache-2.0"
] | permissive | Bioye97/mathlib | 9db2f9ee54418d29dd06996279ba9dc874fd6beb | 782a20a27ee83b523f801ff34efb1a9557085019 | refs/heads/master | 1,690,305,956,488 | 1,631,067,774,000 | 1,631,067,774,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 36,622 | lean | /-
Copyright (c) 2020 Anne Baanen. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anne Baanen
-/
import linear_algebra.basis
import linear_algebra.finsupp_vector_space
import ring_theory.principal_ideal_domain
import ring_theory.finiteness
/-! # Free modules over PID
... |
a0b731dde6410ea6e9a175c69fbfdf9c50640944 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/group_theory/nilpotent.lean | 172bd1283a1300ee17502164284dde79e56f790d | [
"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 | 38,146 | lean | /-
Copyright (c) 2021 Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Ines Wright, Joachim Breitner
-/
import group_theory.quotient_group
import group_theory.solvable
import group_theory.p_group
import group_theory.sylow
import data.nat.fa... |
d9577ee91f737a5d423ee46f366f23a96180c7e5 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/category_theory/enriched/basic.lean | a7eea5c06bb38c44f8601428f425321f4d025c0e | [
"Apache-2.0"
] | permissive | leanprover-community/mathlib | 56a2cadd17ac88caf4ece0a775932fa26327ba0e | 442a83d738cb208d3600056c489be16900ba701d | refs/heads/master | 1,693,584,102,358 | 1,693,471,902,000 | 1,693,471,902,000 | 97,922,418 | 1,595 | 352 | Apache-2.0 | 1,694,693,445,000 | 1,500,624,130,000 | Lean | UTF-8 | Lean | false | false | 17,407 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import category_theory.monoidal.types.symmetric
import category_theory.monoidal.types.coyoneda
import category_theory.monoidal.center
import tactic.apply_fun
/-!
# E... |
1c8ec523f0d93b7c3ebec0fed1097c5210f35b6c | 55c7fc2bf55d496ace18cd6f3376e12bb14c8cc5 | /src/logic/nontrivial.lean | d22b524ca61dac4a390b2036157147991e91f160 | [
"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 | 4,045 | 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 logic.unique
import logic.function.basic
/-!
# Nontrivial types
A type is *nontrivial* if it contains at least two elements. This is useful in particul... |
27a159c4dd3f9e74a9fbe81266bd8429e8f9e5ed | bf532e3e865883a676110e756f800e0ddeb465be | /algebra/big_operators.lean | caa981441343e7ac2a500592f48e95c3104f9231 | [
"Apache-2.0"
] | permissive | aqjune/mathlib | da42a97d9e6670d2efaa7d2aa53ed3585dafc289 | f7977ff5a6bcf7e5c54eec908364ceb40dafc795 | refs/heads/master | 1,631,213,225,595 | 1,521,089,840,000 | 1,521,089,840,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 14,242 | 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
Some big operators for lists and finite sets.
-/
import data.list.basic data.list.perm data.finset
algebra.group algebra.ordered_group algebra.group_power
universes ... |
6df1090d95394b338ee9aaf2a81aeeb6e1843bbe | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/group_theory/group_action/group.lean | 18d60abcee17b248f8b49796bb7aa357c28094ae | [
"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 | 7,433 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes
-/
import data.equiv.mul_add_aut
import group_theory.group_action.units
/-!
# Group actions applied to various types of group
This file contains lemmas about `smul` on `gr... |
7e6d6feb5117480806f843365af9e28591e4162a | 4fa161becb8ce7378a709f5992a594764699e268 | /src/order/liminf_limsup.lean | 9d9c03e9c6beef199b47e4fe9c2c37d22a3e2661 | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 19,890 | 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, Johannes Hölzl
-/
import order.filter.partial
import order.filter.at_top_bot
/-!
# liminfs and limsups of functions and filters
Defines the Liminf/Limsup of a f... |
52ca13286e9a793ddc9ce203b43a2c7374c94948 | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/algebra/pi_instances.lean | 4597354f94593f622f9df06287cc1afe812f3487 | [
"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 | 19,473 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon, Patrick Massot
Pi instances for algebraic structures.
-/
import order.basic
import algebra.group.prod
import algebra.module
import data.finset
import ring_theory.subring
imp... |
a9b8b13b57ad1a6b3cb858661f393c0b4c3f73fc | d1a52c3f208fa42c41df8278c3d280f075eb020c | /stage0/src/Lean/PrettyPrinter/Delaborator/TopDownAnalyze.lean | 65dc32a1f7f0fc631c373dfcba9c88ca8b834c04 | [
"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 | 27,458 | lean | /-
Copyright (c) 2021 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Daniel Selsam
-/
import Std.Data.RBMap
import Lean.Meta.SynthInstance
import Lean.Util.FindMVar
import Lean.Util.FindLevelMVar
import Lean.Util.CollectLevelParams
import Lean.Ut... |
bef0db4a3eb56af5b132c06d9b2eb8f80a1a3919 | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/multiConstantError.lean | bd7a90314c6cafce621d4511ea6200202a5e50d3 | [
"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 | 53 | lean | constant a b c : Nat
constant a α β : β → Bool
|
f8fe8101e606e74f7075e7dffc7d0ae80b0e557f | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/computability/turing_machine.lean | a1f56fac88844a34db783819c4e9e5f659805e5d | [
"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 | 109,830 | 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 data.fintype.basic
import data.pfun
import logic.function.iterate
import order.basic
import tactic.apply_fun
/-!
# Turing machines
This file defines a sequen... |
2540ca88785101bc8c5e88f4f9825f1fedfae913 | 957a80ea22c5abb4f4670b250d55534d9db99108 | /tests/lean/combinators1.lean | 1f1feca82f9f30edc0fb021a3a86af0927fc192b | [
"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 | 468 | lean | open tactic
example (p q : Prop) : p → q → (p ∧ p) ∧ q :=
by do
intros, constructor, focus [trace "first goal" >> trace_state >> constructor, trace "--- Second goal: " >> trace_state >> assumption],
trace "--- After", trace_state,
solve [trace "should not work", assumption],
first [trace "should not work" >> f... |
e4e30bd7cddfb6ec4a280acf570ff8ebf28d28cb | 31f556cdeb9239ffc2fad8f905e33987ff4feab9 | /stage0/src/Lean/Data/HashMap.lean | 060c720be623fc4f75f2f013b6eb75860721ed09 | [
"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 | tobiasgrosser/lean4 | ce0fd9cca0feba1100656679bf41f0bffdbabb71 | ebdbdc10436a4d9d6b66acf78aae7a23f5bd073f | refs/heads/master | 1,673,103,412,948 | 1,664,930,501,000 | 1,664,930,501,000 | 186,870,185 | 0 | 0 | Apache-2.0 | 1,665,129,237,000 | 1,557,939,901,000 | Lean | UTF-8 | Lean | false | false | 9,075 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Leonardo de Moura
-/
import Lean.Data.AssocList
namespace Lean
universe u v w
def HashMapBucket (α : Type u) (β : Type v) :=
{ b : Array (AssocList α β) // b.size > 0 }
def H... |
62a67dee16093ff2e9b35ea971834f7f88f0ab0c | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/algebra/continued_fractions/computation/basic.lean | 037e4cf0f0ae023b11b68064337d90311c1ca521 | [
"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 | 7,991 | 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.basic
import algebra.order.field
import algebra.archimedean
/-!
# Computable Continued Fractions
## Summary
We formalise the ... |
56faca0503358e720ec0aa1c4aede614c72b4bd1 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/set_theory/ordinal.lean | 1749009e746a905eb6634569573705718442241d | [
"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 | 138,204 | 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
-/
import set_theory.cardinal
/-!
# Ordinal arithmetic
Ordinals are defined as equivalences of well-ordered sets by order isomorphism.
-/
noncomputable theory
open fu... |
cc6992ea77aa94b198b12f00de957e30f95b1fc0 | 1b8f093752ba748c5ca0083afef2959aaa7dace5 | /src/category_theory/util/Two.lean | 71b5ebe52be3ff40dd69434fa5dc32cbbda0a9e8 | [] | no_license | khoek/lean-category-theory | 7ec4cda9cc64a5a4ffeb84712ac7d020dbbba386 | 63dcb598e9270a3e8b56d1769eb4f825a177cd95 | refs/heads/master | 1,585,251,725,759 | 1,539,344,445,000 | 1,539,344,445,000 | 145,281,070 | 0 | 0 | null | 1,534,662,376,000 | 1,534,662,376,000 | null | UTF-8 | Lean | false | false | 665 | lean | -- Copyright (c) 2017 Scott Morrison. All rights reserved.
-- Released under Apache 2.0 license as described in the file LICENSE.
-- Authors: Scott Morrison
import category_theory.tactics.obviously
import data.fintype
universes u v
@[derive decidable_eq]
inductive Two : Type u
| _0 : Two
| _1 : Two
open Two
sectio... |
d986eebe6b535983f96646cf0adb562315b0b292 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/set/intervals/unordered_interval.lean | c9ef2c8bdcdef33492c3a6dcfd8a7d7467a189cb | [
"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 | 8,878 | lean | /-
Copyright (c) 2020 Zhouhang Zhou. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Zhouhang Zhou
-/
import order.bounds
import data.set.intervals.image_preimage
/-!
# Intervals without endpoints ordering
In any decidable linear order `α`, we define the set of elemen... |
a9d99a3e37c3facd18f0a50126da29ec51e677c4 | dd0f5513e11c52db157d2fcc8456d9401a6cd9da | /02_Dependent_Type_Theory.org.1.lean | f81b03ffb4e24661ac82febeac88a642b11d09c2 | [] | 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 | 524 | lean | /- page 11 -/
import standard
-- BEGIN
import standard
open bool nat
/- declare some constants -/
constant m : nat -- m is a natural number
constant n : nat
constants b1 b2 : bool -- declare two constants at once
/- check their types -/
check m -- output: nat
check n
check n + 0 -- nat
ch... |
d63f6242c6de808f9fc0090c8a99ce406e74322a | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/measure_theory/integral_eq_improper.lean | 0cfe07982f6dad7dc42d61f70b521bbef79a580f | [
"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 | 22,150 | lean | /-
Copyright (c) 2021 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Anatole Dedecker
-/
import measure_theory.interval_integral
import order.filter.at_top_bot
/-!
# Links between an integral and its "improper" version
In its current state, mathlib ... |
cea89166d49a614a6c4b21386dc59fac049dc054 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/field_theory/mv_polynomial.lean | 74711530237c790fbe95b0f2e51c45b1a29c1d7b | [] | 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,009 | lean | /-
Copyright (c) 2019 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
Multivariate functions of the form `α^n → α` are isomorphic to multivariate polynomials in
`n` variables.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
... |
fd3a725cc99a4b2e3b95960ce0d2d620291aedfc | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/topology/metric_space/gromov_hausdorff.lean | 1abeafb8225252294d4ee26d5a77ad73ee3da427 | [
"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 | 55,715 | 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... |
d366e171f25a73f3d87fdc733fd8615fe1f0fb99 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/topology/sober.lean | 58252d9a8ef06bd53ac9a4a322e2c711b2bbea0b | [
"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 | 9,181 | lean | /-
Copyright (c) 2021 Andrew Yang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Andrew Yang
-/
import topology.separation
/-!
# Sober spaces
A quasi-sober space is a topological space where every
irreducible closed subset has a generic point.
A sober space is a qua... |
b9e71a74c6b1300f4cdfbec405401be3f10464f7 | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/network/labels.lean | 87dace933e0f3da1c206bc51776da2da652632ee | [
"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,608 | lean | -- author: Ben Sherman
import galois.network.network_monad
universes u v
lemma fin_inhabited_pos {n : ℕ} (x : fin n)
: 0 < n
:= begin
apply lt_of_le_of_lt, tactic.swap, apply x.is_lt,
apply nat.zero_le,
end
namespace network
def message_t := list byte
@[reducible]
def socket := remote_name
inductive poll_label... |
bc69a03c30660e3aca74ed2a497dc010f21067d3 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /src/Lean/Elab/AutoBound.lean | 0aa66e3a5f83f1da229986b600e8e11bf08be9b1 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | leanprover/lean4 | 4bdf9790294964627eb9be79f5e8f6157780b4cc | f1f9dc0f2f531af3312398999d8b8303fa5f096b | refs/heads/master | 1,693,360,665,786 | 1,693,350,868,000 | 1,693,350,868,000 | 129,571,436 | 2,827 | 311 | Apache-2.0 | 1,694,716,156,000 | 1,523,760,560,000 | Lean | UTF-8 | Lean | false | false | 2,213 | 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.Data.Options
/-! # Basic support for auto bound implicit local names -/
namespace Lean.Elab
register_builtin_option autoImplicit : Bool := {
... |
0052710eaf62f2a5a5f5e0d5b6408a7c6810920b | b70447c014d9e71cf619ebc9f539b262c19c2e0b | /hott/hit/prop_trunc.hlean | a4ff4c3023f4d61eec9845133a11773551a9040a | [
"Apache-2.0"
] | permissive | ia0/lean2 | c20d8da69657f94b1d161f9590a4c635f8dc87f3 | d86284da630acb78fa5dc3b0b106153c50ffccd0 | refs/heads/master | 1,611,399,322,751 | 1,495,751,007,000 | 1,495,751,007,000 | 93,104,167 | 0 | 0 | null | 1,496,355,488,000 | 1,496,355,487,000 | null | UTF-8 | Lean | false | false | 14,843 | hlean | import function types.trunc hit.colimit homotopy.connectedness --types.nat.hott hit.trunc cubical.square
open eq is_trunc unit quotient seq_colim pi nat equiv sum algebra is_conn function
/-
In this file we define the propositional truncation, which, given (X : Type)
has constructors
* tr : X → trun... |
45a5b8145e10fef9109ef53d4d43e1004fbe7695 | 75db7e3219bba2fbf41bf5b905f34fcb3c6ca3f2 | /library/algebra/group_bigops.lean | 48e6d3bcbd7c8798b82082335a9f2c7e979767e7 | [
"Apache-2.0"
] | permissive | jroesch/lean | 30ef0860fa905d35b9ad6f76de1a4f65c9af6871 | 3de4ec1a6ce9a960feb2a48eeea8b53246fa34f2 | refs/heads/master | 1,586,090,835,348 | 1,455,142,203,000 | 1,455,142,277,000 | 51,536,958 | 1 | 0 | null | 1,455,215,811,000 | 1,455,215,811,000 | null | UTF-8 | Lean | false | false | 22,823 | lean | /-
Copyright (c) 2015 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Jeremy Avigad
Finite products on a monoid, and finite sums on an additive monoid. There are three versions:
Prodl, Suml : products and sums over lists
Prod, Sum... |
e27ed1c72237efae078964160b4de61891a8d493 | 38ee9024fb5974f555fb578fcf5a5a7b71e669b5 | /Mathlib/Init/Data/Nat/Basic.lean | 0c43aed443f2eb4de77c7ab9925c0eed728aed2f | [
"Apache-2.0"
] | permissive | denayd/mathlib4 | 750e0dcd106554640a1ac701e51517501a574715 | 7f40a5c514066801ab3c6d431e9f405baa9b9c58 | refs/heads/master | 1,693,743,991,894 | 1,636,618,048,000 | 1,636,618,048,000 | 373,926,241 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 417 | 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
-/
import Mathlib.Init.Dvd
import Mathlib.Init.Logic
import Mathlib.Tactic.Basic
notation "ℕ" => Nat
namespace Nat
instance : Dvd ℕ where
... |
c928913723a909df2f961373be59c2610a5d5428 | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /archive/imo/imo2008_q2.lean | 83ab0ab33636cf92eca4a45e37ac19609b7119d6 | [
"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 | 6,303 | lean | /-
Copyright (c) 2021 Manuel Candales. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Manuel Candales
-/
import data.real.basic
import data.set.basic
import data.set.finite
/-!
# IMO 2008 Q2
(a) Prove that
```
x^2 / (x-1)^2 + y^2 / (y-1)^2 + z^2 / ... |
c3e219469e95c2082afc4b3d82aecade24908bbb | 4727251e0cd73359b15b664c3170e5d754078599 | /src/data/polynomial/integral_normalization.lean | 21b207a18e9b4b511e3e0cde3b4d27fe9eeca2a9 | [
"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,584 | 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.algebra_map
import data.polynomial.degree.lemmas
import data.polynomial.monic
/-!
# Theory of moni... |
b7d8effd31a7374d58f18abdb9b48122897125ce | 8d65764a9e5f0923a67fc435eb1a5a1d02fd80e3 | /src/measure_theory/measure/lebesgue.lean | 885d6c46617693411e35499fe4e49fdb5df02a35 | [
"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 | 14,728 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Yury Kudryashov
-/
import measure_theory.constructions.pi
import measure_theory.measure.stieltjes
/-!
# Lebesgue measure on the real line and on `ℝⁿ`
We construct Leb... |
5647eab40e14d46d89a3d597740b2a4ac1bf9557 | f1b175e38ffc5cc1c7c5551a72d0dbaf70786f83 | /data/finset.lean | 74f9a83b035247a2cde9671decbf58f3dfc52964 | [
"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 | 68,150 | 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 order.boolean_algebra algebra.order_functions
data.multiset data.sigma.basi... |
1a9d1e0a2430f658790038d99509ac6d41d12444 | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /library/logic/examples/nuprl_examples.lean | 7eae64aaa32551bac27e163ee748716fb7d6fbff | [
"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 | 6,926 | lean | -- Theorems/Exercises from "Logical Investigations, with the Nuprl Proof Assistant"
-- by Robert L. Constable and Anne Trostle
-- http://www.nuprl.org/MathLibrary/LogicalInvestigations/
import logic
-- 2. The Minimal Implicational Calculus
theorem thm1 {A B : Prop} : A → B → A :=
assume Ha Hb, Ha
theorem thm2 {A B C ... |
a1ade678f0e97f372c99e7671a78d5429f0613c8 | 92bfaf170880e47d55bf51d5a782fffd76db2f5f | /melting_point/set.lean | 598016d15584aeed204be97673c215e6cdd411d5 | [] | no_license | forked-from-1kasper/melting_point | d33403e1985d876a2c7c06859962cc0c37570189 | e5ea4a0917de086b7e5b122e8d5aa90d2761d147 | refs/heads/master | 1,624,785,375,577 | 1,618,305,367,000 | 1,618,305,367,000 | 222,729,018 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,497 | lean | namespace melting_point.set
universe u
theorem union.comm {α : Type u} (a b : set α) : a ∪ b = b ∪ a :=
begin funext x, apply propext, apply or.comm end
theorem inter.comm {α : Type u} (a b : set α) : a ∩ b = b ∩ a :=
begin funext x, apply propext, apply and.comm end
theorem union.empty {α : Type u} (a : set α) : a... |
8ffec6f0e1a793c821c2946e5b01f888e2967803 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_1476.lean | abc8b0c3b30e92904a56ec8bb7860437c9e0c700 | [] | 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 | 165 | lean | import data.nat.basic
variables x y z : ℕ
-- BEGIN
example (k : y * x = z) : x * (y + z) = z + x * z :=
begin
rw mul_comm at k,
rw mul_add,
rw k,
end
-- END |
81d39acb8c3500003ebd2bb1ce9332fee0ab312a | d1a52c3f208fa42c41df8278c3d280f075eb020c | /tests/lean/run/panicAtCheckAssignment.lean | 35092f08ff06de0be5383f6156b1a74d82ed30ff | [
"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 | 211 | lean | import Lean
open Lean
open Lean.Meta
def bug : MetaM Unit := do
let i := 0
forallTelescopeReducing arbitrary fun ys _ => do
let mut j := 0
for y in ys do
throwError "#{i+1}"
j := j + 1
|
8dffd682731cc3d6a6201d97d7baa92ab9c01424 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/order/complete_lattice.lean | 7a4caf3112a506cab0b096c29c97ad123d97b7c6 | [
"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 | 49,728 | 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 order.bounds
/-!
# Theory of complete lattices
## Main definitions
* `Sup` and `Inf` are the supremum and the infimum of a set;
* `supr (f : ι → α)` and `in... |
7737b64820ff47516046505690f11d126131a79c | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/rat.lean | 59fbffef3b22c383a103d145872a5360670bf1d7 | [
"Apache-2.0"
] | permissive | eric-wieser/formal-ml | e278df5a8df78aa3947bc8376650419e1b2b0a14 | 630011d19fdd9539c8d6493a69fe70af5d193590 | refs/heads/master | 1,681,491,589,256 | 1,612,642,743,000 | 1,612,642,743,000 | 360,114,136 | 0 | 0 | Apache-2.0 | 1,618,998,189,000 | 1,618,998,188,000 | null | UTF-8 | Lean | false | false | 6,827 | lean | /-
Copyright 2020 Google LLC
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
di... |
b2cbf517c2492113efb39663a0d14d3a38101813 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/logic/small.lean | b83f92b2e01c2ee3028dc5ff7fc68918dd9b2496 | [
"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 | 3,920 | lean | /-
Copyright (c) 2021 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.equiv.encodable.basic
import data.fintype.basic
/-!
# Small types
A type is `w`-small if there exists an equivalence to some `S : Type w`.
We provide a... |
b0e666c46f17a173f5e8a86fc214388b5dfd12e1 | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/order/bounded_lattice.lean | 98e01873d58e8bdd4b7c3f083958eaf73a363c32 | [
"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 | 44,350 | 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 l... |
2a4612e76d05be45b0295486a113cf3970b48685 | a7eef317ddec01b9fc6cfbb876fe7ac00f205ac7 | /src/category_theory/closed/cartesian.lean | 74119cfe739e1b36a3dd4c06e7ba38702d663efe | [
"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 | 16,087 | lean | /-
Copyright (c) 2020 Bhavik Mehta, Edward Ayers, Thomas Read. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta, Edward Ayers, Thomas Read
-/
import category_theory.limits.shapes.binary_products
import category_theory.limits.shapes.constructions.preserve_bi... |
80c2909e581ff0c0f1aaabbe1fd4de38c51c3889 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/metric_space/premetric_space.lean | 9cc66ddd311aad530347737848dce9ec5d7dfe84 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,129 | lean | /-
Copyright (c) 2019 Sébastien Gouëzel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Premetric spaces.
Author: Sébastien Gouëzel
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.metric_space.basic
import Mathlib.PostPort
universes u l ... |
ee5a1b638fc4933638be1f896d8ca07d9f5d4169 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/control/uliftable_auto.lean | de6b42eca079818758a0ee8ce82fe626531104cc | [] | 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 | 6,907 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author(s): Simon Hudon
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.control.monad.basic
import Mathlib.control.monad.cont
import Mathlib.control.monad.writer
impor... |
e6b6ca8c634f6aa6850be6daf6fa66b07c1448f3 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/topology/algebra/module/finite_dimension.lean | e5af4572eaa6c9c17126de5410049c14c86caa8a | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 22,157 | lean | /-
Copyright (c) 2022 Anatole Dedecker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sébastien Gouëzel, Anatole Dedecker
-/
import analysis.locally_convex.balanced_core_hull
import linear_algebra.free_module.finite.matrix
import topology.algebra.module.simple
import ... |
9bfc580abdcf353683662f5e85fce8fda9565c2f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/closed/functor_auto.lean | cbbedce20b4ed1705f0c4e7baaa7c458098f44c2 | [] | 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,806 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.closed.cartesian
import Mathlib.category_theory.limits.preserves.shapes.binary_... |
84da805733d317539b5304c7453c6b4bd290e3e8 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/data/lazy_list/basic.lean | 8253d33f6859689e8c7484377345bc2f95956dc9 | [] | 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,753 | 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 Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.control.traversable.equiv
import Mathlib.control.traversabl... |
392583fd1a80bb83ed344fe2c4129682e4dfbd41 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/data/list/min_max.lean | 8d9273bdce64b17c4dad53153da0dd60d1d48dbb | [
"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 | 13,244 | lean | /-
Copyright (c) 2019 Minchao Wu. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Minchao Wu, Chris Hughes, Mantas Bakšys
-/
import data.list.basic
/-!
# Minimum and maximum of lists
## Main definitions
The main definitions are `argmax`, `argmin`, `minimum` and `maxim... |
1631f0b738be97d7356b4ae6f2f52bf4ae500394 | bb31430994044506fa42fd667e2d556327e18dfe | /src/data/int/units.lean | 7184fa0163efde3374c60496c73c49732c35c25e | [
"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 | 3,612 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad
-/
import data.nat.units
import data.int.basic
import algebra.ring.units
/-!
# Lemmas about units in `ℤ`.
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to th... |
91b49d31a3c8e050c89634cd11a80e0271aa05a2 | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/analysis/calculus/deriv.lean | d945a29f72de1b6b4ae0b624f91a78b87d22b9c5 | [
"Apache-2.0"
] | permissive | Sterrs/mathlib | ea6910847b8dfd18500486de9ab0ee35704a3f52 | d9327e433804004aa1dc65091bbe0de1e5a08c5e | refs/heads/master | 1,650,769,884,257 | 1,587,808,694,000 | 1,587,808,694,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 60,744 | lean | /-
Copyright (c) 2019 Gabriel Ebner. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Gabriel Ebner, Sébastien Gouëzel
-/
import analysis.calculus.fderiv
import data.polynomial
/-!
# One-dimensional derivatives
This file defines the derivative of a function `f : 𝕜 → ... |
2672efc3b053830870fc74d1887aa8b959e43949 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/category_theory/conj.lean | e44dbc5a0d00cb0664fe6e9efedb69761f2d46fc | [
"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 | 5,465 | lean | /-
Copyright (c) 2019 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import category_theory.endomorphism
import algebra.group_power
/-!
# Conjugate morphisms by isomorphisms
An isomorphism `α : X ≅ Y` defines
- a monoid isomorphism... |
4c2fbff9a5a83b16025392b15d4ff53347d0be58 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/topology/instances/ennreal_auto.lean | e76fc24d679da01f846a07034369fade0dfa2f55 | [] | no_license | AurelienSaue/Mathlib4_auto | f538cfd0980f65a6361eadea39e6fc639e9dae14 | 590df64109b08190abe22358fabc3eae000943f2 | refs/heads/master | 1,683,906,849,776 | 1,622,564,669,000 | 1,622,564,669,000 | 371,723,747 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 28,731 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Johannes Hölzl
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.topology.instances.nnreal
import Mathlib.PostPort
universes u_1 u_2
namespace Mathlib
/-... |
f9b88fedbb81119afb9a7eb9f133e74347e5632e | 2babdfead4bea221d0523153599dbb5c8e6bc7a3 | /bin/tree2yaml.lean | 398a7d2a42c4a063d9965de0b721ac8280a4121d | [
"CC-BY-4.0"
] | permissive | pjf/RP-0 | 83bf5012e6b7aaec1e120baf680c02217b958c34 | 438016a526bbaadbea478db32d4a99f194ab94d2 | refs/heads/master | 1,611,302,579,298 | 1,416,197,416,000 | 1,416,197,416,000 | 26,740,351 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,516 | lean | #!/usr/bin/perl -w
use 5.010;
use strict;
use warnings;
use autodie;
use FindBin qw($Bin);
use File::Slurp qw(read_file);
use Getopt::Std qw(getopts);
# Verbose switch handling
my %opts = ('v' => 0);
getopts('v', \%opts);
my $tree = $ARGV[0] or die "Usage: $0 tree.cfg\n";
my $block_re;
# We're about to write a recu... |
3379e5d66c57b4e11ea41311add2a245a328a5b3 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/category/Module/subobject.lean | 5455ae93abc23898e4dc156f9edfef7b46e767f6 | [
"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 | 3,475 | lean | /-
Copyright (c) 2021 Markus Himmel. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import algebra.category.Module.epi_mono
import algebra.category.Module.kernels
import category_theory.subobject.well_powered
import category_theory.subobject.limits
/-... |
d98286188f72fe92dfce9757f01a05db3bdab4f8 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/linear_algebra/matrix/schur_complement.lean | 4e3cc43ea1180b018dfd09d5d8abf3b07908a640 | [
"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 | 26,130 | lean | /-
Copyright (c) 2022 Alexander Bentkamp. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alexander Bentkamp, Eric Wieser, Jeremy Avigad, Johan Commelin
-/
import data.matrix.invertible
import linear_algebra.matrix.nonsingular_inverse
import linear_algebra.matrix.pos_de... |
82a4f7ed709419d37f8e58aee4c3d3da3210066c | 3bdd27ffdff3ffa22d4bb010eba695afcc96bc4a | /src/combinatorics/simplicial_complex/erasure.lean | 73dd4e45abefae9e48fd53acabff4e8f492dd83e | [] | no_license | mmasdeu/brouwerfixedpoint | 684d712c982c6a8b258b4e2c6b2eab923f2f1289 | 548270f79ecf12d7e20a256806ccb9fcf57b87e2 | refs/heads/main | 1,690,539,793,996 | 1,631,801,831,000 | 1,631,801,831,000 | 368,139,809 | 4 | 3 | null | 1,624,453,250,000 | 1,621,246,034,000 | Lean | UTF-8 | Lean | false | false | 2,474 | lean | /-
Copyright (c) 2021 Yaël Dillies, Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies, Bhavik Mehta
-/
import combinatorics.simplicial_complex.link
import data.set.basic
namespace affine
open set
variables {E : Type*} [normed_group E] [normed_s... |
2517daf8cf58aa22ec3b9bc2083bb7dcddd3b51a | d11a77796ce855e9f8d9d84892d54616b7d5a758 | /src/konig.lean | 239b1c7679c09ac34bac9143490d7260bb822c03 | [] | no_license | kmill/lean-graphcoloring | 014f2bfb8c0d4b2ddda9d7d4de3de2ecdbb40ad7 | 1bb2050ed358ff647186f89922d6a09b838444e5 | refs/heads/master | 1,666,902,260,074 | 1,591,913,639,000 | 1,591,913,639,000 | 271,116,459 | 2 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 7,606 | lean | -- König's lemma (weak form)
import data.set
import tactic
import data.fintype.basic
namespace konig
open set
attribute [instance] classical.prop_decidable
universe u
variable {X : Type u}
def inv_system {X} (S : ℕ → set X) (fns : ℕ → X → X) :=
∀ n, ∀ x ∈ S(n+1), fns n x ∈ S n
section S_and_fns
variables {S : ℕ... |
2ff85412c3a2705a0457d6cc5140ea91c643beee | a9d0fb7b0e4f802bd3857b803e6c5c23d87fef91 | /library/init/bool.lean | ec55b2ffd69b8a7f646681c62c77456211cc8759 | [
"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 | 707 | 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
prelude
import init.datatypes
namespace bool
attribute [inline]
definition {u} cond {A : Type u} : bool → A → A → A
| tt a b := a
| ff a b := b
... |
71d60e6a3f8c738513c134090c0f270aac28f663 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/unfold_rec.lean | 3ad4114adc11b9926c07fa247569d77c4451a122 | [
"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 | 1,000 | lean | import data.examples.vector
open nat vector
variables {A B : Type}
variable {n : nat}
theorem tst1 : ∀ n m, succ n + succ m = succ (succ (n + m)) :=
begin
intro n m,
state,
rewrite [succ_add]
end
definition add2 (x y : nat) : nat :=
nat.rec_on x (λ y, y) (λ x r y, succ (r y)) y
local infix + := add2
theorem ... |
3f78a8ab491d5762aaa69021e7b22837d5465722 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/preserves/functor_category.lean | 2ae64cf44967163af4d1ad0315488a0d777a2ca8 | [] | 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 | 1,953 | lean | /-
Copyright (c) 2020 Bhavik Mehta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bhavik Mehta
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.category_theory.limits.presheaf
import Mathlib.category_theory.limits.functor_category
import M... |
f4ce01cc7d40727b47b990a4c2103867da09a047 | 1e3a43e8ba59c6fe1c66775b6e833e721eaf1675 | /src/order/bounded_lattice.lean | 22cc0d8c37f0bb4bb65747f2c8ddfe20ac242542 | [
"Apache-2.0"
] | permissive | Sterrs/mathlib | ea6910847b8dfd18500486de9ab0ee35704a3f52 | d9327e433804004aa1dc65091bbe0de1e5a08c5e | refs/heads/master | 1,650,769,884,257 | 1,587,808,694,000 | 1,587,808,694,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 29,515 | 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
set_opt... |
66b19be9172a6d78034ac559abbf5b80f3d1dbba | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/algebra/module/injective.lean | cfbb97da496fc9c06bde76170fdc502b284b95d0 | [
"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,675 | lean | /-
Copyright (c) 2022 Jujian Zhang. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jujian Zhang
-/
import category_theory.preadditive.injective
import algebra.category.Module.epi_mono
import ring_theory.ideal.basic
import linear_algebra.linear_pmap
/-!
# Injective mo... |
7b5bad3a8a9aaaaa7f77b914c7d4d5e0afcc2632 | 367134ba5a65885e863bdc4507601606690974c1 | /src/analysis/normed_space/normed_group_hom.lean | 9afb493a53f38f1dffa7e0fb432f817dbe7b9288 | [
"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 | 19,638 | lean | /-
Copyright (c) 2021 Johan Commelin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johan Commelin
-/
import analysis.normed_space.basic
import topology.sequences
import topology.metric_space.isometry
/-!
# Normed groups homomorphisms
This file gathers definitions ... |
50145cfdaa7410583bdef1ed6efeabdc03410ec9 | e94d3f31e48d06d252ee7307fe71efe1d500f274 | /hott/homotopy/circle.hlean | fb2f936bca2b795aa4d7558be996e32381f3ab84 | [
"Apache-2.0"
] | permissive | GallagherCommaJack/lean | e4471240a069d82f97cb361d2bf1a029de3f4256 | 226f8bafeb9baaa5a2ac58000c83d6beb29991e2 | refs/heads/master | 1,610,725,100,482 | 1,459,194,829,000 | 1,459,195,377,000 | 55,377,224 | 0 | 0 | null | 1,459,731,701,000 | 1,459,731,700,000 | null | UTF-8 | Lean | false | false | 11,765 | hlean | /-
Copyright (c) 2015 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
Declaration of the circle
-/
import .sphere
import types.bool types.int.hott types.equiv
import algebra.homotopy_group algebra.hott .connectedness
open eq susp bo... |
2bb61f18c3d46eba2f59483510d0d45b8ffae1fe | c777c32c8e484e195053731103c5e52af26a25d1 | /src/analysis/convex/cone/proper.lean | 96ee065db043c7bb5d31cb2d16916a7fdce5f0e0 | [
"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 | 2,115 | lean | /-
Copyright (c) 2022 Apurva Nakade All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Apurva Nakade
-/
import analysis.convex.cone.basic
/-!
We define a proper cone as a nonempty, closed, convex cone. Proper cones are used in defining conic
programs which generalize lin... |
1c8834e18d9e968ec059961de496d2becc01ee24 | bb31430994044506fa42fd667e2d556327e18dfe | /src/topology/connected.lean | 19602fb7b606b210c0babfcd10bfcef897f7c7bd | [
"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 | 74,693 | 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, Yury Kudryashov
-/
import data.set.bool_indicator
import order.succ_pred.relation
import topology.subset_properties
import tactic.congrm
/-!
# Connecte... |
c586fcbb1daa32aac4a157bbb6f837dd2e2c6c6a | 3618c6e11aa822fd542440674dfb9a7b9921dba0 | /src/multirelation/approach1/free_group.lean | 73d9a02254c2a4f3c944ab21f760a4516d550622 | [] | no_license | ChrisHughes24/single_relation | 99ceedcc02d236ce46d6c65d72caa669857533c5 | 057e157a59de6d0e43b50fcb537d66792ec20450 | refs/heads/master | 1,683,652,062,698 | 1,683,360,089,000 | 1,683,360,089,000 | 279,346,432 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 963 | lean | @[reducible] def free_group (α : Type) := list (α × ℤ)
variables {α : Type}
namespace free_group
instance : has_one (free_group α) := ⟨[]⟩
-- inv_core a b is a⁻¹ * b
def inv_core : free_group α → free_group α → free_group α
| [] l := l
| (⟨i, n⟩::l₁) l₂ := inv_core l₁ (⟨i, -n⟩::l₂)
instance : has_inv ... |
1e97ee1ce7ff100c48e84cb171a0d83fd3f80373 | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tmp/new-frontend/parser/identifier.lean | a6c23cd3d05ec64f87f2b45d91e7c75fede27278 | [
"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 | 2,451 | 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
-/
prelude
import init.data.char.basic init.lean.parser.parsec
namespace Lean
def isGreek (c : Char) : Bool :=
0x391 ≤ c.val && c.val ≤ 0x3dd
def isLetterLi... |
dd90aa5a550ee0896047d97baa816152c09b1dd0 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/group_theory/coset.lean | 270d574549b6b288da27ec23b794c6c4df231786 | [
"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 | 20,300 | lean | /-
Copyright (c) 2018 Mitchell Rowett. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mitchell Rowett, Scott Morrison
-/
import algebra.quotient
import group_theory.subgroup.basic
/-!
# Cosets
This file develops the basic theory of left and right cosets.
## Main de... |
d97b345054a1bd74ed67eb7276453af57cd3b4ec | 4fa161becb8ce7378a709f5992a594764699e268 | /src/category_theory/limits/shapes/kernels.lean | 3037f8d98038c66bacbb86fb31df29d2f18bbadb | [
"Apache-2.0"
] | permissive | laughinggas/mathlib | e4aa4565ae34e46e834434284cb26bd9d67bc373 | 86dcd5cda7a5017c8b3c8876c89a510a19d49aad | refs/heads/master | 1,669,496,232,688 | 1,592,831,995,000 | 1,592,831,995,000 | 274,155,979 | 0 | 0 | Apache-2.0 | 1,592,835,190,000 | 1,592,835,189,000 | null | UTF-8 | Lean | false | false | 15,684 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison, Markus Himmel
-/
import category_theory.limits.shapes.zero
import category_theory.limits.shapes.equalizers
/-!
# Kernels and cokernels
In a category with zero morphis... |
5cdaa62095a2de1e6365d9beb631419dc1bfca0c | d7189ea2ef694124821b033e533f18905b5e87ef | /galois/list/simplify_eq.lean | 2ce54e489eea8050f217c625cd3bb99920b2e146 | [
"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 | 698 | lean | /-
This module defines operations for simplifying equalities between lists.
-/
universe variable u
namespace list
variable { α : Type u}
@[simp]
theorem nil_eq_cons (a : α) (l : list α) : nil = (a :: l) ↔ false :=
begin
simp,
contradiction,
end
@[simp]
theorem cons_eq_nil (a : α) (l : list α) : (a :: l) = nil... |
10d1912ee320452555c4e765f0ce70adcb768f98 | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/ring_theory/noetherian.lean | e2af5ab60955f7594466631cc49f000799ab2a65 | [
"Apache-2.0"
] | permissive | johoelzl/mathlib | 253f46daa30b644d011e8e119025b01ad69735c4 | 592e3c7a2dfbd5826919b4605559d35d4d75938f | refs/heads/master | 1,625,657,216,488 | 1,551,374,946,000 | 1,551,374,946,000 | 98,915,829 | 0 | 0 | Apache-2.0 | 1,522,917,267,000 | 1,501,524,499,000 | Lean | UTF-8 | Lean | false | false | 16,883 | lean | /-
Copyright (c) 2018 Mario Carneiro and Kevin Buzzard. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kevin Buzzard
-/
import data.equiv.algebra
import linear_algebra.linear_combination
import ring_theory.ideal_operations
import ring_theory.subring
o... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.