Closing the general vanishing lemma for doubled plaquettes touching a loop edge: a symbolic proof of the helper-promoted order-4 case
{"In":[0],"a":[1,7,11,34,96,131,160,204],"previous":[2],"note":[3],"we":[4,88],"proved":[5],"that":[6,29,44,79,95,189],"doubled":[8,70,205],"plaquette":[9,72,207],"with":[10,141,208],"loop-type":[12],"edge":[13,98,133,193],"and":[14,31,113],"at":[15,50],"least":[16,51],"two":[17,195],"isolated":[18,61,120,138,209],"edges":[19,57,154,211],"among":[20],"the":[21,45,54,74,103,109,114,125,128,168,186],"remaining":[22,55,210],"three":[23,56],"vanishes":[24],"identically":[25],"(Theorem":[26],"3.2":[27],"of":[28,53,127,153,163,170],"note),":[30],"reported,":[32],"as":[33,118],"computationally":[35],"verified":[36],"but":[37],"symbolically":[38],"unproven":[39],"statement":[40],"(Proposition":[41],"4.1":[42,165],"there),":[43],"same":[46,110,115],"vanishing":[47,129],"persists":[48],"whenever":[49],"one":[52],"is":[58,134,212],"non-loop,":[59],"whether":[60],"or":[62],"promoted":[63],"to":[64],"multiplicity":[65],"4":[66],"via":[67],"an":[68,90,119,137,142,191],"auxiliary":[69],"\\"helper\\"":[71],"--":[73,178],"specific":[75],"mechanism":[76,202],"used":[77],"throughout":[78],"note's":[80],"108-case":[81,173],"computational":[82],"verification.":[83],"We":[84,182],"close":[85],"this":[86,158],"gap:":[87],"prove":[89],"order-4":[91,192],"reduction":[92],"lemma":[93],"showing":[94],"helper-promoted":[97,132],"contributes,":[99],"after":[100],"summing":[101],"out":[102],"helper's":[104],"own":[105],"internal":[106],"indices,":[107],"exactly":[108,167],"delta":[111],"pattern":[112],"scalar":[116],"weight":[117],"edge,":[121],"so":[122],"that,":[123],"for":[124,175],"purposes":[126],"mechanism,":[130],"indistinguishable":[135],"from":[136,199],"one.":[139],"Combined":[140],"elementary":[143],"connectivity":[144],"observation":[145],"(a":[146],"4-cycle":[147],"has":[148],"no":[149],"nonempty":[150],"proper":[151],"subset":[152],"closed":[155],"under":[156],"adjacency),":[157],"gives":[159],"symbolic":[161],"proof":[162],"Proposition":[164],"in":[166],"scope":[169],"its":[171],"original":[172],"verification,":[174],"every":[176],"m≥3":[177],"not":[179,184,213],"only":[180],"m∈{3,5,7}.":[181],"do":[183],"extend":[185],"result":[187],"beyond":[188],"scope:":[190],"whose":[194],"extra":[196],"occurrences":[197],"arise":[198],"some":[200],"other":[201],"than":[203],"helper":[206],"covered.":[214]}
Authors
- Martín Baca (ORCID: https://orcid.org/0009-0007-3432-4926)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-09-17
- DOI
- https://doi.org/10.5281/zenodo.22817228
- Primary Topic
- Logic, programming, and type systems
- Type
- preprint