Skip to content

fix(gametheory,#16909): clarifier enonce cellule 29 — la matrice [[1,0],[0,1]] a pour optimum la TRANSPOSITION #16912

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
myia-ai-01 merged 1 commit into from
Sep 22, 2026
Merged

fix(gametheory,#16909): clarifier enonce cellule 29 — la matrice [[1,0],[0,1]] a pour optimum la TRANSPOSITION #16912

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion MyIA.AI.Notebooks/GameTheory/GameTheory-23b-Lean-Assignment-Native.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1581,7 +1581,10 @@
"source": [
"-- Exercice 1 (Definitions) : votre propre matrice 2x2.\n",
"-- Construire une matrice C2 : Fin 2 → Fin 2 → ℤ dont l'affectation optimale\n",
"-- N'EST PAS l'identite (la transposition gagne : [[1, 0], [0, 1]] → swap = 0, id = 2).\n",
"-- N'EST PAS l'identité (la matrice [[1, 0], [0, 1]] en est un bon\n",
"-- prototype : identité de coût 2 mais transposition de coût 0, donc\n",
"-- l'optimum est la TRANSPOSITION (Equiv.swap) — exactement ce qu'on\n",
"-- cherche à faire surgir dans le théorème optimal_C2 ci-dessous).\n",
"--\n",
"-- Etape 1 : definir C2 avec la notation ![![.., ..], ![.., ..]].\n",
"-- Etape 2 : #eval Assignment.value C2 sur Equiv.refl _ et (Equiv.swap (0 : Fin 2) 1).\n",
Expand Down
Loading