This commit is contained in:
Jon Eugster
2023-03-20 17:53:39 +01:00
parent ae58652fa9
commit 83ee409f47
5 changed files with 42 additions and 40 deletions
@@ -10,7 +10,6 @@ import TestGame.Levels.LinearAlgebra.L08_GeneratingSet
import TestGame.Levels.LinearAlgebra.M01_LinearMap import TestGame.Levels.LinearAlgebra.M01_LinearMap
import TestGame.Levels.LinearAlgebra.M02_LinearIndep import TestGame.Levels.LinearAlgebra.M02_LinearIndep
import TestGame.Levels.LinearAlgebra.M04_Basis import TestGame.Levels.LinearAlgebra.M04_Basis
import TestGame.Levels.LinearAlgebra.M05_Basis
import TestGame.Levels.LinearAlgebra.N01_Span import TestGame.Levels.LinearAlgebra.N01_Span
import TestGame.Levels.LinearAlgebra.N02_Span import TestGame.Levels.LinearAlgebra.N02_Span
@@ -8,6 +8,7 @@ import Mathlib.Data.Fin.VecNotation
-- import Mathlib.LinearAlgebra.Finsupp -- import Mathlib.LinearAlgebra.Finsupp
import Mathlib.Algebra.BigOperators.Basic -- default import Mathlib.Algebra.BigOperators.Basic -- default
-- import Mathlib.LinearAlgebra.LinearIndependent -- import Mathlib.LinearAlgebra.LinearIndependent
import Mathlib
Game "TestGame" Game "TestGame"
World "Basis" World "Basis"
@@ -15,7 +16,9 @@ Level 2
Title "Lineare Unabhängigkeit" Title "Lineare Unabhängigkeit"
--notation "ℝ²" => Fin 2 → ℝ namespace Ex_LinIndep
scoped notation "ℝ²" => Fin 2 → ℝ
Introduction Introduction
" "
@@ -23,18 +26,24 @@ Introduction
Statement Statement
"Zeige, dass `![1, 0], ![1, 1]` linear unabhängig über `ℝ` sind." "Zeige, dass `![1, 0], ![1, 1]` linear unabhängig über `ℝ` sind."
: True := by -- linearIndependent ℝ ![(![1, 0] : ℝ²), ![1, 1]] := by : LinearIndependent ℝ ![(![1, 0] : ℝ²), ![1, 1]] := by
trivial Hint "`rw [Fintype.linearIndependent_iff]`"
rw [Fintype.linearIndependent_iff]
Hint "`intros c h`"
intros c h
Hint "BUG: `simp at h` does not work :("
simp at h -- doesn't work
sorry
-- begin -- rw [Fintype.linearIndependent_iff]
-- rw fintype.linear_independent_iff, -- intros c h
-- intros c h, -- simp at h
-- simp at h, -- intros i
-- intros i, -- fin_cases i
-- fin_cases i, -- swap
-- swap, -- { exact h.2 }
-- { exact h.2 }, -- { have h' := h.1
-- { have h' := h.1, -- rw [h.2, add_zero] at h'
-- rw [h.2, add_zero] at h', -- exact h'}
-- exact h'}
-- end end Ex_LinIndep
@@ -1,6 +1,7 @@
import TestGame.Metadata import TestGame.Metadata
import Mathlib.Algebra.Module.Submodule.Lattice import Mathlib.Algebra.Module.Submodule.Lattice
import Mathlib
Game "TestGame" Game "TestGame"
World "Basis" World "Basis"
@@ -8,12 +9,24 @@ Level 4
Title "Basis" Title "Basis"
namespace Ex_Basis
scoped notation "ℝ²" => Fin 2 → ℝ
open Submodule
Introduction Introduction
" "
" "
Statement lemma exercise1 : LinearIndependent ℝ ![(![1, 0] : ℝ²), ![1, 1]] := sorry
""
: True := by -- Basis (Fin 2) ℝ ℝ² := by lemma exercise2 : ⊤ ≤ span ℝ (Set.range ![(![1, 0] : Fin 2 → ℝ), ![1, 1]]) := sorry
trivial
Statement : Basis (Fin 2) ℝ ℝ² := by
apply Basis.mk
apply exercise1
apply exercise2
end Ex_Basis
@@ -1,19 +0,0 @@
import TestGame.Metadata
import Mathlib.Algebra.Module.Submodule.Lattice
Game "TestGame"
World "Basis"
Level 5
Title "Lineare Abbildung"
Introduction
"
"
Statement
""
: True := by
trivial
@@ -62,6 +62,6 @@ Statement subset_empty_iff {A : Type _} (s : Set A) :
NewTactic constructor intro rw assumption rcases simp tauto trivial NewTactic constructor intro rw assumption rcases simp tauto trivial
NewLemma Subset.antisymm empty_subset NewLemma Subset.antisymm Subset.antisymm_iff empty_subset
end MySet end MySet