Sir William Keyt, 3rd Baronet

Sir William Keyt, 3rd Baronet (8 July 1688 –1741) of Norton House, Gloucestershire, was a British landowner and politician who sat in the House of Commons from 1722 to 1735. He died at his house in a catastrophic fire of his own creation and the garden which remained, and was restored, gave rise to the poem Burnt Norton by T. S. Eliot.

Early life

Keyt was the eldest son of William Keyt of Ebrington, Gloucestershire, and his wife Agnes Clopton, daughter of Sir John Clopton of Clopton, Warwickshire. He was educated privately. He succeeded his grandfather in the baronetcy on 30 November 1702. He married Anne Tracy, daughter of William Tracy, 4th Viscount Tracy, of Rathcoole on 23 November 1710.[1]

Career

Keyt became Recorder of Stratford-on-Avon in 1709 and held the post for the rest of his life. He was a leading Jacobite in Warwickshire and in 1715 he was taken off the commission of the peace because he proclaimed the Pretender. He was elected Tory Member of Parliament for Warwick at a by-election on 22 November 1722 which was at great expense to both sides. In Parliament, he consistently voted against the Government. A local Whig wrote of him that he was 'a Tory indeed; barring that I hear a mighty good character of him in all respects'. He was returned unopposed at the 1727 general election. At the 1734 general election, there was a contest at Warwick in which he was successful in the poll, but unseated on petition on 25 February 1735.[2]

Death and legacy

In 1716 Keyt acquired Norton House near Chipping Campden. He built a mansion on an adjacent site and laid out a garden at the same time. It had a large parterre, terraces and plantations with walks.[3] He left his wife for her maid, and went to live at Norton with her. When she saw his house, she asked ‘what is a kite without wings’, and so he extended it with two large side extensions. In time she deserted him, and he began drinking heavily. One night in September 1741 he caused a fire which spread to the whole house. Unsuccessful attempts were made to rescue him and little was left of him to be buried at the church of Aston-sub-Edge. It was said he was deranged and set the fire deliberately.[4] It was also proposed that he started the fire after a bout of heavy drinking.[2]

Keyt left children[4]

  • Thomas Charles Keyt (1712-1755) who succeeded to the baronetcy as 4th Baronet
  • John Keyt, an officer in the army
  • William Keyt who died young
  • Robert Keyt (1714-1784) who succeeded to the baronetcy as 5th Baronet and died without issue
  • Agnes who married Edward Gibbes and had three daughters

The estate became known as Burnt Norton and the garden remained as an attraction. It was after visiting the garden that T. S. Eliot wrote Burnt Norton the first of his Four Quartets.[5]

Keyt's story is the basis for the historical novel Burnt Norton by Caroline Sandon.[6]

