WickContraction.mem_not_eq_erase_of_isSome
theoremverifiedformalizationimported Lean
WickContraction.mem_not_eq_erase_of_isSome
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open WickContraction in variable {𝓕 : FieldSpecification} in variable {n : ℕ} (c : WickContraction n) in lemma WickContraction.mem_not_eq_erase_of_isSome (c : WickContraction n.succ) (i : Fin n.succ) (h : (c.getDual? i).isSome) (ha : a ∈ c.1) (ha2 : a ≠ {i, (c.getDual? i).get h}) : ∃ a', a' ∈ (c.erase i).1 ∧ a = Finset.map i.succAboveEmb a'
- Formalizes
- Physlib, `WickContraction.mem_not_eq_erase_of_isSome`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.WickContraction.mem_not_eq_erase_of_isSome← WickContraction.mem_not_eq_erase_of_isSome (Physlib/QFT/PerturbationTheory/WickContraction/Erase.lean:74): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 28
- WickContraction.sndFieldOfContract_congrWickContraction.sndFieldOfContract_congr
- WickContraction.getDual?_get_self_neqWickContraction.getDual?_get_self_neq
- WickContraction.fstFieldOfContract_congrWickContraction.fstFieldOfContract_congr
- WickContraction.getDual?_eq_some_iff_memWickContraction.getDual?_eq_some_iff_mem
- WickContractionGiven a natural number
n, which will correspond to the number of fields needing contracting, a Wick contraction is a finite set of pairs… - WickContraction.congr_trans_applyWickContraction.congr_trans_apply
- WickContraction.uncontracted_emptyWickContraction.uncontracted_empty
- WickContraction.congr_transWickContraction.congr_trans
- WickContraction.uncontractedCongr_someWickContraction.uncontractedCongr_some
- WickContraction.uncontractedCongr_noneWickContraction.uncontractedCongr_none
- WickContraction.card_congrWickContraction.card_congr
- WickContraction.sndFieldOfContract_memWickContraction.sndFieldOfContract_mem
- WickContraction.sndFieldOfContract_getDual?WickContraction.sndFieldOfContract_getDual?
- WickContraction.getDual?_get_self_memWickContraction.getDual?_get_self_mem
- WickContraction.getDual?For a contraction
c : WickContraction nandi : Fin nthejsuch that{i, j}is a contracted pair inc. If such anjdoes not… - WickContraction.getDual?_one_eq_noneWickContraction.getDual?_one_eq_none
- WickContraction.self_ne_getDual?_getWickContraction.self_ne_getDual?_get
- WickContraction.getDual?_empty_eq_noneWickContraction.getDual?_empty_eq_none
- WickContraction.self_getDual?_get_memWickContraction.self_getDual?_get_mem
- WickContraction.congr_reflWickContraction.congr_refl
- WickContraction.instDecidableEqWick contractions are decidable.
- WickContraction.fstFieldOfContract_getDual?WickContraction.fstFieldOfContract_getDual?
- WickContraction.fstFieldOfContract_memWickContraction.fstFieldOfContract_mem
- WickContraction.getDual?_getDual?_get_getWickContraction.getDual?_getDual?_get_get
- WickContraction.eraseGiven a Wick contraction
WickContraction n.succand ai : Fin n.succthe Wick contraction associated withnobtained by removing… - WickContraction.congrLift_rflWickContraction.congrLift_rfl
- FieldSpecificationThe structure
FieldSpecificationis defined to have the following content: - A typeFieldwhose elements are the constituent fields of… - perm_card_left_gt_leFor a permutation s of {0, ..., n-1} and a position x with x <= s(x), the number of i < x with s(i) > s(x) is at most the number of j > x…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen WickContraction invariable {𝓕 : FieldSpecification} invariable {n : ℕ} (c : WickContraction n) inlemma WickContraction.mem_not_eq_erase_of_isSome (c : WickContraction n.succ) (i : Fin n.succ) (h : (c.getDual? i).isSome) (ha : a ∈ c.1) (ha2 : a ≠ {i, (c.getDual? i).get h}) : ∃ a', a' ∈ (c.erase i).1 ∧ a = Finset.map i.succAboveEmb a' := by have h2a := c.2.1 a ha rw [@Finset.card_eq_two] at h2a obtain ⟨x, y, hx,hy⟩ := h2a subst hy have hxn : ¬ x = i := by by_contra hx subst hx rw [← @getDual?_eq_some_iff_mem] at ha rw [(Option.get_of_mem h ha)] at ha2 simp at ha2 have hyn : ¬ y = i := by by_contra hy subst hy rw [@Finset.pair_comm] at ha rw [← @getDual?_eq_some_iff_mem] at ha rw [(Option.get_of_mem h ha)] at ha2 simp [Finset.pair_comm] at ha2 simp only [Nat.succ_eq_add_one, ← Fin.exists_succAbove_eq_iff] at hxn hyn obtain ⟨x', hx'⟩ := hxn obtain ⟨y', hy'⟩ := hyn use {x', y'} subst hx' hy' simp only [erase, Nat.succ_eq_add_one, Finset.mem_filter, Finset.mem_univ, Finset.map_insert, Fin.succAboveEmb_apply, Finset.map_singleton, true_and, and_true] exact ha