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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
c3af9ac5c2ff1f8b520da46244e16eb2556bdb15 | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/analysis/normed_space/basic.lean | bbbfb7e9c34fcba1d1e2ba33776711519c75cea8 | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 52,389 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
-/
import topology.instances.nnreal
import topology.instances.complex
import topology.algebra.module
import topology.metric_space.antilipschitz
/-!
# No... |
d0b9c20a8d91a9378b830a2e5d9e09d988296ea2 | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/field_theory/adjoin.lean | dc974321910eeb5fd7737dc8464bff5498cbec69 | [
"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 | 15,453 | lean | /-
Copyright (c) 2020 Thomas Browning and Patrick Lutz. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning and Patrick Lutz
-/
import field_theory.tower
import field_theory.intermediate_field
/-!
# Adjoining Elements to Fields
In this file we introduce t... |
93ced58f2ffa2b3e30cd189c4dc7a9694a9e9c8c | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/elab1.lean | 5d356af7d5fbfb1e70af50fc5034b4e04c5d23ca | [
"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 | 405 | lean | definition foo.subst := @eq.subst
definition boo.subst := @eq.subst
definition foo.add := @has_add.add
definition boo.add := @has_add.add
set_option pp.all true
open foo boo has_add
#print raw subst -- subst is overloaded
#print raw add -- add is overloaded
#check @subst
#check @@subst
open eq
#check subst
co... |
c356682eae7ec0101e824688172456b7886a8e79 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/control/traversable/equiv.lean | 9733ecf04da08acabad9cffd35c20ff2c3be1e1f | [] | 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,202 | lean | /-
Copyright (c) 2018 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
Transferring `traversable` instances using isomorphisms.
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.data.equiv.basic
import Mathlib.control... |
034066cc8648bcd016b125afb21a605775f103c2 | 93b17e1ec33b7fd9fb0d8f958cdc9f2214b131a2 | /src/sep/basic.lean | 1bc36359a5f6a712b2331d793b1677a8bb788161 | [] | no_license | intoverflow/timesink | 93f8535cd504bc128ba1b57ce1eda4efc74e5136 | c25be4a2edb866ad0a9a87ee79e209afad6ab303 | refs/heads/master | 1,620,033,920,087 | 1,524,995,105,000 | 1,524,995,105,000 | 120,576,102 | 1 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 32,471 | lean | /- Separation algebras
-
-/
namespace Sep
universes ℓ ℓ₁ ℓ₂ ℓ₃ ℓ₄
-- Separation algebras
structure Alg.Assoc {A' : Type ℓ} (join : A' → A' → set A')
{x₁ x₂ x₃ x₁x₂ x₁x₂x₃}
(H₁ : join x₁ x₂ x₁x₂) (H₂ : join x₁x₂ x₃ x₁x₂x₃)
:= (x : A')
(J₁ : join x₂ x₃ x)
(J₂ : join x₁ x x₁x₂x₃)
def IsAssoc {A' : Type ℓ}... |
0cc1c0a79213e8f155f18c80577e76c2fa58c593 | b00eb947a9c4141624aa8919e94ce6dcd249ed70 | /stage0/src/Lean/Elab/Tactic/Basic.lean | 8f4fdeac408a5bf2f2d902339831d5d10dd2f2ae | [
"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 | 23,476 | 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.CollectMVars
import Lean.Parser.Command
import Lean.Meta.PPGoal
import Lean.Meta.Tactic.Assumption
import Lean.Meta.Tact... |
6a3ea58de9d1119f467cc530ba683bb5bef7a5da | 57aec6ee746bc7e3a3dd5e767e53bd95beb82f6d | /src/Lean/Data/Lsp/Diagnostics.lean | c33a12740cea7270bf27e56f583aeecf32e14359 | [
"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 | 3,819 | lean | /-
Copyright (c) 2020 Marc Huisinga. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Marc Huisinga, Wojciech Nawrocki
-/
import Lean.Data.Json
import Lean.Data.Lsp.Basic
import Lean.Data.Lsp.Utf16
import Lean.Message
/-! Definitions and functionality for emitting dia... |
6709c85c96d9c520cc06e70e8839691555fa8e4e | cf39355caa609c0f33405126beee2739aa3cb77e | /tests/lean/run/io_state.lean | 2566b8ca21f49e8d03cddf89dfe1d0a6cbf64bc5 | [
"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 | 292 | lean | import system.io
open io state_t
@[reducible] def my_io := state_t nat io
instance lift_io {α} : has_coe (io α) (my_io α) :=
⟨state_t.lift⟩
def tst : my_io unit :=
do x ← get,
print_ln x,
put (x+10),
y ← get,
print_ln y,
put_str "end of program"
#eval tst.run 5
|
7d0e2c717653e7f7dd3017689a6ed247fcec2a17 | bb31430994044506fa42fd667e2d556327e18dfe | /src/order/chain.lean | 9c0087af103890093625fb783bb973038f5972f7 | [
"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 | 12,615 | 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 data.set.pairwise
import data.set_like.basic
/-!
# Chains and flags
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this file require a correspon... |
e3896574312ab981193fd3f1179a83db3e0d3eab | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/advanced_proposition/03.lean | 293edd90aa5687de24afb06e3151cd369704811e | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 158 | lean | lemma and_trans (P Q R : Prop) : P ∧ Q → Q ∧ R → P ∧ R :=
begin
intros h1 h2,
cases h1 with p q,
cases h2 with q' r,
split,
cc,
cc,
end
|
614f402376453fc6157edcf7b743e7b3db66cef2 | 57c233acf9386e610d99ed20ef139c5f97504ba3 | /src/topology/metric_space/completion.lean | 25d7a0e955545b7b4895f18ffaf085b7cb603bb1 | [
"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 | 8,651 | 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.uniform_space.completion
import topology.metric_space.isometry
import topology.instances.real
/-!
# The completion of a metric space
Completio... |
dd1796b79ad51a98b9df79163a955c3ea8c9d84d | 5fbbd711f9bfc21ee168f46a4be146603ece8835 | /lean/natural_number_game/function/4.lean | c37d3a093afa58823b942828e9104c7f85854e52 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | goedel-gang/maths | 22596f71e3fde9c088e59931f128a3b5efb73a2c | a20a6f6a8ce800427afd595c598a5ad43da1408d | refs/heads/master | 1,623,055,941,960 | 1,621,599,441,000 | 1,621,599,441,000 | 169,335,840 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 167 | lean | example (P Q R S T U: Type)
(p : P)
(h : P → Q)
(i : Q → R)
(j : Q → T)
(k : S → T)
(l : T → U)
: U :=
begin
apply l,
apply j,
apply h,
exact p,
end
|
0d5982ed5b59ac8b22687de9f7c0fec0c58844c6 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/coeSort1.lean | 9d083c6efc17040064e06e4d5052912c24e3df2d | [
"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 | 285 | lean | --
universe u
def Below (n : Nat) : Nat → Prop :=
(· < n)
def f {n : Nat} (v : Subtype (Below n)) : Nat :=
↑v + 1
instance pred2subtype {α : Type u} : CoeSort (α → Prop) (Type u) :=
CoeSort.mk (fun p => Subtype p)
def g {n : Nat} (v : Below n) : Nat :=
v.val + 1
|
189809a733e612a1415991516f89cfbcbc51ba8c | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/slim_check.lean | 95f337259e96154ce86f65cf713e108a68c107f7 | [
"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 | 8,215 | lean | /-
Copyright (c) 2020 Simon Hudon. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Simon Hudon
-/
import testing.slim_check.testable
import data.list.sort
/-!
## Finding counterexamples automatically using `slim_check`
A proposition can be tested by writing it out as... |
8c16428b3fdd31e28ab390070b683906de0720d0 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/logic/equiv/local_equiv.lean | 9ce17ae02c71f613934b64f369d7cfb5b0dcc2c8 | [
"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 | 35,613 | 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 data.set.function
import logic.equiv.basic
/-!
# Local equivalences
This files defines equivalences between subsets of given types.
An element `e` of `... |
0e904c463d3076e274ec937e1fcfc2cb0c315cdc | 624f6f2ae8b3b1adc5f8f67a365c51d5126be45a | /tmp/new-frontend/parser/declaration.lean | 6cf4322341584a98f4cd8053e16b27b11266f774 | [
"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 | 5,344 | lean | /-
Copyright (c) 2018 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Sebastian Ullrich
Parsers for commands that declare things
-/
prelude
import init.lean.parser.term
namespace Lean
namespace Parser
open Combinators MonadParsec
open Parser.Ha... |
6dccedf94132f58a80fe7a1174fd2303ed21f9a6 | 968e2f50b755d3048175f176376eff7139e9df70 | /examples/prop_logic_theory/unnamed_1429.lean | e45169cb833f694afb04b0c47efa2cbda42c16e8 | [] | 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 | 159 | lean | import data.nat.basic
variables x y z : ℕ
-- BEGIN
example : x * (y + z) = x * z + y * x :=
begin
rw mul_add,
rw add_comm,
rw mul_comm x y,
end
-- END |
23ee100fcc56489141d3b28d6049689d924d98a1 | 10c7c971a1902d76057c52ce0529ebb491a69c44 | /ProblemSheet2.lean | 7b44a74582938bb128cb1ab38741903a862108ae | [] | no_license | SzymonKubica/Lean | 5f6122e8dd9171239b36a9ce0515f6acbc49781a | 627bff2f001ba3f009c112c9332093e8de84863c | refs/heads/main | 1,675,563,490,768 | 1,608,538,609,000 | 1,608,538,609,000 | 307,184,347 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 3,092 | lean | /- Math40001 : Introduction to university mathematics.
Problem Sheet 2, October 2020.
This is a Lean file. It can be read with the Lean theorem prover.
You can work on this file online via the link at
https://github.com/ImperialCollegeLondon/M40001_lean/blob/master/README.md
or you can install Lean and its maths ... |
a984c6f5598dded86d0335809b9984e81b6934ed | 367134ba5a65885e863bdc4507601606690974c1 | /src/data/list/intervals.lean | fa5509e5679f02ffe48fb286b00ce7e46cddbe77 | [
"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 | 6,755 | lean | /-
Copyright (c) 2019 Scott Morrison. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Scott Morrison
-/
import data.list.range
import data.list.bag_inter
open nat
namespace list
/--
`Ico n m` is the list of natural numbers `n ≤ x < m`.
(Ico stands for "interval, close... |
155c0c84c1488da914a7d4ee53b7c51f2667f170 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/combinatorics/simple_graph/coloring.lean | 8aaa57e487a697c2a0e5dee2211ac2a9edd4ec2d | [
"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 | 14,101 | lean | /-
Copyright (c) 2021 Arthur Paulino. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Arthur Paulino, Kyle Miller
-/
import combinatorics.simple_graph.subgraph
import data.nat.lattice
import data.setoid.partition
import order.antichain
/-!
# Graph Coloring
This modul... |
7a3f6a2ee8901407f0c2c22bf864106a6757b2e9 | 28be2ab6091504b6ba250b367205fb94d50ab284 | /levels/solutions/world3_le_variant_solutions.lean | eafcd3994797f941265864262c7cfb3c7bfc3338 | [
"Apache-2.0"
] | permissive | postmasters/natural_number_game | 87304ac22e5e1c5ac2382d6e523d6914dd67a92d | 38a7adcdfdb18c49c87b37831736c8f15300d821 | refs/heads/master | 1,649,856,819,031 | 1,586,444,676,000 | 1,586,444,676,000 | 255,006,061 | 0 | 0 | Apache-2.0 | 1,586,664,599,000 | 1,586,664,598,000 | null | UTF-8 | Lean | false | false | 7,383 | lean | import mynat.mul
import solutions.world2_multiplication
import tactic.linarith
-- this is one of *three* routes to
-- canonically_ordered_comm_semiring
namespace mynat
inductive le : mynat → mynat → Prop
| refl (a : mynat) : le a a
| succ (a b : mynat) : le a b → le a (succ b)
-- Other choices:
-- | le 0 _
-- | l... |
490955a561ecf8b7fb336de63fc12baede04f9ce | 7cdf3413c097e5d36492d12cdd07030eb991d394 | /world_experiments/world9/level6.lean | 814d651c87f1ac83ddd215ee2f65d267b8630413 | [] | no_license | alreadydone/natural_number_game | 3135b9385a9f43e74cfbf79513fc37e69b99e0b3 | 1a39e693df4f4e871eb449890d3c7715a25c2ec9 | refs/heads/master | 1,599,387,390,105 | 1,573,200,587,000 | 1,573,200,691,000 | 220,397,084 | 0 | 0 | null | 1,573,192,734,000 | 1,573,192,733,000 | null | UTF-8 | Lean | false | false | 2,033 | lean | import game.world5.level4 -- hide
import game.world2.level14
namespace mynat -- hide
/-
# World 5 : Inequality world
## Level 6 : `le_antisymm`
In this level, it would be helpful if you knew about how to create extra
hypotheses in the middle of a proof.
Say you have a hypothesis `h : a + b = a`
and you remember b... |
8a10b68b176756485c5ec4aba93adcd047693a26 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/topology/algebra/nonarchimedean/basic.lean | 309f3a7ea437f7b326cefc7bca5a388cf159e2cb | [
"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 | 5,822 | lean | /-
Copyright (c) 2021 Ashwin Iyengar. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Buzzard, Johan Commelin, Ashwin Iyengar, Patrick Massot
-/
import topology.algebra.ring
import topology.algebra.open_subgroup
import data.set.basic
import group_theory.subgroup
... |
4587afb18e0b84bd429beb06046617ee30333992 | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/control/traversable/basic.lean | 27a3e00903ff4b4dc366002f667ca3f08d6c2fc2 | [
"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 | 5,598 | 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 control.functor
/-!
# Traversable type class
Type classes for traversing collections. The concepts and laws are taken from
<http://hackage.haskell.org/package/base-... |
abf2251a446f2a154958312ef6109df17ce3a73c | aa2345b30d710f7e75f13157a35845ee6d48c017 | /order/complete_lattice.lean | 4d4b8a7a8d8876c6292c82d4d948918b1e750bd7 | [
"Apache-2.0"
] | permissive | CohenCyril/mathlib | 5241b20a3fd0ac0133e48e618a5fb7761ca7dcbe | a12d5a192f5923016752f638d19fc1a51610f163 | refs/heads/master | 1,586,031,957,957 | 1,541,432,824,000 | 1,541,432,824,000 | 156,246,337 | 0 | 0 | Apache-2.0 | 1,541,434,514,000 | 1,541,434,513,000 | null | UTF-8 | Lean | false | false | 30,857 | 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
Theory of complete lattices.
-/
import order.bounded_lattice data.set.basic tactic.pi_instances
set_option old_structure_cmd true
namespace lattice
universes u v w w... |
6d826c8ed5ab0e34f598c7088b78234e3d4eda23 | fe208a542cea7b2d6d7ff79f94d535f6d11d814a | /src/Logic/gabriel_framework.lean | 2e986330f0b91f8ffe85ef99aa3aac94462eb1e3 | [] | no_license | ImperialCollegeLondon/M1F_room_342_questions | c4b98b14113fe900a7f388762269305faff73e63 | 63de9a6ab9c27a433039dd5530bc9b10b1d227f7 | refs/heads/master | 1,585,807,312,561 | 1,545,232,972,000 | 1,545,232,972,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 676 | lean | inductive fml
| atom (i : ℕ)
| imp (a b : fml)
| not (a : fml)
open fml
infixr ` →' `:50 := imp -- right associative
prefix `¬' `:40 := fml.not
inductive prf : fml → Type
| axk (p q) : prf (p →' q →' p)
| axs (p q r) : prf $ (p →' q →' r) →' (p →' q) →' (p →' r)
| axX (p q) : prf $ ((¬' q) →' (¬' p)) →' p →' q
| mp... |
7b147654be2af0dcfd3e4e0688c900bb09ad26bf | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/measure_theory/group.lean | febdb5faa917b261c59e3d302a7d8da2cf3ad90b | [
"Apache-2.0"
] | permissive | Lix0120/mathlib | 0020745240315ed0e517cbf32e738d8f9811dd80 | e14c37827456fc6707f31b4d1d16f1f3a3205e91 | refs/heads/master | 1,673,102,855,024 | 1,604,151,044,000 | 1,604,151,044,000 | 308,930,245 | 0 | 0 | Apache-2.0 | 1,604,164,710,000 | 1,604,163,547,000 | null | UTF-8 | Lean | false | false | 4,371 | lean | /-
Copyright (c) 2020 Floris van Doorn. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Floris van Doorn
-/
import measure_theory.borel_space
/-!
# Measures on Groups
We develop some properties of measures on (topological) groups
* We define properties on measures: le... |
34fa222164fc59ba68afcba34c527414730126ef | 46125763b4dbf50619e8846a1371029346f4c3db | /src/topology/algebra/uniform_group.lean | 592f0d34e1d2029aa875082e9d6bb0b77f304244 | [
"Apache-2.0"
] | permissive | thjread/mathlib | a9d97612cedc2c3101060737233df15abcdb9eb1 | 7cffe2520a5518bba19227a107078d83fa725ddc | refs/heads/master | 1,615,637,696,376 | 1,583,953,063,000 | 1,583,953,063,000 | 246,680,271 | 0 | 0 | Apache-2.0 | 1,583,960,875,000 | 1,583,960,875,000 | null | UTF-8 | Lean | false | false | 19,570 | 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
Uniform structure on topological groups:
* `topological_add_group.to_uniform_space` and `topological_add_group_is_uniform` can be used to
construct a... |
4ffb2f23d49712adc4948697e103c84957a06593 | abd85493667895c57a7507870867b28124b3998f | /src/data/monoid_algebra.lean | 8da25231757fd388a41afc31da193007c9dfedcb | [
"Apache-2.0"
] | permissive | pechersky/mathlib | d56eef16bddb0bfc8bc552b05b7270aff5944393 | f1df14c2214ee114c9738e733efd5de174deb95d | refs/heads/master | 1,666,714,392,571 | 1,591,747,567,000 | 1,591,747,567,000 | 270,557,274 | 0 | 0 | Apache-2.0 | 1,591,597,975,000 | 1,591,597,974,000 | null | UTF-8 | Lean | false | false | 25,711 | 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 G. Kudryashov, Scott Morrison
-/
import data.finsupp
import ring_theory.algebra
/-!
# Monoid algebras
When the domain of a `finsupp` has a multiplicative or addi... |
49be0173d5c403307b49a8c05f5e548ffd1c3288 | f4bff2062c030df03d65e8b69c88f79b63a359d8 | /src/game/functions/twoSidedInverse.lean | ea22a646d3915283dd571c21ce873cfe96294bb6 | [
"Apache-2.0"
] | permissive | adastra7470/real-number-game | 776606961f52db0eb824555ed2f8e16f92216ea3 | f9dcb7d9255a79b57e62038228a23346c2dc301b | refs/heads/master | 1,669,221,575,893 | 1,594,669,800,000 | 1,594,669,800,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,637 | lean | import data.real.basic
open function
/-
# Chapter 6 : Functions
## Level 4
A classical result in composition of functions.
-/
-- inverses
def two_sided_inverse {X Y : set ℝ} (f : X → Y) (g : Y → X)
:= (∀ x : X, (g ∘ f)(x) = x) ∧ (∀ y : Y, (f ∘ g)(y) = y)
/- Lemma
A function $f : X → Y$ has a two-sided inverse if ... |
98c06f155348106688c1d89db747b34c54556a28 | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1730.lean | b09f4fe1f2400e1d72ce7ad48a800cbce28c9af4 | [
"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 | 486 | lean | import Lean
set_option trace.Meta.debug true
class W where
/-- w -/
w : Unit
class X extends W where
/-- x -/
x : Unit
class Y extends W where
/-- y -/
y : Unit
class Y' extends Y where
/-- h -/
h : Uint
class Z extends X, Y'
open Lean
def test (declName : Name) : CoreM Unit := do
let some docstr... |
96ef6029e3b3e39dc2898179276ce11398955d3b | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/have_tactic.lean | 309c5239a45d9850deb2adfc2bb495936d809ec3 | [
"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 | 118 | lean | example (a b c : nat) : a = b → b = c → a = c :=
begin
intro h₁ h₂,
have a = c, from eq.trans h₁ _,
end
|
347ed6b1d7c257a9bc4cad089351dd450ee3ac3e | 6432ea7a083ff6ba21ea17af9ee47b9c371760f7 | /tests/lean/run/1650.lean | 8a038eec58483e3f2603f8c039763d1d2da2a07a | [
"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 | mutual
protected def Foo.toString : Foo → String
:= fun _ => "foo"
def toString' : Foo → String := fun _ => "foo"
end
#check @Foo.toString
|
51d1636b475e980aee75efc1c75e376b1b277ee6 | 9dc8cecdf3c4634764a18254e94d43da07142918 | /src/order/heyting/basic.lean | f295ebab1a3f3a976542ff0bd68df79dccb46353 | [
"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 | 38,799 | lean | /-
Copyright (c) 2022 Yaël Dillies. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yaël Dillies
-/
import order.bounded_order
/-!
# Heyting algebras
This file defines Heyting, co-Heyting and bi-Heyting algebras.
An Heyting algebra is a bounded distributive lattice w... |
abf39c29e517d272b311db279f150d6d7872529b | 7cef822f3b952965621309e88eadf618da0c8ae9 | /src/analysis/complex/exponential.lean | 8aebb5279beea1e7bf4a01676c3444ed7ca3098c | [
"Apache-2.0"
] | permissive | rmitta/mathlib | 8d90aee30b4db2b013e01f62c33f297d7e64a43d | 883d974b608845bad30ae19e27e33c285200bf84 | refs/heads/master | 1,585,776,832,544 | 1,576,874,096,000 | 1,576,874,096,000 | 153,663,165 | 0 | 2 | Apache-2.0 | 1,544,806,490,000 | 1,539,884,365,000 | Lean | UTF-8 | Lean | false | false | 82,267 | 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
-/
import tactic.linarith data.complex.exponential analysis.specific_limits
group_theory.quotient_group analysis.comple... |
20190782edab25e9c9a5cc4a893bcab1c8386688 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /src/Lean/Meta/FunInfo.lean | 956549ddffcd9456b8f5e81aaf1e7efd466136a7 | [
"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 | 3,195 | 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.Meta.Basic
import Lean.Meta.InferType
namespace Lean
namespace Meta
@[inline] private def checkFunInfoCache (fn : Expr) (maxArgs? : Option Nat... |
3bb6c9782935954c6ac5e3edaf8c0ad80469af7c | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/topology/algebra/ordered/liminf_limsup.lean | b2ba794ddb09bc7dc09105660c3787c772e4eca0 | [
"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 | 7,745 | 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 topology.algebra.ordered.basic
import order.liminf_limsup
/-!
# Lemmas about liminf and limsup in an order topology.
-/
open... |
1b9fcf8697d455b3be102f8e62e7edbeeb4e2d9c | 69d4931b605e11ca61881fc4f66db50a0a875e39 | /src/ring_theory/polynomial_algebra.lean | a092a2f85301cc8058d5cc095ec98fc9caf3be85 | [
"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 | 12,005 | 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 ring_theory.matrix_algebra
import data.polynomial.algebra_map
/-!
# Algebra isomorphism between matrices of polynomials and polynomials of matrices
Given `[c... |
10fcdf1a81002320c2dc8a09c2c56a10bfdd31d6 | 4727251e0cd73359b15b664c3170e5d754078599 | /src/order/basic.lean | d5ed39b3f15f1090de8088bcfecf985f3ac8a3b8 | [
"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 | 27,664 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Mario Carneiro
-/
import data.prod
import data.subtype
/-!
# Basic definitions about `≤` and `<`
This file proves basic results about orders, provides extensive dot not... |
069d0c897044bb130d9bcd64f3897fd02e4347eb | aa3f8992ef7806974bc1ffd468baa0c79f4d6643 | /tests/lean/run/decidable.lean | d001eaec3c15cb11f28079f1610d19e834b43910 | [
"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 | 229 | lean | import standard data.unit
using bool unit decidable
constants a b c : bool
constants u v : unit
set_option pp.implicit true
check if ((a = b) ∧ (b = c) → ¬ (u = v) ∨ (a = c) → (a = c) ↔ a = tt ↔ true) then a else b
|
b5bca6ffffcfcf63ebcafd29263b721314413247 | 32025d5c2d6e33ad3b6dd8a3c91e1e838066a7f7 | /tests/lean/mvar1.lean | dd4adc971b479d3467b41cd115152ba01db326b3 | [
"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 | 3,084 | lean | import Lean.MetavarContext
open Lean
def check (b : Bool) : IO Unit :=
unless b (throw $ IO.userError "error")
def f := mkConst `f []
def g := mkConst `g []
def a := mkConst `a []
def b := mkConst `b []
def c := mkConst `c []
def b0 := mkBVar 0
def b1 := mkBVar 1
def b2 := mkBVar 2
def u := mkLevelParam `u
def typ... |
aa3ae4750f1947c2aa7f4eb24d0aa753d898e3c9 | 952248371e69ccae722eb20bfe6815d8641554a8 | /src/interactive.lean | f22b08afe8244be5df87c4a04fe66f5cf9dc37a0 | [] | no_license | robertylewis/lean_polya | 5fd079031bf7114449d58d68ccd8c3bed9bcbc97 | 1da14d60a55ad6cd8af8017b1b64990fccb66ab7 | refs/heads/master | 1,647,212,226,179 | 1,558,108,354,000 | 1,558,108,354,000 | 89,933,264 | 1 | 2 | null | 1,560,964,118,000 | 1,493,650,551,000 | Lean | UTF-8 | Lean | false | false | 4,208 | lean | import .control
open polya monad native
meta structure polya_cache :=
(sum_cache : rb_set sum_form_comp_data)
(prod_cache : rb_set prod_form_comp_data)
(bb : blackboard)
meta def polya_tactic := state_t polya_cache tactic
namespace polya_tactic
meta instance : monad polya_tactic := state_t.monad
meta instance : mo... |
5b959c35d1d261081062984ac5be52a85bfefc56 | f98c49f30cbc7120b78f92246f22dedad3f11f62 | /lean/book/Theorem_Proving_in_Lean/TP_02_Dependent_Type_Theory.lean | b4c16491628cba75ac2f7c73f164861aae214d84 | [
"Unlicense"
] | permissive | haroldcarr/learn-haskell-coq-ml-etc | 5a88bbbb0e0f435798ee9cab29d9e9da854174e2 | a7247caa22097573cbfa1e95fa81debeb146c12a | refs/heads/master | 1,683,755,751,897 | 1,682,914,556,000 | 1,682,914,556,000 | 12,350,346 | 36 | 9 | null | null | null | null | UTF-8 | Lean | false | false | 23,853 | lean | /-
------------------------------------------------------------------------------
2. Dependent Type Theory
Dependent type theory is a language.
Lean based on version of dependent type theory known as the Calculus of Constructions,
with a countable hierarchy of non-cumulative universes and inductive types.
-----------... |
0560d963be0616e15a5103f021d3134db06eff2d | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/list/nodup.lean | f1e94b3da337b6b071db7d09f4f29ab3c53ac9bc | [
"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 | 11,511 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Kenny Lau
-/
import data.list.pairwise
import data.list.forall2
universes u v
open nat function
variables {α : Type u} {β : Type v}
namespace list
/- no duplicates... |
4ea44edec8dd7a44dd80c31b08ed05b2bdd559cd | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/algebra/order/ring/canonical.lean | 93b3f65cb756db276711df3ab388f01bd1d217cc | [
"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 | 4,766 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura, Mario Carneiro
-/
import algebra.order.ring.defs
import algebra.order.sub.canonical
import group_theory.group_action.defs
/-!
# Canoncially ordered ri... |
760625b6cadd4fa6ffe82eda103b6a4e1cfc67c6 | c777c32c8e484e195053731103c5e52af26a25d1 | /src/number_theory/legendre_symbol/quadratic_reciprocity.lean | af92628a7b20ce008df0941853d355d91d02e086 | [
"Apache-2.0"
] | permissive | kbuzzard/mathlib | 2ff9e85dfe2a46f4b291927f983afec17e946eb8 | 58537299e922f9c77df76cb613910914a479c1f7 | refs/heads/master | 1,685,313,702,744 | 1,683,974,212,000 | 1,683,974,212,000 | 128,185,277 | 1 | 0 | null | 1,522,920,600,000 | 1,522,920,600,000 | null | UTF-8 | Lean | false | false | 14,402 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chris Hughes, Michael Stoll
-/
import number_theory.legendre_symbol.quadratic_char
/-!
# Legendre symbol and quadratic reciprocity.
This file contains results about quadratic residues ... |
c4b8a68e4041331ac8dc7a36fc13b569ab32ede9 | f57749ca63d6416f807b770f67559503fdb21001 | /hott/types/eq.hlean | c3cb79d910c6c22402c4fe3bedf81516fc282571 | [
"Apache-2.0"
] | permissive | aliassaf/lean | bd54e85bed07b1ff6f01396551867b2677cbc6ac | f9b069b6a50756588b309b3d716c447004203152 | refs/heads/master | 1,610,982,152,948 | 1,438,916,029,000 | 1,438,916,029,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 18,118 | hlean | /-
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
Partially ported from Coq HoTT
Theorems about path types (identity types)
-/
open eq sigma sigma.ops equiv is_equiv equiv.ops
-- TODO: Rename transport_eq_... and ... |
dfb7d58aeb6daa793c31d7b481b4dc31f1eba201 | 947fa6c38e48771ae886239b4edce6db6e18d0fb | /src/algebra/algebra/operations.lean | 02ed4b842e6e2e6175b1a099c34ca9054cf74363 | [
"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 | 24,428 | lean | /-
Copyright (c) 2019 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import algebra.algebra.bilinear
import algebra.module.submodule.pointwise
import algebra.module.submodule.bilinear
import algebra.module.opposites
import data.finset.pointwise
... |
edbe5bc3888ecb1daa949450b718bc8f7a6405a5 | d29d82a0af640c937e499f6be79fc552eae0aa13 | /src/data/real/basic.lean | b39793229824187f101399affa286e7f114641df | [
"Apache-2.0"
] | permissive | AbdulMajeedkhurasani/mathlib | 835f8a5c5cf3075b250b3737172043ab4fa1edf6 | 79bc7323b164aebd000524ebafd198eb0e17f956 | refs/heads/master | 1,688,003,895,660 | 1,627,788,521,000 | 1,627,788,521,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,949 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro, Floris van Doorn
-/
import order.conditionally_complete_lattice
import data.real.cau_seq_completion
import algebra.archimedean
import algebra.star.basic
/-!
# Real num... |
c968a37760d23cfad16b7e6f882d0e5e51566d6b | a721fe7446524f18ba361625fc01033d9c8b7a78 | /elaborate/concat_empty_nat.lean | 8b5118670dfbf1e9a93b17aebc55cb7f3e6f2352 | [] | 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 | 2,140 | lean | λ {lst : mylist mynat},
mylist.rec
(eq.rec true.intro
(eq.rec (eq.refl (empty = empty))
(eq.rec (eq.refl (empty = empty))
(propext {mp := λ (hl : empty = empty), true.intro, mpr := λ (hr : true), eq.refl empty}))))
(λ (lst_head : mynat) (lst_tail : mylist mynat) (lst_ih : lst_tai... |
50b0a809c7f1bf876f520bb3fd3e75f9940d3f8b | d9d511f37a523cd7659d6f573f990e2a0af93c6f | /src/algebra/geom_sum.lean | dd792ac2d41c2357ec2cce054679e311b46db358 | [
"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 | 15,382 | lean | /-
Copyright (c) 2019 Neil Strickland. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Neil Strickland
-/
import algebra.group_with_zero.power
import algebra.big_operators.order
import algebra.big_operators.ring
import algebra.big_operators.intervals
/-!
# Partial sum... |
dfea31040c9669669ec64c81189842a68a5a4a4a | ec62863c729b7eedee77b86d974f2c529fa79d25 | /25/a.lean | de477c52f07f8aca272534fa915a293e1b92f987 | [] | no_license | rwbarton/advent-of-lean-4 | 2ac9b17ba708f66051e3d8cd694b0249bc433b65 | 417c7e2718253ba7148c0279fcb251b6fc291477 | refs/heads/main | 1,675,917,092,057 | 1,609,864,581,000 | 1,609,864,581,000 | 317,700,289 | 24 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 438 | lean | @[reducible, inline] def modulus := 20201227
def main : IO Unit := do
let input ← IO.FS.lines "a.in"
let pub₁ := input[0].toNat!
let pub₂ := input[1].toNat!
let mut dlog : Array Nat := Array.mkArray modulus 0
let mut pow := 1
for j in [0:modulus-1] do
dlog := dlog.set! pow j
pow := (7 * pow) % modulus
let priv₁ :=... |
fcad944771ebfd64d8b9c04e85f1a7cc18874fe5 | 4fa118f6209450d4e8d058790e2967337811b2b5 | /src/examples/padics.lean | ab1b4e06b651377c262fb2f199e6164d1bf2a2aa | [
"Apache-2.0"
] | permissive | leanprover-community/lean-perfectoid-spaces | 16ab697a220ed3669bf76311daa8c466382207f7 | 95a6520ce578b30a80b4c36e36ab2d559a842690 | refs/heads/master | 1,639,557,829,139 | 1,638,797,866,000 | 1,638,797,866,000 | 135,769,296 | 96 | 10 | Apache-2.0 | 1,638,797,866,000 | 1,527,892,754,000 | Lean | UTF-8 | Lean | false | false | 11,553 | lean | import data.padics
import for_mathlib.ideal_operations
import for_mathlib.normed_spaces
import for_mathlib.nnreal
import for_mathlib.padics
import adic_space
/-!
# The p-adics form a Huber ring
In this file we show that ℤ_[p] and ℚ_[p] are Huber rings.
They are the fundamental examples of Huber rings.
We also show... |
c5e4c9b002eb6ff040e6373b3ffdfedd69c04481 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/monoidal/limits.lean | 89112c519d5239f6cbfed339c576d25be0d1fc2f | [] | 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,234 | 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.category_theory.monoidal.functorial
import Mathlib.category_theory.monoidal.functor_categor... |
bebcf7b33e81b002ecfb06a8cb68e435ff7d9042 | c09f5945267fd905e23a77be83d9a78580e04a4a | /src/ring_theory/localization.lean | aca005974cffd6e985c3e0985a94a9eddba60be8 | [
"Apache-2.0"
] | permissive | OHIHIYA20/mathlib | 023a6df35355b5b6eb931c404f7dd7535dccfa89 | 1ec0a1f49db97d45e8666a3bf33217ff79ca1d87 | refs/heads/master | 1,587,964,529,965 | 1,551,819,319,000 | 1,551,819,319,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 16,410 | 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
-/
import tactic.ring data.quot ring_theory.ideal_operations group_theory.submonoid
universes u v
namespace localization
variables (α : Type u) [comm_ring α] (S... |
286ba2a85ca30fafd34d1cf482e7377bfa3242fa | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/set_theory/ordinal_arithmetic.lean | 1f0bb5ae44234d54fe7f7c66144cf3ad0a23325e | [
"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 | 69,921 | 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.ordinal
/-!
# Ordinal arithmetic
Ordinals have an addition (corresponding to disjoint union) that turns them into an additive
monoid, and a multipl... |
3ca2acce662a5e0889dd3e0e7ddda0cb394221fc | fa02ed5a3c9c0adee3c26887a16855e7841c668b | /src/data/set/default.lean | ca6ef04fcd3cc1b730261240fc326f6da0a28d8a | [
"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 | 49 | lean | import data.set.finite
import data.set.intervals
|
b81b99fba8e9b16be93bdb41d1e3bdbe1bab8f89 | 4d2583807a5ac6caaffd3d7a5f646d61ca85d532 | /src/data/set/intervals/ord_connected.lean | 51a0a0d0dcbfea77971be5bffa1d827d2ed87f99 | [
"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 | 6,757 | lean | /-
Copyright (c) 2020 Yury G. Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury G. Kudryashov
-/
import data.set.intervals.unordered_interval
import data.set.lattice
/-!
# Order-connected sets
We say that a set `s : set α` is `ord_connected` if for all ... |
726ed38805b3adb00efa55c91d339861163ceb02 | 6dc0c8ce7a76229dd81e73ed4474f15f88a9e294 | /tests/playground/deriving.lean | 286b3195b73658610f3fcbfcb131ed3164f5973a | [
"Apache-2.0"
] | permissive | williamdemeo/lean4 | 72161c58fe65c3ad955d6a3050bb7d37c04c0d54 | 6d00fcf1d6d873e195f9220c668ef9c58e9c4a35 | refs/heads/master | 1,678,305,356,877 | 1,614,708,995,000 | 1,614,708,995,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 11,299 | lean | import Lean
mutual
inductive Vect (α : Type u) (β : Type v) : Nat → Nat → Type max u v where
| nil : Vect α β 0 0
| lst : List (Array (Vect α β 0 0)) → Vect α β 0 0
| cons1 : {n m : Nat} → TreeV α β n → Vect α β n m → Vect α β (n+1) m
| cons2 : {n m : Nat} → TreeV α β m → Vect α β n m → Vect α β n (m+1)
... |
9f2835d2affd31731a2ac4e1821c843f7a525c8d | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/tactic/induction.lean | c2b6e7cbda8d34a1721edd052e311f3834967ff2 | [
"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 | 55,031 | lean | /-
Copyright (c) 2020 Jannis Limperg. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jannis Limperg
-/
import tactic.clear
import tactic.dependencies
import tactic.fresh_names
import tactic.generalizes
import tactic.has_variable_names
import tactic.unify_equations
/-... |
ab2d0550693857f3c5ab76bc4e0d216f96fe32dd | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/data/set/finite.lean | 55c375e5de45068f9ac49d9a46b383d92a985dd3 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 26,864 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import data.fintype.basic
/-!
# Finite sets
This file defines predicates `finite : set α → Prop` and `infinite : set α → Prop` and proves some
basic... |
ba6fe02c6447050f2dc18c2be8c530801f811f7f | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/tactic/linarith/parsing.lean | 9e946e0f99f95bcec15c9ad01c038851cae27c18 | [] | 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,454 | lean | /-
Copyright (c) 2020 Robert Y. Lewis. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Robert Y. Lewis
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.tactic.linarith.datatypes
import Mathlib.PostPort
namespace Mathlib
/-!
# Parsing input... |
da6c6ab9e6dc81ed2fde319461b07ea6b505a0da | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/category_theory/limits/constructions/equalizers.lean | 65d273df6b00586c30a371d12d6937495578f034 | [] | 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,593 | 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.shapes.equalizers
import Mathlib.category_theory.limits.shapes.binary_pr... |
6f133dda76009bad4bbec325025d598c02ecdc9c | da3a76c514d38801bae19e8a9e496dc31f8e5866 | /tests/lean/run/eval_attr_cache.lean | 1f968ecdc523eaa3b786d98d929d94a42f7ac765 | [
"Apache-2.0"
] | permissive | cipher1024/lean | 270c1ac5781e6aee12f5c8d720d267563a164beb | f5cbdff8932dd30c6dd8eec68f3059393b4f8b3a | refs/heads/master | 1,611,223,459,029 | 1,487,566,573,000 | 1,487,566,573,000 | 83,356,543 | 0 | 0 | null | 1,488,229,336,000 | 1,488,229,336,000 | null | UTF-8 | Lean | false | false | 798 | lean | open tactic
meta def my_attr : caching_user_attribute (name → bool) :=
{ name := "my_attr",
descr := "my attr",
mk_cache := λ ls, do {
els ← list_name.to_expr ls,
c ← to_expr `(λ n : name, (name.cases_on n ff (λ _ _, to_bool (n ∈ %%els)) (λ _ _, ff) : bool)),
eval_expr (name → bool) c... |
d2d816b4f33b00b415489c3adbf2e6c9362b8d01 | 91b8df3b248df89472cc0b753fbe2bac750aefea | /experiments/lean/src/ddl/binary/subst.lean | 1585bdb7955dcc939a96402dcf5d7320f77958bf | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | yeslogic/fathom | eabe5c4112d3b4d5ec9096a57bb502254ddbdf15 | 3960a9466150d392c2cb103c5cb5fcffa0200814 | refs/heads/main | 1,685,349,769,736 | 1,675,998,621,000 | 1,675,998,621,000 | 28,993,871 | 214 | 11 | Apache-2.0 | 1,694,044,276,000 | 1,420,764,938,000 | Rust | UTF-8 | Lean | false | false | 3,325 | lean | import ddl.binary.basic
import ddl.binary.monad
namespace ddl.binary
-- open ddl.binary
namespace type
variables {ℓ α : Type} [decidable_eq α]
def open_var : ℕ → α → type ℓ α → type ℓ α
| i x (bvar i') := if i = i' then fvar x else bvar i'
| i x (fvar x') := fvar x'
| i x (bit) := bi... |
e6542fd6a987518735250eb019a101aaf28d6030 | c777c32c8e484e195053731103c5e52af26a25d1 | /archive/imo/imo1998_q2.lean | c4133b49d376ee48ff436fb78ad56b055ce685b4 | [
"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 | 9,502 | lean | /-
Copyright (c) 2020 Oliver Nash. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Nash
-/
import data.fintype.prod
import data.int.parity
import algebra.big_operators.order
import tactic.ring
import tactic.noncomm_ring
/-!
# IMO 1998 Q2
In a competition, there ... |
e92bc4371571e5c85c2e8782983d24d6966f5220 | 82b86ba2ae0d5aed0f01f49c46db5afec0eb2bd7 | /tests/lean/run/tacticTests.lean | f760b78bb1ccabaf095525ed77cf34ceed59bd57 | [
"Apache-2.0"
] | permissive | banksonian/lean4 | 3a2e6b0f1eb63aa56ff95b8d07b2f851072d54dc | 78da6b3aa2840693eea354a41e89fc5b212a5011 | refs/heads/master | 1,673,703,624,165 | 1,605,123,551,000 | 1,605,123,551,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 2,412 | lean | inductive Le (m : Nat) : Nat → Prop
| base : Le m m
| succ : (n : Nat) → Le m n → Le m n.succ
theorem ex1 (m : Nat) : Le m 0 → m = 0 := by
intro h
cases h
rfl
theorem ex2 (m n : Nat) : Le m n → Le m.succ n.succ := by
intro h
induction h
| base n => apply Le.base
| succ n m ih =>
apply Le.succ
... |
b984ddbd88e88ae0ea1ae0ee40ff988aa0e05af8 | 3ed5a65c1ab3ce5d1a094edce8fa3287980f197b | /src/herstein/ex2_3/Q_12.lean | dcfdf4b4555864fb98fa7438d6a0e1985194dd5b | [] | no_license | group-study-group/herstein | 35d32e77158efa2cc303c84e1ee5e3bc80831137 | f5a1a72eb56fa19c19ece0cb3ab6cf7ffd161f66 | refs/heads/master | 1,586,202,191,519 | 1,548,969,759,000 | 1,548,969,759,000 | 157,746,953 | 0 | 0 | null | 1,542,412,901,000 | 1,542,302,366,000 | Lean | UTF-8 | Lean | false | false | 1,601 | lean | import algebra.group
variable {G: Type*}
-- mathlib's constructor for `group` asks only for a (two-sided) identity
-- alongside a left inverse. This exercise shows it is possible to produce
-- both of those things if given a right identity and a right inverse.
theorem Q_12 (G: Type*) (mul: G → G → G) (e: G) (y: G → G... |
0f729b94b00ad2e6ff434449f18be911786c2620 | 74addaa0e41490cbaf2abd313a764c96df57b05d | /Mathlib/linear_algebra/dimension.lean | 9558e5ab6c861a826df617af28fdbe4ea316fe7e | [] | 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 | 21,407 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro, Johannes Hölzl, Sander Dahmen
-/
import Mathlib.PrePort
import Mathlib.Lean3Lib.init.default
import Mathlib.linear_algebra.basis
import Mathlib.set_theory.cardinal_ordin... |
20dca16905ec2c347e15540b33a96ba17ed1af75 | 5d166a16ae129621cb54ca9dde86c275d7d2b483 | /library/init/data/nat/bitwise.lean | dd25ea4b2e7e5af6de0ea27961d70a16ae1d9938 | [
"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 | 7,827 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
-/
prelude
import .lemmas init.meta.well_founded_tactics
universe u
namespace nat
def shiftl : ℕ → ℕ → ℕ
| m 0 := m
| m (n+1) := 2 * shiftl m n
de... |
1994981c1bf897c6630bb9e07a40542f6931cea3 | 19cc34575500ee2e3d4586c15544632aa07a8e66 | /src/field_theory/tower.lean | b3a05e689ead3177e6767f5431a5b575b8c94e0c | [
"Apache-2.0"
] | permissive | LibertasSpZ/mathlib | b9fcd46625eb940611adb5e719a4b554138dade6 | 33f7870a49d7cc06d2f3036e22543e6ec5046e68 | refs/heads/master | 1,672,066,539,347 | 1,602,429,158,000 | 1,602,429,158,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 5,072 | lean | /-
Copyright (c) 2020 Kenny Lau. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau
-/
import ring_theory.algebra_tower
import linear_algebra.matrix
/-!
# Tower of field extensions
In this file we prove the tower law for arbitrary extensions and finite extensi... |
67be6d50e2003b3c5f9a02305a2f5255f9b6eb7b | bbecf0f1968d1fba4124103e4f6b55251d08e9c4 | /src/topology/metric_space/lipschitz.lean | 786f99a94abb58eabc74dee05dc7b459633011a9 | [
"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 | 16,463 | lean | /-
Copyright (c) 2018 Rohan Mitta. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rohan Mitta, Kevin Buzzard, Alistair Tucker, Johannes Hölzl, Yury Kudryashov
-/
import logic.function.iterate
import data.set.intervals.proj_Icc
import topology.metric_space.basic
import ... |
ea6a04850017fb4de1f751ea70515e0538b1dfe7 | e00ea76a720126cf9f6d732ad6216b5b824d20a7 | /src/data/zmod/basic.lean | d90e2afc57777ba79643b4d16286fef290941c87 | [
"Apache-2.0"
] | permissive | vaibhavkarve/mathlib | a574aaf68c0a431a47fa82ce0637f0f769826bfe | 17f8340912468f49bdc30acdb9a9fa02eeb0473a | refs/heads/master | 1,621,263,802,637 | 1,585,399,588,000 | 1,585,399,588,000 | 250,833,447 | 0 | 0 | Apache-2.0 | 1,585,410,341,000 | 1,585,410,341,000 | null | UTF-8 | Lean | false | false | 21,613 | lean | /-
Copyright (c) 2018 Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Chris Hughes
-/
import data.int.modeq data.int.gcd data.fintype data.pnat.basic tactic.ring
/-!
# Integers mod `n`
Definition of the integers mod n, and the field structure on the inte... |
0af461139b51aa9e5177847e54be6e77f77f1209 | 8cb37a089cdb4af3af9d8bf1002b417e407a8e9e | /library/init/meta/interaction_monad.lean | 2afc5e45d2514e00d7c92a3d92e91b1cf5ca305b | [
"Apache-2.0"
] | permissive | kbuzzard/lean | ae3c3db4bb462d750dbf7419b28bafb3ec983ef7 | ed1788fd674bb8991acffc8fca585ec746711928 | refs/heads/master | 1,620,983,366,617 | 1,618,937,600,000 | 1,618,937,600,000 | 359,886,396 | 1 | 0 | Apache-2.0 | 1,618,936,987,000 | 1,618,936,987,000 | null | UTF-8 | Lean | false | false | 4,438 | lean | /-
Copyright (c) 2017 Microsoft Corporation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Leonardo de Moura, Sebastian Ullrich
-/
prelude
import init.function init.data.option.basic init.util
import init.control.combinators init.control.monad init.control.alternative... |
e62d281b3db34009b77d73966a6651345b86f86a | 63abd62053d479eae5abf4951554e1064a4c45b4 | /src/topology/subset_properties.lean | 4e9dda350b681618d260ecb1237a423bf1b7012b | [
"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 | 59,318 | 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 topology.continuous_on
import data.finset.order
/-!
# Properties of subsets of topological spaces
## Main definitions
`comp... |
4b4136c9d5c61e32c0313f72473a0a3cab2290cf | d1a52c3f208fa42c41df8278c3d280f075eb020c | /src/Lean/Compiler/IR/Boxing.lean | 31e9c9e15adb3e237a11b3f2e2a7ffd04e013102 | [
"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 | 13,275 | 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.Runtime
import Lean.Compiler.ClosedTermCache
import Lean.Compiler.ExternAttr
import Lean.Compiler.IR.Basic
import Lean.Compiler.IR.CompilerM
imp... |
8aaac4f1fd873494ef380ca9659d4f3cb5338b37 | 5e3548e65f2c037cb94cd5524c90c623fbd6d46a | /src_icannos_totilas/topologie-espaces-normés/cpge_ten_02c.lean | c6eb447e4cac0999ba55526f8b27ff21af198e54 | [] | no_license | ahayat16/lean_exos | d4f08c30adb601a06511a71b5ffb4d22d12ef77f | 682f2552d5b04a8c8eb9e4ab15f875a91b03845c | refs/heads/main | 1,693,101,073,585 | 1,636,479,336,000 | 1,636,479,336,000 | 415,000,441 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 676 | lean | import data.set.basic
import topology.basic
import algebra.module.basic
import algebra.module.submodule
import analysis.normed_space.basic
-- On désigne par p1 et p2 les applications coordonnées de R 2 définies par pi (x1 , x2 ) = xi.
-- (a) Soit O un ouvert de R 2 , montrer que p 1 (O) et p 2 (O) sont des ouvert... |
a51c98a47098c132b8f2e7d9f3164e8d0d630bad | 35677d2df3f081738fa6b08138e03ee36bc33cad | /src/computability/turing_machine.lean | ca400cd8c50da04e55496c2b8cd9fe1c0b6e8ebc | [
"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 | 68,009 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Mario Carneiro
Define a sequence of simple machine languages, starting with Turing
machines and working up to more complex lanaguages based on
Wang B-machines.
-/
import data.fintype.b... |
23da7fb2f8ff2b7a0f6b774e2694a78f897d14c5 | 206422fb9edabf63def0ed2aa3f489150fb09ccb | /src/algebra/direct_limit.lean | 178db43c74c18e5d0ef99576a7ee0a03d76a0268 | [
"Apache-2.0"
] | permissive | hamdysalah1/mathlib | b915f86b2503feeae268de369f1b16932321f097 | 95454452f6b3569bf967d35aab8d852b1ddf8017 | refs/heads/master | 1,677,154,116,545 | 1,611,797,994,000 | 1,611,797,994,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 24,940 | lean | /-
Copyright (c) 2019 Kenny Lau, Chris Hughes. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kenny Lau, Chris Hughes
-/
import data.finset.order
import linear_algebra.direct_sum_module
import ring_theory.free_comm_ring
import ring_theory.ideal.operations
/-!
# Direct ... |
0306b1ca201432df4d056d4bb2eac1c187bcc53a | 80cc5bf14c8ea85ff340d1d747a127dcadeb966f | /src/data/set/function.lean | 99872f8d59cf832d610f3c955c9442296fbd30ae | [
"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 | 24,902 | lean | /-
Copyright (c) 2014 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Jeremy Avigad, Andrew Zipperer, Haitao Zhang, Minchao Wu, Yury Kudryashov
-/
import data.set.basic
import logic.function.conjugate
/-!
# Functions over sets
## Main definitions
### ... |
63a568f9c381be8ae495b50ec0690851e0dfff14 | fe84e287c662151bb313504482b218a503b972f3 | /src/commutative_algebra/galois_field_4.lean | 584f26295ebe406fb7b2f1eb6333e2db6fa5f49a | [] | no_license | NeilStrickland/lean_lib | 91e163f514b829c42fe75636407138b5c75cba83 | 6a9563de93748ace509d9db4302db6cd77d8f92c | refs/heads/master | 1,653,408,198,261 | 1,652,996,419,000 | 1,652,996,419,000 | 181,006,067 | 4 | 1 | null | null | null | null | UTF-8 | Lean | false | false | 1,473 | lean | import algebra.ring algebra.field.basic
@[derive decidable_eq]
inductive F4 : Type
| zero : F4
| one : F4
| alpha : F4
| beta : F4
namespace F4
def add : F4 → F4 → F4
| zero y := y
| x zero := x
| one one := zero
| one alpha := beta
| one beta := alpha
| alpha one := beta
| alpha alpha ... |
e42686354d40863a68b5f54df1866880cd4484ce | 9b9a16fa2cb737daee6b2785474678b6fa91d6d4 | /src/analysis/normed_space/bounded_linear_maps.lean | 03ea61296c4a0899fcb393d093d2cd7b91441c18 | [
"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 | 5,906 | lean | /-
Copyright (c) 2018 Patrick Massot. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Patrick Massot, Johannes Hölzl
Continuous linear functions -- functions between normed vector spaces which are bounded and linear.
-/
import algebra.field
import tactic.norm_num
impor... |
d7ed1d968f76732a878087dca1a5befee5733277 | b7f22e51856f4989b970961f794f1c435f9b8f78 | /tests/lean/hott/360_2.hlean | 0669962f7a6998588d1e02fe2575eebbcbfa2637 | [
"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 | 345 | hlean | open is_trunc
--structure is_contr [class] (A : Type) : Type
section
parameters {P : Π(A : Type), A → Type}
definition my_contr {A : Type} [H : is_contr A] (a : A) : P A a := sorry
definition foo2
(A : Type)
(B : A → Type)
(a : A)
(x : B a)
(H : Π (a : A), is_contr (B a)) --(H : is_contr (B a))
: P (B a) x :=
by ... |
6ff2ac8e0d7f88eeb67867999c2d12feb0125b33 | 437dc96105f48409c3981d46fb48e57c9ac3a3e4 | /src/topology/metric_space/gromov_hausdorff.lean | 3ecf61ef59b053f94a1e6d295b29a97d37692a52 | [
"Apache-2.0"
] | permissive | dan-c-k/mathlib | 08efec79bd7481ee6da9cc44c24a653bff4fbe0d | 96efc220f6225bc7a5ed8349900391a33a38cc56 | refs/heads/master | 1,658,082,847,093 | 1,589,013,201,000 | 1,589,013,201,000 | null | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 55,764 | 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
-/
import topology.metric_space.closeds
import set_theory.cardinal
import topology.metric_space.gromov_hausdorff_realized
import topology.metric_space.completion
/... |
4e71bc0c1da47f5bd0206d989868a20363fe574e | 54f4ad05b219d444b709f56c2f619dd87d14ec29 | /my_project/src/love13_rational_and_real_numbers_exercise_sheet.lean | 6e872650d4a148eb942fa43ca71db80aa150faff | [] | no_license | yizhou7/learning-lean | 8efcf838c7276e235a81bd291f467fa43ce56e0a | 91fb366c624df6e56e19555b2e482ce767cd8224 | refs/heads/master | 1,675,649,087,737 | 1,609,022,281,000 | 1,609,022,281,000 | 272,072,779 | 0 | 0 | null | null | null | null | UTF-8 | Lean | false | false | 1,160 | lean | import .love05_inductive_predicates_demo
import .love13_rational_and_real_numbers_demo
/-! # LoVe Exercise 13: Rational and Real Numbers -/
set_option pp.beta true
namespace LoVe
/-! ## Question 1: Rationals
1.1. Prove the following lemma.
Hint: The lemma `fraction.mk.inj_eq` might be useful. -/
#check fractio... |
28192e05cf5ad94826d3065fa090de44185b2bcb | 6f1049e897f569e5c47237de40321e62f0181948 | /src/solutions/07bis_abstract_negations.lean | 434026eb89d9b3f2d8efebf333d330d74114743d | [
"Apache-2.0"
] | permissive | anrddh/tutorials | f654a0807b9523608544836d9a81939f8e1dceb8 | 3ba43804e7b632201c494cdaa8da5406f1a255f9 | refs/heads/master | 1,655,542,921,827 | 1,588,846,595,000 | 1,588,846,595,000 | 262,330,134 | 0 | 0 | null | 1,588,944,346,000 | 1,588,944,345,000 | null | UTF-8 | Lean | false | false | 2,443 | 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 et by_cases.... |
1f0edbf4ce5d50c4708f8bf875eca48ccf1502bd | 4727251e0cd73359b15b664c3170e5d754078599 | /archive/100-theorems-list/16_abel_ruffini.lean | 3b6d17fced1b4fce1a9bce912f5dd53518383d41 | [
"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 | 8,311 | lean | /-
Copyright (c) 2021 Thomas Browning. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Thomas Browning
-/
import field_theory.abel_ruffini
import analysis.calculus.local_extr
import ring_theory.eisenstein_criterion
/-!
Construction of an algebraic number that is not sol... |
63ddf71752d17f9559e805b5e00c2287bcea08cd | 618003631150032a5676f229d13a079ac875ff77 | /src/tactic/ring2.lean | 96c740256c6fc1bd396cda400cede3d68b78f580 | [
"Apache-2.0"
] | permissive | awainverse/mathlib | 939b68c8486df66cfda64d327ad3d9165248c777 | ea76bd8f3ca0a8bf0a166a06a475b10663dec44a | refs/heads/master | 1,659,592,962,036 | 1,590,987,592,000 | 1,590,987,592,000 | 268,436,019 | 1 | 0 | Apache-2.0 | 1,590,990,500,000 | 1,590,990,500,000 | null | UTF-8 | Lean | false | false | 20,978 | lean | /-
Copyright (c) 2018 Mario Carneiro. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Mario Carneiro
-/
import tactic.ring
import data.num.lemmas
import data.tree
/-!
# ring2
An experimental variant on the `ring` tactic that uses computational
reflection instead of pr... |
e878b4f48581328da46604876c43ae0ad25fc4ad | 5df84495ec6c281df6d26411cc20aac5c941e745 | /src/formal_ml/random_variable_identical.lean | 9fbbdaab36e3a5d3c4266620d3f72378221d81a9 | [
"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 | 12,974 | lean | /-
Copyright 2021 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... |
a104e3ade0a09919f14ceb90c66b925c76e73c22 | 649957717d58c43b5d8d200da34bf374293fe739 | /src/category_theory/monoidal/category_aux.lean | 6e3382df90afe9f9e4eba1ae54ddea0d7c54ab56 | [
"Apache-2.0"
] | permissive | Vtec234/mathlib | b50c7b21edea438df7497e5ed6a45f61527f0370 | fb1848bbbfce46152f58e219dc0712f3289d2b20 | refs/heads/master | 1,592,463,095,113 | 1,562,737,749,000 | 1,562,737,749,000 | 196,202,858 | 0 | 0 | Apache-2.0 | 1,562,762,338,000 | 1,562,762,337,000 | null | UTF-8 | Lean | false | false | 3,221 | 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
--
-- Auxiliary definitions for the definition of a monoidal category.
-/
import category_theory.products
universes v u
open category_th... |
0afc421847c618e6e475986d8b40b4af470cc604 | 82e44445c70db0f03e30d7be725775f122d72f3e | /src/topology/separation.lean | 23673b896eabee349da7a1c77965ddb32c7741ea | [
"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 | 57,585 | lean | /-
Copyright (c) 2017 Johannes Hölzl. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Johannes Hölzl, Mario Carneiro
-/
import topology.subset_properties
import topology.connected
/-!
# Separation properties of topological spaces.
This file defines the predicate `sepa... |
f4a612b4e2df4373d9b7b1213aa0f3cd50f7672f | 626e312b5c1cb2d88fca108f5933076012633192 | /src/data/finset/lattice.lean | 6faa7408e6ebb5ccf7c3166a3c95fa885e445c00 | [
"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 | 42,620 | 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.finset.fold
import data.multiset.lattice
import order.order_dual
import order.complete_lattice
/-!
# Lattice operations on finsets
-/
variables {α β γ :... |
f7d7ad280f801d274914bece49c02fdf47a99b10 | 6de8ea38e7f58ace8fbf74ba3ad0bf3b3d1d7ab5 | /solutions2/Problem2/solutions.lean | 7c466bf3c95d4b4196a12971e64a62bf8ea825fc | [] | no_license | KinanBab/CS591K1-Labs | 72f4e2c7d230d4e4f548a343a47bf815272b1f58 | d4569bf99d20c22cd56721024688cda247d1447f | refs/heads/master | 1,587,016,758,873 | 1,558,148,366,000 | 1,558,148,366,000 | 165,329,114 | 5 | 2 | null | 1,550,689,848,000 | 1,547,252,664,000 | TeX | UTF-8 | Lean | false | false | 3,302 | lean | import .lambda
-- Problem 2: Lambda Calculus and Church Numerals (30 points for full credit, >=45 possible points with bonus)
-- From nat to Church Numerals
@[simp] def zero := term.abs 1 (term.abs 0 (term.var 0)) -- λf. λx. x
@[simp] def succ :=
term.abs 2
(term.abs 1
(term.abs 0
(term.app
... |
a126dc13752f77eb430069596ce82e4c5a17525b | 9be442d9ec2fcf442516ed6e9e1660aa9071b7bd | /src/Init/Data/Int/Basic.lean | d073f1bc839f4f7ad4950d909f0d82eee3b2ce78 | [
"Apache-2.0",
"LLVM-exception",
"NCSA",
"LGPL-3.0-only",
"LicenseRef-scancode-inner-net-2.0",
"BSD-3-Clause",
"LGPL-2.0-or-later",
"Spencer-94",
"LGPL-2.1-or-later",
"HPND",
"LicenseRef-scancode-pcre",
"ISC",
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"SunPro",
"CMU-Mach"... | permissive | EdAyers/lean4 | 57ac632d6b0789cb91fab2170e8c9e40441221bd | 37ba0df5841bde51dbc2329da81ac23d4f6a4de4 | refs/heads/master | 1,676,463,245,298 | 1,660,619,433,000 | 1,660,619,433,000 | 183,433,437 | 1 | 0 | Apache-2.0 | 1,657,612,672,000 | 1,556,196,574,000 | Lean | UTF-8 | Lean | false | false | 4,709 | lean | /-
Copyright (c) 2016 Jeremy Avigad. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Avigad, Leonardo de Moura
The integers, with addition, multiplication, and subtraction.
-/
prelude
import Init.Coe
import Init.Data.Nat.Div
import Init.Data.List.Basic
open Nat
... |
3717dad8e173207e52561ec6f3c38da7b9caa857 | 8cae430f0a71442d02dbb1cbb14073b31048e4b0 | /src/order/locally_finite.lean | f6194e68b8b8101efb951593b82c77997c61cdb2 | [
"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 | 43,894 | 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.preimage
import data.set.intervals.unordered_interval
/-!
# Locally finite orders
> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
> Any changes to this fi... |
4a055d36883881fdf645a6918753e30ffab09577 | d406927ab5617694ec9ea7001f101b7c9e3d9702 | /src/measure_theory/function/special_functions/basic.lean | b2d848d277d4e1930b2d9b9c8bd2194a6757e06d | [
"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 | 8,253 | lean | /-
Copyright (c) 2020 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import analysis.special_functions.pow
import measure_theory.constructions.borel_space
/-!
# Measurability of real and complex functions
We show that most standar... |
3ecf7078058f64b8f7b9068d70ec4fbb1065b5c3 | 1a61aba1b67cddccce19532a9596efe44be4285f | /hott/types/eq.hlean | 9b3738250175431e9df45169d6456ed1ea513749 | [
"Apache-2.0"
] | permissive | eigengrau/lean | 07986a0f2548688c13ba36231f6cdbee82abf4c6 | f8a773be1112015e2d232661ce616d23f12874d0 | refs/heads/master | 1,610,939,198,566 | 1,441,352,386,000 | 1,441,352,494,000 | 41,903,576 | 0 | 0 | null | 1,441,352,210,000 | 1,441,352,210,000 | null | UTF-8 | Lean | false | false | 21,413 | hlean | /-
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
Partially ported from Coq HoTT
Theorems about path types (identity types)
-/
import types.sigma
open eq sigma sigma.ops equiv is_equiv equiv.ops is_trunc
-- TODO: ... |
96c25e87a32ece92adb32b734c728f688a0cad0c | e38e95b38a38a99ecfa1255822e78e4b26f65bb0 | /src/certigrad/compute_grad_slow_correct.lean | 9ada92e6df53038e1ef9ca16121fb275c01b5dd5 | [
"Apache-2.0"
] | permissive | ColaDrill/certigrad | fefb1be3670adccd3bed2f3faf57507f156fd501 | fe288251f623ac7152e5ce555f1cd9d3a20203c2 | refs/heads/master | 1,593,297,324,250 | 1,499,903,753,000 | 1,499,903,753,000 | 97,075,797 | 1 | 0 | null | 1,499,916,210,000 | 1,499,916,210,000 | null | UTF-8 | Lean | false | false | 20,450 | lean | /-
Copyright (c) 2017 Daniel Selsam. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Author: Daniel Selsam
Proof that the simple, non-memoized version of stochastic backpropagation
is correct.
-/
import .graph .estimators .predicates .compute_grad .lemmas .tgrads .tactics
name... |
4043bdd5038b0efdb5c131a99a33eccf4f5464a1 | 3bdd27ffdff3ffa22d4bb010eba695afcc96bc4a | /src/sperner.lean | bc18cfc464576a2efcdcface08b8fa1ff532fdd9 | [] | 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 | 9,811 | lean | import tactic
import data.set.finite
import data.real.basic
import data.real.ereal
import linear_algebra.affine_space.independent
import analysis.convex.basic
import topology.sequences
noncomputable theory
open set affine topological_space
open_locale affine filter big_operators
variables {V : Type*} [add_comm_grou... |
d9ad28bb7bb3f3e060caf61306d2111bada312df | 4efff1f47634ff19e2f786deadd394270a59ecd2 | /src/data/list/min_max.lean | 226817b043d99e3ab8afef794abf6e580cd4bc5e | [
"Apache-2.0"
] | permissive | agjftucker/mathlib | d634cd0d5256b6325e3c55bb7fb2403548371707 | 87fe50de17b00af533f72a102d0adefe4a2285e8 | refs/heads/master | 1,625,378,131,941 | 1,599,166,526,000 | 1,599,166,526,000 | 160,748,509 | 0 | 0 | Apache-2.0 | 1,544,141,789,000 | 1,544,141,789,000 | null | UTF-8 | Lean | false | false | 11,131 | 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
-/
import data.list.basic
/-
# Minimum and maximum of lists
## Main definitions
The main definitions are `argmax`, `argmin`, `minimum` and `maximum` for lists.
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.