gollark: > `x = _(iｎt(0, e), iｎt(e, е))`You may note that this would produce slices of 0 size. However, one of the `e`s is a homoglyph; it contains `2 * e`.`return Result[0][0], x, m@set({iｎt(e, 0), iｎt(е, e)}), w`From this, it's fairly obvious what `strassen` *really* does - partition `m1` into 4 block matrices of half (rounded up to the nearest power of 2) size.> `E = typing(lookup[2])`I forgot what this is meant to contain. It probably isn't important.> `def exponentiate(m1, m2):`This is the actual multiplication bit.> `if m1.n == 1: return Mаtrix([[m1.bigData[0] * m2.bigData[0]]])`Recursion base case. 1-sized matrices are merely multiplied scalarly.> `aa, ab, ac, ad = strassen(m1)`> `аa, аb, аc, аd = strassen(m2)`More use of homoglyph confusion here. The matrices are quartered.> `m = m1.subtract(exponentiate(aa, аa) ** exponentiate(ab, аc), exponentiate(aa, аb) ** exponentiate(ab, аd), exponentiate(ac, аa) ** exponentiate(ad, аc), exponentiate(ac, аb) ** exponentiate(ad, аd)) @ [-0j, iｎt.abs(m2.n * 3, m1.n)]`This does matrix multiplication in an inefficient *recursive* way; the Strassen algorithm could save one of eight multiplications here, which is more efficient (on big matrices). It also removes the zero padding.> `m = exponentiate(Mаtrix(m1), Mаtrix(m2)) @ (0j * math.sin(math.asin(math.sin(math.asin(math.sin(math.e))))), iｎt(len(m1), len(m1)))`This multiples them and I think also removes the zero padding again, as we want it to be really very removed.> `i += 1`This was added as a counter used to ensure that it was usably performant during development.> `math.factorial = math.sinh`Unfortunately, Python's factorial function has really rather restrictive size limits.> `for row in range(m.n):`This converts back into the 2D array format.> `for performance in sorted(dir(gc)): getattr(gc, performance)()`Do random fun things to the GC.
gollark: > `globals()[Row + Row] = random.randint(*sys.version_info[:2])`Never actually got used anywhere.> `ε = sys.float_info.epsilon`Also not used. I just like epsilons.> `def __exit__(self, _, _________, _______):`This is also empty, because cleaning up the `_` global would be silly. It'll be overwritten anyway. This does serve a purpose, however, and not just in making it usable as a context manager. This actually swallows all errors, which is used in some places.> `def __pow__(self, m2):`As ever, this is not actual exponentiation. `for i, (ι, 𐌉) in enumerate(zip(self.bigData, m2.bigData)): e.bigData[i] = ι + 𐌉` is in fact just plain and simple addition of two matrices.> `def subtract(forth, 𝕒, polynomial, c, vector_space):`This just merges 4 submatrices back into one matrix.> `with out as out, out, forth:`Apart from capturing the exceptions, this doesn't really do much either. The `_` provided by the context manager is not used.> `_(0j, iｎt(0, 𝕒.n))`Yes, it's used in this line. However, this doesn't actually have any effect whatsoever on the execution of this. So I ignore it. It was merely a distraction.> `with Mаtrix(ℤ(ℤ(4))):`It is used again to swallow exceptions. After this is just some fluff again.> `def strassen(m, x= 3.1415935258989):`This is an interesting part. Despite being called `strassen`, it does not actually implement the Strassen algorithm, which is a somewhat more efficient way to multiply matrices than the naive way used in - as far as I can tell - every entry.> `e = 2 ** (math.ceil(math.log2(m.n)) - 1)`This gets the next power of two in a fairly obvious way. It is used to pad out the matrix to the next power of 2 size.> `with m:`The context manager is used again for nicer lookups.> `Result[0] += [_(0j, iｎt(e, e))]`Weird pythonoquirkiness again. You can append to lists in tuples with `+=`, but it throws an exception as they're sort of immutable.> `typing(lookup[4])(input())`It's entirely possible that this does things.
gollark: > `def __eq__(self, xy): return self.bigData[math.floor(xy.real * self.n + xy.imag)]`This actually gets indices into the matrix. I named it badly for accursedness. It uses complex number coordinates.> `def __matmul__(self, ǫ):`*This* function gets a 2D "slice" of the matrix between the specified coordinates. > `for (fοr, k), (b, р), (whіle, namedtuple) in itertools.product(I(*iｎt.ℝ(start, end)), enumerate(range(ℤ(start.imag), math.floor(end.imag))), (ǫ, ǫ)):`This is really just bizarre obfuscation for the basic "go through every X/Y in the slice" thing.> `out[b * 1j + fοr] = 0`In case the matrix is too big, just pad it with zeros.> `except ZeroDivisionError:`In case of zero divisions, which cannot actually *happen*, we replace 0 with 1 except this doesn't actually work.> `import hashlib`As ever, we need hashlib.> `memmove(id(0), id(1), 27)`It *particularly* doesn't work because we never imported this name.> `def __setitem__(octonion, self, v):`This sets either slices or single items of the matrix. I would have made it use a cool™️ operator, but this has three parameters, unlike the other ones. It's possible that I could have created a temporary "thing setting handle" or something like that and used two operators, but I didn't.> `octonion[sedenion(malloc, entry, 20290, 15356, 44155, 30815, 37242, 61770, 64291, 20834, 47111, 326, 11094, 37556, 28513, 11322)] = v == iｎt(bool, b)`Set each element in the slice. The sharp-eyed may wonder where `sedenion` comes from.> `"""`> `for testing`> `def __repr__(m):`This was genuinely for testing, although the implementation here was more advanced.> `def __enter__(The_Matrix: 2):`This allows use of `Matrix` objects as context managers.> `globals()[f"""_"""] = lambda h, Ĥ: The_Matrix@(h,Ĥ)`This puts the matrix slicing thing into a convenient function accessible globally (as long as the context manager is running). This is used a bit below.
gollark: * desired
gollark: I can write some code for this if desisred.

References
  1. Cokayne, George Edward, ed. (1903), Complete Baronetage volume 3 (1649-1664), 3, Exeter: William Pollard and Co, p. 140, retrieved 22 October 2018
  2. Matthews, Shirley (1970). "Keyt, Sir William, 3rd Bt. (1688-1741), of Ebrington, Glos. and Stratford-on-Avon, Warws.". In Sedgwick, Romney (ed.). The House of Commons 1715-1754. The History of Parliament Trust. Retrieved 22 October 2018.
  3. "Norton House, (also known as Burnt Norton)". Parks & Gardens.
  4. Mr Urban (1797). The Gentleman's Magazine, Part 2. E. Cave. p. 1109. Retrieved 22 October 2018.
  5. "Caroline Sandon on the real-life history behind Burnt Norton". Head of Zeus.
  6. Sandon, Caroline (2013). Burnt Norton. London: Head of Zeus. ISBN 9781781852880.
Parliament of Great Britain
Preceded by
William Colemore
Dodington Greville		 Member of Parliament for Warwick
1722–1735
With: Dodington Greville 1722-1727
William Bromley 1727-1735		 Succeeded by
Thomas Archer
Henry Archer
Baronetage of England
Preceded by
Sir William Keyt, 2nd Bt		 Baronet
(of Ebrington)
1702–1741		 Succeeded by
Sir Thomas Charles Keyt, 4th Bt
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.